Skip to main content
SpringerLink
Log in
Book cover

International Conference on Foundations of Software Technology and Theoretical Computer Science

FSTTCS 1985: Foundations of Software Technology and Theoretical Computer Science pp 101–115Cite as

New protocols for the election of a leader in a ring

  • Conference paper
  • First Online:

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

Abstract

In this paper we investigate the impact of time for the election of a leader in a distributed environment. We propose a new protocol schema that can be specialized to obtain several protocols with different communication-time characteristics when the network is ring shaped and the communications between processors are synchronous.

work supported by project MPI Analisi e Progetto di Algoritmi

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 Network of Processors" Proceedings of the 12th Annual Symposium on Theory of Computing (1980).

    Google Scholar 

  2. J.E.Burns, "A formal model for message passing systems, TR91", Indiana University (September 1980).

    Google Scholar 

  3. D.Dolev, M.Klawe, M.Rodeh, "An O(n log n) unidirectional distributed algorithm for extrema finding in a circle" J.Algorithms 3,3 (1982).

    Google Scholar 

  4. G.Frederickson, N.Lynch, "The impact of synchronous communication on the problem of electing a leader in a ring", Proceedings of the 16th Annual ACM Symposium on Theory of Computing (1984).

    Google Scholar 

  5. E.Gafni, "Imprvements in the timme complexity of two message-optimal election algorithms", Proceedings of the 4th ACM Symposium on Principles of Distributed Computing (1985).

    Google Scholar 

  6. D.S.Hirschberg, J.B.Sinclair, "Decentralized extremafinding in circular configurations of processes, Communications ACM 23, (1980).

    Google Scholar 

  7. G.L.Peterson, "An O(n log n) Unidirectional algorithm for the circular extrema problem", Trans.Prog. Lang.Sys. 4,4, (1982).

    Google Scholar 

  8. P.Vitanyi, "Distributed elections in archimedean ring of processors", Proceedings of the 16th Annual ACM Symposium on Theory of Computing, (1984).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dip. Informatica e Sistemistica, Universita' di Roma, via Eudossiana 18, 00185, Roma, Italy

    A. Marchetti-Spaccamela

Authors
  1. A. Marchetti-Spaccamela
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

S. N. Maheshwari

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Marchetti-Spaccamela, A. (1985). New protocols for the election of a leader in a ring. In: Maheshwari, S.N. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1985. Lecture Notes in Computer Science, vol 206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16042-6_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-16042-6_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16042-7

  • Online ISBN: 978-3-540-39722-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation