Disk Paxos (2000) [38 citations — 2 self]
ftp://ftp.digital.com/pub/DEC/SRC/research-reports
http://gatekeeper.dec.com/pub/DEC/SRC/research-rep
http://research.microsoft.com/users/lamport/pubs/d
DBLP
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Eli Gafni and Eli Gafni and Leslie Lamport and Leslie Lamport},
title = {Disk Paxos},
booktitle = {Distributed Computing},
year = {2000},
pages = {330--344}
}
Years of Citing Articles
Bookmarks
OpenURL
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. iii Contents 1 Introduction 1 2 The State-Machine Approach 2 3 An Informal Description of Disk Synod 3 3.1 The Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.2 Why the Algorithm Works . . . . . . . . . . . . . . . . . . . . 5 3.3 Deriving Classic Paxos from Disk Paxos . . . . . . . . . . . . 7 4 Conclusion 8 4.1 Implementation Considerations . . . . . . . . . . . . . . . . . 8 4.2 Concluding Remarks . . . . . . . . . . . . . . . . . . . . . . . 9 Bibliography 10 Appendix 11 A.1 The Specification of Consensus . . . . . . . . . . . . . . . . . 12 A.2 The Disk Synod Algorithm . . . . . . . . . . . ...
