Skip to main content

Algorithms and system design in the highly available systems project

  • Systems Session I
  • Conference paper
  • First Online:
Fault-Tolerant Distributed Computing

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

  • 127 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. F. Cristian, H. Aghili, R. Strong and D. Dolev, “Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement”, Proc. 15th International Conference on Fault-Tolerant Computing Systems, Ann Arbor, Michigan, 1985. Revised as IBM Research Report RJ5244, July 30, 1986.

    Google Scholar 

  2. A. Griefer and R. Strong, “DCF: Distributed Communication with Fault Tolerance” Proceedings of the 7th ACM Symp. on PODC, 42–51, Toronto, August, 1988. Also IBM Research Report RJ6361, August 3, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

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

Finkelstein, S.J. (1990). Algorithms and system design in the highly available systems project. 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/BFb0042332

Download citation

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

  • 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