State based Paxos

Authors:
Nicolo Rivetti;Angelo Corsaro
Affiliations:
Sapienza University of Rome;Chief Technology Officer Prismtech, Orsay, France
Venue:
Proceedings of the Industrial Track of the 13th ACM/IFIP/USENIX International Middleware Conference
Year:
2013

Citing 6
Cited 0

Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
The part-time parliament

ACM Transactions on Computer Systems (TOCS)
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
The ABCD's of Paxos

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Paxos made live: an engineering perspective

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
ZooKeeper: wait-free coordination for internet-scale systems

USENIXATC'10 Proceedings of the 2010 USENIX conference on USENIX annual technical conference

Quantified Score

Hi-index	0.00

Visualization

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.