Election in a complete network with a sense of direction
Information Processing Letters
A modular technique for the design of efficient distributed leader finding algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to distributed algorithms
Introduction to distributed algorithms
Optimal elections in labeled hypercubes
Journal of Parallel and Distributed 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)
Constructing Efficient Election Algorithms from Efficient Traversal Algorithms
Proceedings of the 2nd International Workshop on Distributed Algorithms
A Simple, Efficient Algorithm for Maximum Finding on Rings
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
Sense of Direction in Processor Networks
SOFSEM '95 Proceedings of the 22nd Seminar on Current Trends in Theory and Practice of Informatics
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
In this paper we present a general and still flexible modular technique for the design of efficient leader election algorithms in N-node networks. Our approach can be viewed as a generalization of the previous method introduced by Korach, Kutten and Moran [7]. We show how well-known O(N) message leader election algorithms in oriented hypercubes and tori [12,11,15,16] can be derived by our technique. This is in contrast with Ω(N log N) message lower bound for the approach in [7]. Moreover, our technique can be used to design new linear leader election algorithms for unoriented butterflies and cube connected cycles, thus demonstrating its usefulness. This is an improvement over the O(N log N) solutions obtained from the general leader election algorithm [5]. These results are of interest, since tori and corresponding chordal rings were the only known symmetric topologies for which linear leader election algorithms in unoriented case were known [11,15].