The Community for Technology Leaders
Green Image
<p>In a distributed system, many algorithms need repeated computation of a global function.These algorithms generally use a static hierarchy for gathering the necessary data fromall processes. As a result, they are unfair to processes at higher levels of the hierarchy,which have to perform more work than processes at lower levels do. In this paper, wepresent a new revolving hierarchical scheme in which the position of a process in thehierarchy changes with time. This reorganization of the hierarchy is achieved concurrently with its use. It results in algorithms that are not only fair to all processes but also less expensive in terms of messages. The reduction in the number of messages is achieved by reusing messages for more than one computation of the global function. The technique is illustrated for a distributed branch-and-bound problem and for asynchronous computation of fixed points.</p>
Index Termsdistributed algorithms; hierarchical systems; function evaluation; repeated computation; global functions; distributed environment; hierarchy reorganization; revolving hierarchical scheme; fairness; message reduction; message reuse; distributed branch-and-bound problem; asynchronous computation; fixed points; distributed programs; permutations

J. Ghosh and V. Garg, "Repeated Computation of Global Functions in a Distributed Environment," in IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 823-834, 1994.
90 ms
(Ver 3.3 (11022016))