Skip to main content
SpringerLink
Log in

Breaking symmetry in synchronous networks

  • Conference paper
  • First Online:
VLSI Algorithms and Architectures (AWOC 1986)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Abrahamson, A. Adler, R. Gelbart, L. Hingram, D. Kirkpatrick, "The bit complexity of probabilistic leader election on a unidirectional ring", Proc. Int. Workshop on Distributed Algorithms on Graphs, Aug. 1985, to appear.

    Google Scholar 

  2. D. Angluin, "Local and global properties in networks of processes", Proc. 12th ACM Symp. on Theory of Computing, April 1980, 82–93.

    Google Scholar 

  3. C. Attiya, M. Snir, M. Warmuth, "Computing on an anonymous ring", Proc. 4th ACM Symp. on Principles of Distributed Computing, Aug. 1985, 196–204.

    Google Scholar 

  4. G. Frederickson, N. Lynch, "The impact of synchronous communication on the problem of electing a leader in a ring", Proc. 16th ACM Symp. Theory of Computing, April 1984, 493–503.

    Google Scholar 

  5. E. Gafni, "Improvements in the time complexity of two message-optimal election algorithms", Proc. 4th ACM Symp. on Principles of Distributed Computing, Aug. 1985, 175–185.

    Google Scholar 

  6. A. Itai, M. Rodeh, "Symmetry breaking in distributive networks", Proc. 22nd IEEE Symp. on Foundations of Computer Science, Oct. 1981, 150–158.

    Google Scholar 

  7. J. van Leeuwen, N. Santoro, J. Urrutia, S. Zaks, "Guessing games and distributed computations in anonymous networks", preliminary draft, Carleton University, March 1986.

    Google Scholar 

  8. M. Overmars, N. Santoro, "An improved election algorithm for synchronous rings", preliminary draft, Carleton University, March 1986.

    Google Scholar 

  9. N. Santoro, D. Rotem, "On the complexity of distributed elections in synchronous graphs", Proc. 11th Int. Workshop on Graphtheoretic Concepts in Computer Science, June 1985, 337–346.

    Google Scholar 

  10. P. Vitanyi, "Distributed elections in an Archimedean ring of processors", Proc. 16th ACM Symp. Theory of Computing, April 1984, 542–547.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Purdue University, 47907, West Lafayette, IN, USA

    Greg N. Frederickson

  2. School of Computer Science, Carleton University, K1S 5B6, Ottawa, Canada

    Nicola Santoro

Authors
  1. Greg N. Frederickson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicola Santoro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Filia Makedon Kurt Mehlhorn T. Papatheodorou P. Spirakis

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frederickson, G.N., Santoro, N. (1986). Breaking symmetry in synchronous networks. In: Makedon, F., Mehlhorn, K., Papatheodorou, T., Spirakis, P. (eds) VLSI Algorithms and Architectures. AWOC 1986. Lecture Notes in Computer Science, vol 227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16766-8_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-16766-8_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16766-2

  • Online ISBN: 978-3-540-38746-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation