Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Structured derivations of consensus algorithms for failure detectors
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
ACM Transactions on Computer Systems (TOCS)
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Replication management using the state-machine approach
Distributed systems (2nd Ed.)
Indulgent algorithms (preliminary version)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Revisiting the PAXOS algorithm
Theoretical Computer Science
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Distributed Algorithms
ACM SIGACT news distributed computing column 5
ACM SIGACT News
Active disk paxos with infinitely many processes
Proceedings of the twenty-first annual symposium on Principles of distributed computing
ACM SIGACT News
How to Build a Highly Available System Using Consensus
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
An Efficient Universal Construction for Message-Passing Systems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Election Vs. Consensus in Asynchronous Systems
Election Vs. Consensus in Asynchronous Systems
Failure detection and consensus in the crash-recovery model
Distributed Computing
ACM SIGACT News
ACM SIGACT news distributed computing column 11
ACM SIGACT News
The Information Structure of Indulgent Consensus
IEEE Transactions on Computers
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
Byzantine disk paxos: optimal resilience with byzantine shared memory
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Invariants come from templates
Proceedings of the 10th international workshop on Formal methods for industrial critical systems
Active disk Paxos with infinitely many processes
Distributed Computing - Special issue: PODC 02
IEEE Transactions on Dependable and Secure Computing
Harmful dogmas in fault tolerant distributed computing
ACM SIGACT News
Using asynchrony and zero degradation to speed up indulgent consensus protocols
Journal of Parallel and Distributed Computing
FaTLease: scalable fault-tolerant lease negotiation with paxos
HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
Local Terminations and Distributed Computability in Anonymous Networks
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Bosco: One-Step Byzantine Asynchronous Consensus
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Paxos for System Builders: an overview
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
Two Consensus Algorithms with Atomic Registers and Failure Detector Ω
ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
The complexity of obstruction-free implementations
Journal of the ACM (JACM)
FaTLease: scalable fault-tolerant lease negotiation with Paxos
Cluster Computing
Proceedings of the 5th European conference on Computer systems
Byzantine consensus with few synchronous links
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Brief announcement: a shared disk on distributed storage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
On the automated implementation of time-based paxos using the IOA compiler
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Reconfigurable distributed storage for dynamic networks
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
On the cost of composing shared-memory algorithms
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
The celebrated Paxos algorithm of Lamport implements a fault-tolerant deterministic service by replicating it over a distributed message-passing system. This paper presents a deconstruction of the algorithm by factoring out its fundamental algorithmic principles within two abstractions: an eventual leader election and an eventual register abstractions. In short, the leader election abstraction encapsulates the liveness property of Paxos whereas the register abstraction encapsulates its safety property. Our deconstruction is faithful in that it preserves the resilience and efficiency of the original Paxos algorithm in terms of stable storage logs, message complexity, and communication steps. In a companion paper, we show how to use our abstractions to reconstruct powerful variants of Paxos.