Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Distributed Algorithms

WDAG 1989: Distributed Algorithms pp 303–314Cite as

Electing a leader when processor identity numbers are not distinct (extended abstract)

  • Conference paper
  • First Online:

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

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. Y. Afek and M. Saks, "Detecting Global Termination Conditions in the Face of Uncertainty", Proc. 6th ACM Symp. on Principles of Distributed Computing, Vancouver, B.C., 109–124, 1987.

    Google Scholar 

  2. D. Angluin, "Local and global properties in networks of processors", Proc. 12th ACM Symposium on Theory of Computing, Los Angeles, California, 82–93, 1980.

    Google Scholar 

  3. R. Bar-Yehuda and S. Kutten, "Fault Tolerant Leader Election with Termination Deatection", Tech. Report., Duke University, CS-1986-12, 1986, Durham.

    Google Scholar 

  4. R. E. Johnson and F. B. Schneider, "Symmetry and similarity in distributed systems", Proc. 4th ACM Symp. on Principles of Distributed Computing, Minaki, Ontario, 13–22, 1985.

    Google Scholar 

  5. A E. Korach, S. Moran, and S. Zaks, "Tight lower and upper bounds for some distributed algorithms for a complete network of processors", Proc. 3rd ACM Symp. on Principles of Distributed Computing, 199–207, 1984.

    Google Scholar 

  6. G. LeLann, "Distributed systems — Towards a formal approach", Information Processing '77, 155–160, 1977.

    Google Scholar 

  7. M. Merritt, "Elections in the presence of faults", Proc. 3rd ACM Symp. on Principles of Distributed Computing, New York, 134–142, 1984.

    Google Scholar 

  8. M. Yamashita and T. Kameda, "Computing on anonymous networks", Proc. 7th ACM Symp. on Principles of Distributed Computing, Tronto, Ontario, 117–130, 1988.

    Google Scholar 

  9. M. Yamashita and T. Kameda, "Computing functions on an anonymous network", LCCR Tech. Rept., Simon Fraser University, 87-16, 1987, Vancouver, B.C.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, Hiroshima University, Saijo, 724, Higashi-Hiroshima, Japan

    M. Yamashita

  2. School of Computing Science, Simon Fraser University, V5A 1S6, Burnaby, B.C., Canada

    T. Kameda

Authors
  1. M. Yamashita
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. Kameda
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jean-Claude Bermond Michel Raynal

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yamashita, M., Kameda, T. (1989). Electing a leader when processor identity numbers are not distinct (extended abstract). In: Bermond, JC., Raynal, M. (eds) Distributed Algorithms. WDAG 1989. Lecture Notes in Computer Science, vol 392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51687-5_52

Download citation

  • DOI: https://doi.org/10.1007/3-540-51687-5_52

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51687-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation