Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Fault-tolerant distributed algorithm for election in complete networks

  • 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:

  • 157 Accesses

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. Y. Afek and E. Gafni, "Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks," Proc. 4th ACM Sympos. Principles of Distributed Computing, Minacki, Ontario, pp. 186–195, Aug. 1985.

    Google Scholar 

  2. P. A. Alsberg and J. D. Day, "A Principle for Resilient Sharing of Distributed Resources," Proc. 2nd Int. Conf. Software Eng., San Fransisco, pp. 562–570, Oct. 1976.

    Google Scholar 

  3. J. E. Burns, "A Formal Model for Message Passing Systems," Technical Report TR-91, Indiana U., Bloomington, May 1980.

    Google Scholar 

  4. I. A. Cimet and P. R. S. Kumar, "A Resilient Distributed Protocol for Network Synchronization," ACM SIGCOMM Symp. Commun. Arch. and Protocols, Stowe, VT, pp. 358–367, Aug. 1986.

    Google Scholar 

  5. M. J. Fischer, N. A. Lynch, and M. S. Paterson, "Impossibility of Distributed Consensus with One Faulty Process," J. ACM, vol. 32, pp. 374–382, April 1985.

    Article  Google Scholar 

  6. E. Gafni, "Improvements in the Complexity of Two Message-Optimal Election Algorithms," Proc. 4th ACM Sympos. Principles of Distributed Computing, Minacki, Ontario, pp. 175–185, Aug. 1985.

    Google Scholar 

  7. O. Goldreich and L. Shrira, "The Effect of Link Failures on Computations in Asynchronous Rings," Proc. 5th ACM Sympos. Principles of Distributed Computing, Calgary, Alberta, pp. 174–185, Aug. 1986.

    Google Scholar 

  8. 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 Sympos. Principles of Distributed Computing, Vancouver, British Columbia, pp. 199–207, Aug. 1984.

    Google Scholar 

  9. R. Bar-Yehuda, S. Kutten, Y. Wolfstahl, and S. Zaks, "Making Distributed Spanning Tree Algorithms Fault-Resilient," Proc. 4th Symposium on Theoretical Aspects of Computer Science, Passau, Germany, pp. 432–444, Feb. 1987.

    Google Scholar 

  10. M. C. Loui, T. A. Matsushita, and D. B. West, "Election in Complete Networks with a Sense of Direction," Information Processing Letters, vol. 22, pp. 185–187, April 1986.

    Article  MathSciNet  Google Scholar 

  11. D. A. Menasce, G. J. Popek, and R. R. Muntz, "A Locking Protocol for Resource Coordination in Distributed Databases," ACM Trans. Database Systems, vol. 5, pp. 103–138, June 1980.

    Article  Google Scholar 

  12. G. L. Peterson, "Efficient Algorithms for Elections in Meshes and Complete Networks," Technical Report TR-140, U. Rochester, July 1985.

    Google Scholar 

  13. N. Santoro, "Sense of Direction, Topological Awareness, and Communication Complexity," ACM SIGACT NEWS, vol. 16, pp. 50–56, Summer 1984.

    Article  Google Scholar 

  14. R. D. Schlichting and F. B. Schneider, "Fail-Stop Processors: An Approach to Designing Fault-Tolerant Computing Systems," ACM Trans. Computer Systems, vol. 1, pp. 222–238, Aug. 1983.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering and Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, 1101 W. Springfield Ave., 61801, Urbana, Illinois, USA

    Hosame H. Abu-Amara

Authors
  1. Hosame H. Abu-Amara
    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

Abu-Amara, H.H. (1988). Fault-tolerant distributed algorithm for election in complete networks. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019816

Download citation

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

  • 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