Advertisement

Optimal resilient ring election algorithms

  • M. Y. Chan
  • F. Y. L. Chin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 312)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BV85]
    H.L. Bodlaender and J. van Leeuwen, New upperbounds for decentralized extrema-finding in a ring of processors, Technical report RUU-CS-85-15, Computer Science Department, Rijksuniversiteit Utrecht, Netherlands, 1985.Google Scholar
  2. [B80]
    J.E. Burns, A formal model for message passing systems, Technical report 91, Computer Science Department, Indiana University, Bloomington, Indiana, 1980.Google Scholar
  3. [CR79]
    E. Chang and R. Roberts, An improved algorithm for decentralized extrema-finding in circular configurations of processes, CACM 22 (1979) 281–283.Google Scholar
  4. [DKR82]
    D. Dolev, M. Klawe, and M. Rodeh, An O(n log n) unidirectional distributed algorithm for extrema finding in a circle, Journal of Algorithms 3 (1982) 245–260.CrossRefGoogle Scholar
  5. [FF84]
    R.E. Filman and D.P. Friedman, Coordinated computing: Tools and techniques for distributed software, McGraw-Hill 1984.Google Scholar
  6. [F82]
    W.R. Franklin, On an improved algorithm for decentralized extrema finding in circular configurations of processors, CACM 25 (1982) 336–337.Google Scholar
  7. [FL84]
    G.N. Frederickson and N.A. 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, Washington, D.C.(1984) 493–503.Google Scholar
  8. [GS86]
    O. Goldreich and L. Shrira, The effects of link failure on computations in asynchronous rings, Proceedings of the ACM Symposium on Principles of Distributed Computing, Calgary Alberta (August 1986) 174–185.Google Scholar
  9. [HS80]
    D.S. Hirshberg and J.B. Sinclair, Decentralized extrema-finding in circular configurations of processors, CACM 23 (1980) 627–628.Google Scholar
  10. [IT81]
    A. Itai and M. Rodeh, Symmetry breaking in distributive networks, Proceedings 22nd IEEE Symposium on Foundations of Computer Science (October 1981) 150–158.Google Scholar
  11. [KRS84]
    E. Korach, D. Rotem and N. Santoro, Distributed election in a circle without a global sense of orientation, International Journal of Computer Mathematics 14 (1984).Google Scholar
  12. [L77]
    G. LeLann, Distributed systems — Towards a formal approach, Information Processing 77, Elsevier Science, New York (1977) 155–160.Google Scholar
  13. [MSZ85]
    S. Moran, M. Shalom and S. Zaks, A. 1.44...nlogn algorithm for distributed leader finding in bidirectional rings of processors, Technical report #389, Computer Science Department, Technion, November 1985.Google Scholar
  14. [PKR82]
    J. Pachl, E. Korach and D. Rotem, Lower bounds for distributed maximum-finding algorithms, Journal of ACM 31(1984), 905–918.CrossRefGoogle Scholar
  15. [P82]
    G.L. Peterson, An O(nlogn) unidirectional algorithm for the circular extrema problem, ACM Transactions on Programming Languages and Systems 4(1982) 758–762.CrossRefGoogle Scholar
  16. [RKS84]
    D. Rotem, E. Korach and N. Santoro, Analysis of a distributed algorithm for extrema finding in a ring, Technical report SCS-TR-61, School of Computer Science, Carleton University, August 1984.Google Scholar
  17. [V84]
    P.M.B. Vitanyi, Distributed election in an Archimedean ring of processors, Proceedings of the 16th Annual ACM Symposium on the Theory of Computing, Washington, D.C.(1984), 542–547.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • M. Y. Chan
    • 1
  • F. Y. L. Chin
    • 2
  1. 1.Computer Science DeptUniversity of Texas at DallasRichardson
  2. 2.Computer StudiesUniversity of Hong KongHong Kong

Personalised recommendations