Electing a leader in a synchronous ring
Journal of the ACM (JACM)
Computing on an anonymous ring
Journal of the ACM (JACM)
Computing on an anonymous network
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Better computing on the anonymous ring
Journal of Algorithms
Computing Boolean functions on anonymous networks
Information and Computation
Theoretical Computer Science
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Comparison of initial conditions for distributed algorithms on anonymous networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Computing anonymously with arbitrary knowledge
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
On an improved algorithm for decentralized extrema finding in circular configurations of processors
Communications of the ACM
Decentralized extrema-finding in circular configurations of processors
Communications of the ACM
Distributed Algorithms
Electing a Leader when Processor Identity Numbers are not Distinct (Extended Abstract)
Proceedings of the 3rd International Workshop on Distributed Algorithms
Sorting Multisets in Anonymous Rings
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
| Hi-index | 0.00 |
We consider the leader election problem in a ring whose nodes have possibly nonunique labels. Every node knows a priori its own label and two integers, m and M, which are, respectively, a lower and an upper bound on the (unknown) size n of the ring. The aim is to decide whether leader election is possible and to perform it, if so. We consider both the synchronous and the asynchronous version of the problem and we are interested in message complexity in both cases. For the synchronous version we present an algorithm using O(n log n) messages and working in time O(M). Moreover, our algorithm uses O(n) messages when all identifiers are distinct. For the asynchronous version we show an Ω(nM) lower bound on message complexity for this problem, and present an algorithm for it using O(nM) messages.