Message and time efficient consensus protocols for synchronous distributed systems

For a synchronous distributed system of n processes with up to t potential and f actual crash failures, where (t

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

[2]  Bernadette Charron-Bost,et al.  Revisiting Safety and Liveness in the Context of Failures , 2000, CONCUR.

[3]  Idit Keidar,et al.  A simple proof of the uniform consensus synchronous lower bound , 2003, Inf. Process. Lett..

[4]  Michel Raynal.  Consensus in synchronous systems: a concise guided tour , 2002, 2002 Pacific Rim International Symposium on Dependable Computing, 2002. Proceedings..

[5]  Danny Dolev,et al.  Early stopping in Byzantine agreement , 1990, JACM.

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

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

[8]  Yoram Moses,et al.  A Layered Analysis of Consensus , 2002, SIAM J. Comput..

[9]  Sam Toueg,et al.  Time and Message Efficient Reliable Broadcasts , 1990, WDAG.

[10]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

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

[12]  Marcin Paprzycki,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..

[13]  Achour Mostéfaoui,et al.  Using Conditions to Expedite Consensus in Synchronous Distributed Systems , 2003, DISC.

[14]  Daniel P. Siewiorek,et al.  Reliable Computer Systems: Design and Evaluation, Third Edition , 1998 .

[15]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[16]  Kai-Yeung Siu,et al.  Message-Optimal Protocols for Fault-Tolerant Broadcasts/Multicasts in Distributed Systems with Crash Failures , 1995, IEEE Trans. Computers.

[17]  Marcos K. Aguilera,et al.  A Simple Bivalency Proof that t-Resilient Consensus Requires t + 1 Rounds , 1998, Inf. Process. Lett..

[18]  Jun Xu,et al.  A unified proof of minimum time complexity for reaching consensus and uniform consensus - an oracle-based approach , 2002, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings..

[19]  Robert S. Swarz,et al.  Reliable Computer Systems: Design and Evaluation , 1992 .

[20]  Jiannong Cao,et al.  A bivalency proof of the lower bound for uniform consensus , 2005, Inf. Process. Lett..

[21]  Carole Delporte-Gallet,et al.  Fast fault-tolerant agreement algorithms , 2005, PODC '05.