Skip to main content
SpringerLink
Log in

Disk Paxos

  • Original article
  • Published:
Distributed Computing Aims and scope Submit manuscript

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 article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Computer Science Department, UCLA , , , , , , US

    Eli Gafni

  2. Microsoft Research, 1065 La Avenida Mountain View, CA 94043, USA , , , , , , US

    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

Additional information

Received: January 2001 / Accepted: March 2002

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-002-0070-8

Search

Navigation