Decentralized extrema-finding in circular configurations of processors
Communications of the ACM
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM
Lower Bounds for Distributed Maximum-Finding Algorithms
Journal of the ACM (JACM)
The effects of link failures on computations in asynchronous rings
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Auction allocation of computing resources
Communications of the ACM
Optimal Resilient Distributed Algorithms for Ring Election
IEEE Transactions on Parallel and Distributed Systems
Distributed elections in an archimedean ring of processors
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Leader election in rings with nonunique labels
Fundamenta Informaticae
On the complexity of computation in the presence of link failures: the case of a ring
Distributed Computing
Finding Maximum on an Array Processor with a Global Bus
IEEE Transactions on Computers
Two novel algorithms for electing coordinator in distributed systems basedon bully algorithm
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
A Hierarchical Leader Election Protocol for Mobile Ad Hoc Networks
ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
Symbolic Reachability for Process Algebras with Recursive Data Types
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Leader Election in Extremely Unreliable Rings and Complete Networks
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Simplifying Itai-Rodeh Leader Election for Anonymous Rings
Electronic Notes in Theoretical Computer Science (ENTCS)
Some problems in distributed computational geometry
Theoretical Computer Science
Fair leader election by randomized voting
ICDCIT'04 Proceedings of the First international conference on Distributed Computing and Internet Technology
Leader Election in Rings with Nonunique Labels
Fundamenta Informaticae
| Hi-index | 48.24 |
This note presents a more efficient algorithm for finding the largest element in a circular list of processors when messages can be passed in either direction. It passes 2N*floor(lg N) + 3N messages in the worst case, compared to Chang and Roberts' N(N + 1)/2 and Hirschberg and Sinclair's 8N + 8*ceiling(N lg N) messages. The technique is a selective elimination of possible processes, which then merely relay future messages between the remaining contenders.