Search

Complex engineering applications demand powerful computing resources. An object based distributed system is suitable for such applications due to the inherent parallelism nature in the object based computing model. As the model is based on message passing, which in turns relies on location transparent object names, an efficient name translation system is therefore required to map the object names to the corresponding physical addresses dynamically. In this paper, we propose a heuristic distributed search algorithm, the hierarchy random walker (HRW), to take advantage of the locality of object communications thereby increasing the overall system performance. Analysis of the simulation results from a number of benchmark programs have demonstrated that the benefits of the proposed algorithm are in terms of flexibility and efficient to locate the most used objects. The approach will be applied to intelligent techniques for engineering problems.