Skip to main content
Conference Proceedings

Disk paxos

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1914 330-344
DOI: 10.1007/3-540-40026-5_22
41Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Gafni, E., & Lamport, L. (2000). Disk paxos. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1914, pp. 330–344). Springer Verlag. https://doi.org/10.1007/3-540-40026-5_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free