Fast Paxos

As used in practice, traditional consensus algorithms require three message delays before any process can learn the chosen value. Fast Paxos is an extension of the classic Paxos algorithm that allows the value to be learned in two message delays. How and why the algorithm works are explained informally, and a TLA+ specification of the algorithm appears as an appendix.

tr-2005-112.pdf
PDF file

In  Distributed Computing

Details

TypeArticle
Pages79-103
Volume19
Number2
InstitutionMicrosoft Research
> Publications > Fast Paxos