Skip to main content
SpringerLink
Log in

A simple model for agreement in distributed systems

  • Conference paper
  • First Online:
Fault-Tolerant Distributed Computing

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

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. Aghili, A. Griefer, R. Kistler, R. Strong, “Highly available communication,” Proceedings of the IEEE International Conference on Communication, 1439–1443, Toronto, 1986.

    Google Scholar 

  2. B. Coan, “A communication-efficient canonical form for fault-tolerant distributed protocols,” Proc. 5th ACM Symp. on the Principles of Distributed Computing, Calgary, Canada, August, 1986.

    Google Scholar 

  3. F. Cristian, H. Aghili, R. Strong, and D. Dolev, “Atomic broadcast: from simple message diffusion to Byzantine agreement,” proceedings, the 15th Int. Conf. on Fault Tolerant Computing, June 1985.

    Google Scholar 

  4. D. Dolev, “The Byzantine generals strike again,” Journal of Algorithms 3:1, 1982.

    Google Scholar 

  5. D. Dolev, M. Fischer, R. Fowler, N. Lynch, and R. Strong, “An efficient algorithm for Byzantine agreement without authentication,” Information and Control 52:3, 257–274, March 1982.

    Article  MATH  MathSciNet  Google Scholar 

  6. D. Dolev, J. Halpern, B. Simons, and R. Strong, “Fault Tolerant Clock Synchronization,” Proc. 3rd ACM Symp. on the Principles of Distributed Computing, Vancouver, 1984.

    Google Scholar 

  7. D. Dolev, N. Lynch, S. Pinter, E. Stark, and W. Weihl, “Reaching approximate agreement in the presence of faults,” Journal of the ACM 33, 499–516, 1986.

    Article  MathSciNet  Google Scholar 

  8. D. Dolev, R. Reischuk, and R. Strong, “Early stopping in Byzantine agreement,” IBM Research Report RJ3915, June, 1983.

    Google Scholar 

  9. D. Dolev and R. Strong, “Authenticated algorithms for Byzantine agreement,” SIAM Journal of Computing 12:4, 656–666, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  10. M. Fischer, “The consensus problem in unreliable distributed systems,” Proc. of the International Conference on Foundations of Computing Theory, Sweden, 1983, see also Yale University Report YALEU/DCS/RR-273, June, 1983.

    Google Scholar 

  11. M. Fischer, N. Lynch, and M. Merritt, “Easy impossibility proofs for distributed consensus problems,” Distributed Computing 1, 26–39, 1986.

    Article  MATH  Google Scholar 

  12. A. Griefer and R. Strong, “DCF: Distributed communication with fault tolerance,” Proc. 7th ACM Symp. on the Principles of Distributed Computing, Vancouver, 1988.

    Google Scholar 

  13. L. Lamport, R. Shostak, and M. Pease, “The Byzantine generals problem,” ACM TOPLAS 4:3, 382–401, July, 1982.

    Article  MATH  Google Scholar 

  14. L. Lamport, “The weak Byzantine generals problem,” JACM 30, 668–676, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  15. S. Mahaney and F. Schneider, “Inexact agreement: accuracy, precision, and graceful degradation,” Proc. 4th ACM Symp. on the Principles of Distributed Computing, Minaki, 1985.

    Google Scholar 

  16. C. Mohan, R. Strong, S. Finkelstein, “Method for distributed commit and recovery using Byzantine agreement within clusters of processors,” Proc. 2nd ACM Symp. on the Principles of Distributed Computing, Montreal, 1983.

    Google Scholar 

  17. M. Pease, R. Shostak, and L. Lamport, “Reaching agreement in the presence of faults,” JACM 27:2, 228–234, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  18. F. Schneider, “Byzantine generals in action: implementing fail-stop processors,” ACM TOCS 2:2, 146–154, May, 1984.

    Article  MATH  Google Scholar 

  19. T. Srikanth and S. Toueg, ”Simulating authenticated broadcasts to derive simple fault-tolerant algorithms,” Distributed Computing, 2:2, 80–94, August 1987.

    Article  Google Scholar 

  20. R. Strong and D. Dolev, “Byzantine agreement,” Digest of Papers from Spring COMPCON, IEEE Computer Society Press, 1983, see also IBM Research Report RJ3714, December, 1982.

    Google Scholar 

  21. R. Strong, “Problems in fault tolerant distributed systems,” Digest of Papers from Spring COMPCON, IEEE Computer Society Press, 1985, see also IBM Research Report RJ4220, December, 1984.

    Google Scholar 

  22. R. Strong, “Problems in maintaining agreement,” Proc. 5th IEEE Symp. on Reliability in Distributed Software and Database Systems, 20–27, Los Angeles, January, 1986.

    Google Scholar 

  23. S. Toueg, K. Perry, and T. Srikanth, “Fast distributed agreement,” SIAM J. Comp. 16, 445–457, 1987.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Raymond Strong IBM Almaden Research Center, 650 Harry Rd, 95120, San Jose, CA

    Danny Dolev

Authors
  1. Danny Dolev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Barbara Simons Alfred Spector

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dolev, D. (1990). A simple model for agreement in distributed systems. In: Simons, B., Spector, A. (eds) Fault-Tolerant Distributed Computing. Lecture Notes in Computer Science, vol 448. Springer, New York, NY. https://doi.org/10.1007/BFb0042324

Download citation

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

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97385-2

  • Online ISBN: 978-0-387-34812-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation