论文信息 - Fast Paxos

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.

Leslie Lamport | L. Lamport

[1] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[2] Butler W. Lampson,et al. How to Build a Highly Available System Using Consensus , 1996, WDAG.

[3] Leslie Lamport,et al. The part-time parliament , 1998, TOCS.

[4] Miguel Oom Temudo de Castro,et al. Practical Byzantine fault tolerance , 1999, OSDI '99.

[5] A. Schiper,et al. Uniform Consensus is Harder than Consensus ( extended abstract ) , 2000 .

[6] Nancy A. Lynch,et al. Revisiting the PAXOS algorithm , 1997, Theor. Comput. Sci..

[7] Leslie Lamport,et al. Paxos Made Simple , 2001 .

[8] Achour Mostéfaoui,et al. Consensus in One Communication Step , 2001, PaCT.

[9] Péter Urbán,et al. Solving Agreement Problems with Weak Ordering Oracles , 2002, EDCC.

[10] André Schiper,et al. Handling message semantics with Generic Broadcast protocols , 2002, Distributed Computing.

[11] André Schiper,et al. Uniform consensus is harder than consensus , 2004, J. Algorithms.

[12] Piotr Zielinski. Optimistic Generic Broadcast , 2005, DISC.

[13] Leslie Lamport,et al. Lower bounds for asynchronous consensus , 2006, Distributed Computing.

[14] Jean-Philippe Martin,et al. Fast Byzantine Consensus , 2006, IEEE Transactions on Dependable and Secure Computing.