Abstract
We present a distributed algorithm for electing a leader (i. e., breaking symmetry) in bidirectional rings ofN processors with no global sense of orientation, that uses at most 1.44 ...N logN+O(N) messages in the worst case.
This is a preview of subscription content, log in via an institution to check access.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
References
Boldlaender HL, van Leeuwen J (1985) New upperbounds for decentralized extrema-finding in a ring of processors. Tech Rep RUU-CS-85-15, Dept Comput Sci, University of Utrecht, Utrecht
Dolev D, Klawe M, Rodeh M (1982) AnO (nlogn) unidirectional distributed algorithm for extrema finding in a circle. J Algorithms 3: 245–260
Knuth DE (1968) The art of computer programming, vol I: Fundamental algorithms. Addison Wesley, Reading, MA
LeLann G (1977) Distributed systems-towards a formal approach. In: Gilchrist B (ed) Information Processing 77 (IFIP), North-Holland, Amsterdam, pp 155–160
Peterson GL (1982) AnO (nlogn) undirectional algorithm for the circular extrema problem. ACM ToPlaS 4: 758–762
Santoro N, Korach E, Rotem D (1982) Decentralized extremafinding in circular configurations of processors: an improved algorithm. Congr Numeratium 34: 401–412
Author information
Authors and Affiliations
Additional information
Jan van Leeuwen received his M. Sc. degree in 1969 (cum laude) and the Ph.D. degree in 1972 from the University of Utrecht, Utrecht, The Netherlands. He held a postdoctorate fellowship in computer science at the University of California at Berkeley (1972–1973), visiting assistant professorship in computer science at the State University of New York at Buffalo (1973–1974, 1975–1976), and a visiting associate professorship in computer science at The Pennsylvania State University, University Park (1976–1977). In 1977 he was appointed Associate Professor of Computer Science at the University of Utrecht and became head of the new Department of Computer Science at this university. He is presently Full Professor of Computer Science. Dr. van Leeuwen is active in many disciplines within computer science. His primary research interests are fundamental studies in varied areas of computer science, viz. the analysis and complexity of computer algorithms, in both a theoretical and an applied sense (e. g. data structures, machine models, VLSI, parallel and distributed computing, and cryptography).
Richard B. Tan is an Associate Professor of Mathematics and Computer Science at the University of Sciences and Arts of Oklahoma. He spends his summers at the University of Utrecht, the Netherlands. His research interests are in distributed computation and graph algorithms. He received the B. Sc. in Physics from Beloit College, WI., the M.S. in Computer Science and the Ph.D. (in 1980) in Mathematics from the University of Oklahoma.
This work was done while the second author was visiting the University of Utrecht, supported by a grant of the Netherlands Organization for the Advancement of Pure Research (ZWO)
Rights and permissions
About this article
Cite this article
van Leeuwen, J., Tan, R.B. An improved upperbound for distributed election in bidirectional rings of processors. Distrib Comput 2, 149–160 (1987). https://doi.org/10.1007/BF01782775
Issue Date:
DOI: https://doi.org/10.1007/BF01782775