A Proof of Correctness for Egalitarian Paxos

Download Now
Provided by: Carnegie Mellon University
Topic: Big Data
Format: PDF
In this paper the authors present a proof of correctness for Egalitarian Paxos (EPaxos), a new distributed consensus algorithm based on Paxos. EPaxos achieves three goals: availability without interruption as long as a simple majority of replicas are reachable - its availability is not interrupted when replicas crash or fail to respond; uniform load balancing across all replicas - no replicas experience higher load because they have special roles; and optimal commit latency in the wide-area when tolerating one and two failures, under realistic conditions.
Download Now

Find By Topic