A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Petal: distributed virtual disks
Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
Frangipani: a scalable distributed file system
Proceedings of the sixteenth ACM symposium on Operating systems principles
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
How to Build a Highly Available System Using Consensus
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Revisiting the Paxos Algorithm
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Model Checking TLA+ Specifications
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Active disk paxos with infinitely many processes
Proceedings of the twenty-first annual symposium on Principles of distributed computing
An Efficient Universal Construction for Message-Passing Systems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
On implementing omega with weak reliability and synchrony assumptions
Proceedings of the twenty-second annual symposium on Principles of distributed computing
On using network attached disks as shared memory
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
Communication-efficient leader election and consensus with limited link synchrony
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Consistent and automatic replica regeneration
ACM Transactions on Storage (TOS)
Fastpath Optimizations for Cluster Recovery in Shared-Disk Systems
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Distributed Computing
Consistent and automatic replica regeneration
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Anti-Ω: the weakest failure detector for set agreement
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Two Consensus Algorithms with Atomic Registers and Failure Detector Ω
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Verification of Clock Synchronization Algorithms: Experiments on a Combination of Deductive Tools
Electronic Notes in Theoretical Computer Science (ENTCS)
Open questions on consensus performance in well-behaved runs
Future directions in distributed computing
Dissecting distributed computations
Future directions in distributed computing
A data-centric approach for scalable state machine replication
Future directions in distributed computing
Brief announcement: flash-log - a high throughput log
DISC'10 Proceedings of the 24th international conference on Distributed computing
From paxos to CORFU: a flash-speed shared log
ACM SIGOPS Operating Systems Review
Obstruction-Free algorithms can be practically wait-free
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Proactive leader election in asynchronous shared memory systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Formal verification of distributed algorithms: from pseudo code to checked proofs
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
CORFU: A distributed shared log
ACM Transactions on Computer Systems (TOCS)
| Hi-index | 0.00 |
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.