Speaker: Sotiris Kentros
Day:  Wednesday, 2/07/2006
Room: ITEB 336
Time: 2:00pm

Fast Paxos by Leslie Lamport

Published at:
Distrib. Comput. (2006) 19: pages 79-103

Abstract (from paper).
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.

http://www.cse.uconn.edu/~akiayias/csets/