论文信息 - How fast can eventual synchrony lead to consensus?

How fast can eventual synchrony lead to consensus?

It is well known that the consensus problem can be solved in a distributed system if, after some time T/sub S/, no process fails and there is some upper bound /spl delta/ on how long it takes to deliver a message. We know of no existing algorithm that guarantees consensus among N processes before time T/sub S/+O(N/spl delta/). We show that consensus can be achieved by time T/sub S/+O(/spl delta/).

[1] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[2] Nancy A. Lynch,et al. A Lower Bound for the Time to Assure Interactive Consistency , 1982, Inf. Process. Lett..

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

[4] Nancy A. Lynch,et al. Consensus in the presence of partial synchrony , 1988, JACM.

[5] Sam Toueg,et al. Unreliable failure detectors for reliable distributed systems , 1996, JACM.

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

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

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

[9] Achour Mostéfaoui,et al. Leader-Based Consensus , 2001, Parallel Process. Lett..

[10] Butler W. Lampson,et al. The ABCD's of Paxos , 2001, PODC '01.

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

[12] Miguel Castro,et al. Practical byzantine fault tolerance and proactive recovery , 2002, TOCS.

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

[14] Rachid Guerraoui,et al. The overhead of consensus failure recovery , 2007, Distributed Computing.