Advertisement

Breaking symmetry in synchronous networks

  • Greg N. Frederickson
  • Nicola Santoro
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 227)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [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. [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. [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. [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. [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. [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. [8]
    M. Overmars, N. Santoro, "An improved election algorithm for synchronous rings", preliminary draft, Carleton University, March 1986.Google Scholar
  9. [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. [10]
    P. Vitanyi, "Distributed elections in an Archimedean ring of processors", Proc. 16th ACM Symp. Theory of Computing, April 1984, 542–547.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Greg N. Frederickson
    • 1
  • Nicola Santoro
    • 2
  1. 1.Department of Computer SciencePurdue UniversityWest LafayetteUSA
  2. 2.School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations