Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Distributed Algorithms

WDAG 1987: Distributed Algorithms pp 337–344Cite as

Constructing efficient election algorithms from efficient traversal algorithms

  • Conference paper
  • First Online:

  • 151 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 312))

Abstract

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].

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. J. E. Burns, A Formal Model for Message Passing Systems, Tech. Rep. No. 91, Computer Science Dept., Indiana Univ. (1980).

    Google Scholar 

  4. 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.

    Article  Google Scholar 

  5. R. Gallager, Finding a Leader in a Network with O(E+nlogn) Messages, internal memorandum, MIT.

    Google Scholar 

  6. 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. 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. 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.

    Article  Google Scholar 

  9. G. L. Peterson, Efficient Algorithms for Elections in Meshes and Complete Networks, TR-140, University of Rochester, (August 1984).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Leibniz Center, Department of Computer Science, Hebrew University, 91904, Jerusalem, Israel

    Hagit Attiya

Authors
  1. Hagit Attiya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Attiya, H. (1988). Constructing efficient election algorithms from efficient traversal algorithms. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019814

Download citation

  • DOI: https://doi.org/10.1007/BFb0019814

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19366-1

  • Online ISBN: 978-3-540-39239-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation