Disk Paxos

  • Eli Gafni
  • Leslie Lamport
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1914)


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.


Consensus Problem Consensus Algorithm Disk Block Faulty Processor Mutual Exclusion Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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.zbMATHCrossRefGoogle Scholar
  2. 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.CrossRefGoogle Scholar
  3. 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. 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.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 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
  6. 6.
    Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, July 1978.zbMATHCrossRefGoogle Scholar
  7. 7.
    Leslie Lamport. On interprocess communication. Distributed Computing, 1:77–101, 1986.zbMATHCrossRefGoogle Scholar
  8. 8.
    Leslie Lamport. A fast mutual exclusion algorithm. ACM Transactions on Com-puter Systems, 5(1): 1–11, February 1987.CrossRefGoogle Scholar
  9. 9.
    Leslie Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872–923, May 1994.CrossRefGoogle Scholar
  10. 10.
    Leslie Lamport. The part-time parliament. ACM Transactions on Computer Sys-tems, 16(2):133–169, May 1998.CrossRefGoogle Scholar
  11. 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. 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. 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. 14.
    Fred B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Computing Surveys, 22(4):299–319, December 1990.CrossRefGoogle Scholar
  15. 15.
    Marion Dale Skeen. Crash Recovery in a Distributed Database System. PhD thesis, University of California, Berkeley, May 1982.Google Scholar
  16. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Eli Gafni
    • 1
  • Leslie Lamport
    • 2
  1. 1.Computer Science DepartmentUCLAUSA
  2. 2.Compaq Systems Research CenterUSA

Personalised recommendations