Skip to main content
SpringerLink
Log in

Disk Paxos

  • Conference paper
  • First Online:
Distributed Computing (DISC 2000)

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

Included in the following conference series:

Abstract

We present an algorithm, called Disk Paxos, for implementing a reliable distributed system with a network of processors and disks. Like the original Paxos algorithm, Disk Paxos maintains consistency in the presence of arbitrary non-Byzantine faults. Progress can be guaranteed as long as a majority of the disks are available, even if all processors but one have failed.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hagit Attiya, Amotz Bar-Noy, and Danny Dolev. Sharing memory robustly in message-passing systems. Journal of the ACM, 42(1):124–142, January 1995.

    Article  MATH  Google Scholar 

  2. Kenneth Birman, André Schiper, and Pat Stephenson. Lightweight causal and atomic group multicast. ACM Transactions on Computer Systems, 9(3):272–314, August 1991.

    Article  Google Scholar 

  3. Roberto De Prisco, Butler Lampson, and Nancy Lynch. Revisiting the Paxos algorithm. In Marios Mavronicolas and Philippas Tsigas, eds., Proceedings of the 11th International Workshop on Distributed Algorithms (WDAG 97), volume 1320 of Lecture Notes in Computer Science, pages 111–125, Saarbruken, Germany, 1997. Springer-Verlag.

    Google Scholar 

  4. Michael J. Fischer, Nancy Lynch, and Michael S. Paterson. Impossibility of dis-tributed consensus with one faulty process. Journal of the ACM, 32(2):374–382, April 1985.

    Article  MATH  MathSciNet  Google Scholar 

  5. Eli Gafni and Leslie Lamport. Disk paxos. Technical Report 163, Com-paq Systems Research Center, July 2000. Currently available on the World Wide Web at http://gatekeeper.dec.com/pub/DEC/SRC/research-reports/abstracts/src-rr-163.html.

  6. Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, July 1978.

    Article  MATH  Google Scholar 

  7. Leslie Lamport. On interprocess communication. Distributed Computing, 1:77–101, 1986.

    Article  MATH  Google Scholar 

  8. Leslie Lamport. A fast mutual exclusion algorithm. ACM Transactions on Com-puter Systems, 5(1): 1–11, February 1987.

    Article  Google Scholar 

  9. Leslie Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872–923, May 1994.

    Article  Google Scholar 

  10. Leslie Lamport. The part-time parliament. ACM Transactions on Computer Sys-tems, 16(2):133–169, May 1998.

    Article  Google Scholar 

  11. Leslie Lamport. Specifying concurrent systems with TLA+. In Manfred Broy and Ralf Steinbriiggen, eds., Calculational System Design, pages 183–247, Amster-dam, 1999. IOS Press.

    Google Scholar 

  12. Butler W. Lampson. How to build a highly available system using consensus. In Ozalp Babaoglu and Keith Marzullo, eds., Distributed Algorithms, volume 1151 of Lecture Notes in Computer Science, pages 1–17, Berlin, 1996. Springer-Verlag.

    Google Scholar 

  13. Edward K. Lee and Chandramohan Thekkath. Petal: Distributed virtual disks. In Proceedings of the Seventh International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VII), pages 84–92, New York, October 1996. ACM Press.

    Google Scholar 

  14. Fred B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299–319, December 1990.

    Article  Google Scholar 

  15. Marion Dale Skeen. Crash Recovery in a Distributed Database System. PhD thesis, University of California, Berkeley, May 1982.

    Google Scholar 

  16. Chandramohan Thekkath, Timothy Mann, and Edward K. Lee. Frangipani: A scalable distributed file system. In Proceedings of the 16th ACM Symposium on Op-erating Systems Principles, pages 224–237, New York, October 1997. ACM Press.

    Google Scholar 

  17. Yuan Yu, Panagiotis Manolios, and Leslie Lamport. Model checking TLA+ specifi-cations. In Laurence Pierre and Thomas Kropf, eds., Correct Hardware Design and Verification Methods, volume 1703 of Lecture Notes in Computer Science, pages 54–66, Berlin, Heidelberg, New York, September 1999. Springer-Verlag. 10th IFIP wg 10.5 Advanced Research Working Conference, CHARME ’99.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, UCLA, USA

    Eli Gafni

  2. Compaq Systems Research Center, USA

    Leslie Lamport

Authors
  1. Eli Gafni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leslie Lamport
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Brown University, 115 Waterman Street, Providence, RI 02912, USA

    Maurice Herlihy

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gafni, E., Lamport, L. (2000). Disk Paxos. In: Herlihy, M. (eds) Distributed Computing. DISC 2000. Lecture Notes in Computer Science, vol 1914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40026-5_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-40026-5_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41143-7

  • Online ISBN: 978-3-540-40026-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation