Election in a complete network with a sense of direction
Information Processing Letters
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Optimal lower bounds for some distributed algorithms for a complete network of processors
Theoretical Computer Science
Distributed function evaluation in the presence transmission faults
SIGAL '90 Proceedings of the international symposium on Algorithms
Introduction to distributed algorithms
Introduction to distributed algorithms
Optimal elections in labeled hypercubes
Journal of Parallel and Distributed Computing
Leader Election in Complete Networks
SIAM Journal on Computing
Optimal distributed algorithms in unlabeled tori and chordal rings
Journal of Parallel and Distributed Computing
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
Time-message trade-offs for the weak unison problem
Nordic Journal of Computing
Yet Another Modular Technique for Efficient Leader Election
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Efficient leader election using sense of direction
Distributed Computing
| Hi-index | 0.00 |
We consider the problem of leader election in asynchronous oriented N-node complete networks. We present a leader election algorithm with O(N) message and O(log logN) time complexity. The message complexity is optimal and the time complexity is the best possible under the assumption of message optimality. The best previous leader election algorithm for asynchronous oriented complete networks by Singh [16] achieves O(N) message and O(logN) time complexity.