Skip to main content
SpringerLink
Log in

Optimal resilient ring election algorithms

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1987)

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

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. 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. J.E. Burns, A formal model for message passing systems, Technical report 91, Computer Science Department, Indiana University, Bloomington, Indiana, 1980.

    Google Scholar 

  3. 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. 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.

    Article  Google Scholar 

  5. R.E. Filman and D.P. Friedman, Coordinated computing: Tools and techniques for distributed software, McGraw-Hill 1984.

    Google Scholar 

  6. W.R. Franklin, On an improved algorithm for decentralized extrema finding in circular configurations of processors, CACM 25 (1982) 336–337.

    Google Scholar 

  7. 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. 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. D.S. Hirshberg and J.B. Sinclair, Decentralized extrema-finding in circular configurations of processors, CACM 23 (1980) 627–628.

    Google Scholar 

  10. 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. 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. G. LeLann, Distributed systems — Towards a formal approach, Information Processing 77, Elsevier Science, New York (1977) 155–160.

    Google Scholar 

  13. 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. J. Pachl, E. Korach and D. Rotem, Lower bounds for distributed maximum-finding algorithms, Journal of ACM 31(1984), 905–918.

    Article  Google Scholar 

  15. G.L. Peterson, An O(nlogn) unidirectional algorithm for the circular extrema problem, ACM Transactions on Programming Languages and Systems 4(1982) 758–762.

    Article  Google Scholar 

  16. 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. 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 

Download references

Author information

Authors and Affiliations

  1. Computer Science Dept, University of Texas at Dallas, 75083-0688, Richardson, Texas

    M. Y. Chan

  2. Computer Studies, University of Hong Kong, Pokfulam Road, Hong Kong

    F. Y. L. Chin

Authors
  1. M. Y. Chan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. Y. L. Chin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chan, M.Y., Chin, F.Y.L. (1988). Optimal resilient ring election algorithms. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019815

Download citation

  • DOI: https://doi.org/10.1007/BFb0019815

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19366-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation