EPaxos* simplifies Egalitarian Paxos with a rigorously proved failure-recovery algorithm and generalizes it to optimal failure thresholds satisfying n >= max{2e+f-1, 2f+1}.
Then there exists a quorumQ′such that every process q∈Q′has sent aPreAcceptOK(id′, D′ q[,_])message with ⋃ q∈Q′D′ q = D′
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Making Democracy Work: Fixing and Simplifying Egalitarian Paxos (Extended Version)
EPaxos* simplifies Egalitarian Paxos with a rigorously proved failure-recovery algorithm and generalizes it to optimal failure thresholds satisfying n >= max{2e+f-1, 2f+1}.