Abstract
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 wellknown 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 logN) 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 logN) 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].
The research was partially supported by EU Grant No. INCO-COP 96-0195 “ALTEC-KIT” and by the Slovak VEGA project 1/4315/97.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Attiya, H.: Constructing efficient election algorithms from efficient traversal algorithms. In Proc. 2nd Int. Workshop on Distributed Algorithms, LNCS 312, Springer-Verlag, 1987, pp. 337–344.
Attiya, H.-van Leeuwen, J.-Santoro, N.-Zaks, S.: Efficient elections in chordal ring networks. Algorithmica4 (1989), pp. 437–466.
Dobrev, S.-RuŽička, P.: Linear broadcasting and N log log N election in unoriented hypercubes. Proc. of the 4th International Colloquium on Structural Information and Communication Complexity (SIROCCO’97), Carleton Press, 1997, pp. 52–68.
Flocchini, P.-Mans, B.: Optimal elections in labeled hypercubes. Journal of Parallel and Distributed Computing 33(1), 1996, pp. 76–83.
Gallager, R. G.-Humblet, P. A.-Spira, P. M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Programming Languages and Systems 5 (1983), pp. 66–77.
Higham, L.-Przytycka, T.: A simple, efficient algorithm for maximum finding on rings. In Proc. 7th Int. Workshop on Distributed Algorithms, LNCS 725, Springer-Verlag, 1993, pp. 249-263.
Korach, E.-Kutten, S.-Moran, S.: A modular technique for the design of efficient leader finding algorithms. ACM Transactions on Programming Languages and Systems 12 (1990), pp. 84–101.
Korach, E.-Moran, S.-Zaks, S.: Tight upper and lower bounds for some distributed algorithms for a complete network of processors. Symp. on Principles of Distributed Computing, 1984, pp. 199–207.
Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, 1992.
Loui, M.C.-Matsushita, T.A.-West, D.B.: Election in complete networks with a sense of direction. Information Processing Letters 22 (1986), pp. 185–187. Addendum: Inf. Proc. Lett. 28 (1988), p. 327.
Mans, B.: Optimal Distributed Algorithms in Unlabelled Tori and Chordal Rings. Journal of Parallel and Distributed Computing 46(1), 1997, pp. 80–90.
Peterson, G. L.: Efficient algorithms for elections in meshes and complete networks. Technical Report TR140, Dept. of Computer Science, Univ. of Rochester, Rochester, NY 14627, 1985.
van Leeuwen, J.-Tan, R.B.: An improved upperbound for distributed election in bidirectional rings of processors. Technical Report RUU-CS-85-23, Dept. of Computer Science, University of Utrecht, August 1985.
Tel, G.: Introduction to Distributed Algorithms. Cambridge University Press, Cambridge, 1994.
Tel, G.: Sense of Direction in Processor Networks. In: SOFSEM’95, Theory and Practise of Informatics, LNCS 1012, Springer-Verlag, 1995, pp. 50–82.
Tel, G.: Linear election in oriented hypercubes. Parallel Processing Letters 5 (1995), pp. 357–366.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dobrev, S., RuŽička, P. (1998). Yet Another Modular Technique for Efficient Leader Election. In: Rovan, B. (eds) SOFSEM’ 98: Theory and Practice of Informatics. SOFSEM 1998. Lecture Notes in Computer Science, vol 1521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49477-4_23
Download citation
DOI: https://doi.org/10.1007/3-540-49477-4_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65260-1
Online ISBN: 978-3-540-49477-5
eBook Packages: Springer Book Archive