Constructing efficient election algorithms from efficient traversal algorithms

  • Hagit Attiya
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 312)


Traversal and Election are two foundamental tasks in distributed systems. A traversal algorithm enables a processor to send a message from node to node around the system. An election algorithm ends with some processor in a distinguished state (the leader). Traversal is a task which is executed locally, while an election algorithm requires global coordination among processors. In this paper, we present a general technique for using traversal algorithms to construct election algorithms. The algorithm simplifys and improves the previously known technique of [KKM].


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [A]
    D. Angluin, Local and Global Properties in Networks of Processors, proc. of the 12th Annual ACM Symp. on Theory of Computing (1980), pp. 82–93.Google Scholar
  2. [AG]
    Y. Afek and E. Gafni, Election and Traversal in Unidirectional Networks, proc. of the Third Annual ACM Symp. on Principles of Distributed Computing (1984).Google Scholar
  3. [B]
    J. E. Burns, A Formal Model for Message Passing Systems, Tech. Rep. No. 91, Computer Science Dept., Indiana Univ. (1980).Google Scholar
  4. [DKR]
    D. Dolev, M. Klawe and M. Rodeh, An O(n logn) Unidirectional Distributed Algorithm for Extrema-Finding in a Circle, Journal of Algorithms, Vol. 3, No. 3 (September 1982), pp. 245–260.CrossRefGoogle Scholar
  5. [G]
    R. Gallager, Finding a Leader in a Network with O(E+nlogn) Messages, internal memorandum, MIT.Google Scholar
  6. [KKM]
    E. Korach, S. Kutten and S. Moran, A Modular Technique for the Design of Efficient Distributed Leader Finding Algorithms, proc. of the Forth Annual ACM Symp. on Principle of Distributed Computing (1985), pp. 163–174.Google Scholar
  7. [KMZ]
    E. Korach, S. Moran and S. Zaks, Tight Lower and Upper Bounds for some Distributed Algorithms for a Complete Network of Processors, proc. of the Third Annual ACM Symp. on Principles of Distributed Computing (1984) pp. 199–207.Google Scholar
  8. [P1]
    G. L. Peterson, An O(nlogn) Unidirectional Algorithm for the Circular Extrema Problem, ACM trans. on Programming Lang. Syst., Vol. 4, No. 4 (October 1982), pp. 758–762.CrossRefGoogle Scholar
  9. [P2]
    G. L. Peterson, Efficient Algorithms for Elections in Meshes and Complete Networks, TR-140, University of Rochester, (August 1984).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Hagit Attiya
    • 1
  1. 1.The Leibniz Center, Department of Computer ScienceHebrew UniversityJerusalemIsrael

Personalised recommendations