Efficient decentralized consensus protocols
IEEE Transactions on Software Engineering
Designing efficient algorithms for parallel computers
Designing efficient algorithms for parallel computers
Theoretical Computer Science
International Conference on Concurrency on Concurrency 88
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
The “worm” programs—early experience with a distributed computation
Communications of the ACM
General and Efficient Decentralized Consensus Protocols
Proceedings of the 2nd International Workshop on Distributed Algorithms
Publishing: a reliable broadcast communication mechanism
SOSP '83 Proceedings of the ninth ACM symposium on Operating systems principles
Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors
IEEE Transactions on Parallel and Distributed Systems
Cyclic Storage for Fault-Tolerant Distributed Executions
IEEE Transactions on Parallel and Distributed Systems
Global data computation in chordal rings
Journal of Parallel and Distributed Computing
An efficient decentralized algorithm for the distributed trigger counting problem
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
| Hi-index | 0.00 |
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.