Nicolo Rivetti
Angelo Corsaro
ABSTRACT
Paxos is an algorithm that provides an elegant and optimal solution to the consensus problem in distributed systems. Despite its conceptual simplicity, industrial strength and high performance implementations of Paxos are very hard. This paper presents and evaluates the performance of State Paxos, a novel variation of the Paxos consensus algorithm that exploits overwrite semantics to eliminate most of the complexities and inefficiencies introduced by state management. This variation is suitable in applications where the current state depends only on the last update as opposed to the entire history, such as group management and distributed key-value stores.
- T. Chandra, R. Griesemer, and J. Redstone. Paxos Made Live - An Engineering Perspective. In Proc. of the 26th ACM Symp. on Principles of Distributed Computing, 2007. Google Scholar
Digital Library
- M. J. Fischer, N. A. Lynch, and M. S. Patterson. Impossibility of Distributed Consensus with One Faulty Process. J. ACM, 32(2), 1985. Google ScholarDigital Library
- P. Hunt, M. Konar, F. P. Junqueira, and B. Reed. ZooKeeper: wait-free coordination for internet-scale systems. In Proc. of the 2010 USENIX conference on USENIX annual technical conference, 2010. Google ScholarDigital Library
- L. Lamport. The part-time parliament. Trans. on Computer Systems, 16(2), 1998. Google ScholarDigital Library
- L. Lamport. Paxos Made Simple. ACM SIGACT News (Distributed Computing Column), 32(4), 2001.Google Scholar
- L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Trans. on Programming Languages and Systems, 4(3), 1982. Google ScholarDigital Library
- B. W. Lampson. The ABCD's of Paxos. In Proc. of the 20th ACM Symp. on Principles of Distributed Computing, 2001. Google ScholarDigital Library
- Levitha repository. github.com/levitha, 2013.Google Scholar
- D. Mazières. Paxos Made Practical. Technical report, Standford University, 2007.Google Scholar
- nuvo.io. nuvo-spaces, github.com/nuvo-io.github.com/nuvo-io, 2013.Google Scholar
- Object Management Group. Data Distribution Service for Real-Time Systems, 2004.Google Scholar
- Object Management Group. Data Distribution Service Interoperability Wire Protocol, 2006.Google Scholar
- PrismTech. OpenSplice DDS. www.prismtech.com, 2013.Google Scholar
- The Scala Language. www.scala-lang.net.Google Scholar
- R. van Renesse. Paxos Made Moderatly Complex. An online version is at www.cs.cornell.edu/courses/CS7412/2011sp/paxos.pdf, 2011.Google Scholar
- State based Paxos
Recommendations
S-Paxos: Offloading the Leader for High Throughput State Machine Replication
SRDS '12: Proceedings of the 2012 IEEE 31st Symposium on Reliable Distributed SystemsImplementations of state machine replication are prevalently using variants of Paxos or other leader-based protocols. Typically these protocols are also leader-centric, in the sense that the leader performs more work than the non-leader replicas. Such ...
Relaxed Paxos: quorum intersection revisited (again)
PaPoC '22: Proceedings of the 9th Workshop on Principles and Practice of Consistency for Distributed DataDistributed consensus, the ability to reach agreement in the face of failures, is a fundamental primitive for constructing reliable distributed systems. The Paxos algorithm is synonymous with consensus and widely utilized in production. Paxos uses two ...
Fast Flexible Paxos: Relaxing Quorum Intersection for Fast Paxos
ICDCN '21: Proceedings of the 22nd International Conference on Distributed Computing and NetworkingPaxos, the de facto standard approach to solving distributed consensus, operates in two phases, each of which requires an intersecting quorum of nodes. Multi-Paxos reduces this to one phase by electing a leader but this leader is also a performance ...
Comments