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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received: January 2001 / Accepted: March 2002
Rights and permissions
About this article
Cite this article
Gafni, E., Lamport, L. Disk Paxos. Distrib Comput 16, 1–20 (2003). https://doi.org/10.1007/s00446-002-0070-8
Issue Date:
DOI: https://doi.org/10.1007/s00446-002-0070-8