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}.
At any moment aftert, the processp has cmd[id] = c orcmd[id] =Nop, with the latter possible only ifphase[id]̸=preaccepted
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}.