Journal of the ACM (JACM)
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Graphs and Hypergraphs
Applications of Ramsey's theorem to decision tree complexity
Journal of the ACM (JACM)
Electing a leader in a synchronous ring
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
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Lower bounds on communication complexity in distributed computer networks
Journal of the ACM (JACM)
A modular technique for the design of efficient distributed leader finding algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
A trade-off between information and communication in broadcast protocols
Journal of the ACM (JACM)
Tight lower bounds for probabilistic solitude verification on anonymous rings
Journal of the ACM (JACM)
A modular technique for the design of efficient distributed leader finding algorithms
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Improvements in the time complexity of two message-optimal election algorithms
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Time and message bounds for election in synchronous and asynchronous complete networks
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Optimal Resilient Distributed Algorithms for Ring Election
IEEE Transactions on Parallel and Distributed Systems
A highly asynchronous minimum spanning tree protocol
Distributed Computing
On the complexity of computation in the presence of link failures: the case of a ring
Distributed Computing
The complexity of data aggregation in directed networks
DISC'11 Proceedings of the 25th international conference on Distributed computing
| Hi-index | 0.00 |
We consider the problem of electing a leader in a synchronous ring of n processors. We obtain both positive and negative results. On the one hand, we show that if processor ID's are chosen from some countable set, then there is an algorithm which uses only O(n) messages in the worst case. On the other hand, we obtain two lower bound results: If the algorithm is restricted to use only comparisons of ID's, then we obtain an &Ohgr;(n log n) lower bound for the number of messages required in the worst case. Alternatively, there is a (very fast-growing) function f with the following property. If the number of rounds is required to be bounded by some t in the worst case, and ID's are chosen from any set having at least f(n,t) elements, then any algorithm requires &Ohgr; (n log n) messages in the worst case.