A simple proof of the uniform consensus synchronous lower bound

Information Processing Letters

Volumn 85, Issue 1, 2003, Pages 47-52

  Keidar, Idit ^a,b   Rajsbaum, Sergio ^c,d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c HEWLETT PACKARD COMPANY   (United States)

^d UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

Consensus; Distributed computing; Fault tolerance; Lower bounds

Indexed keywords

ALGORITHMS; FAULT TOLERANT COMPUTER SYSTEMS; PROBLEM SOLVING;

CONSENSUS PROBLEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0037448292     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00333-2     Document Type: Article

References (16)

1. Aguilera M.K., Toueg S. A simple bivalency-based proof that t-resilient consensus requires t + 1 rounds. Inform. Process. Lett. 71:(3-4):1999;155-158.
2. Charron-Bost B., Schiper A. Uniform consensus is harder than consensus (extended abstract), Technical Report DSC/2000/028. May 2000;Swiss Federal Institute of Technology, Lausanne, Switzerland.
3. Dolev D., Reischuk R., Strong H.R. Early stopping in Byzantine agreement. J. ACM. 37:(4):1990;720-741.
4. Dwork C., Moses Y. Knowledge and common knowledge in a Byzantine environment: Crash failures. Inform. Comput. 88:(2):1990;156-186.
5. Dwork C., Skeen D. The inherent cost of nonblocking atomic commitment. ACM Symposium on Principles of Distributed Computing (PODC). 1983;1-11.
6. Fich F., Ruppert E. Lower bounds in distributed computing. 14th International Symposium on DIStributed Computing (DISC). October 2000;1-28.
7. Fischer M., Lynch N., Paterson M. Impossibility of distributed consensus with one faulty process. J. ACM. 32:1985;374-382.
8. Guerraoui R. Revisiting the relationship between non-blocking atomic commitment and consensus. Hélary J.-M., Raynal M. 9th International Workshop on Distributed Algorithms (WDAG). Lecture Notes in Comput. Sci. 972:September 1995;87-100 Springer, Berlin.
9. Guerraoui R. Indulgent algorithms. 19th ACM Symposium on Principles of Distributed Computing (PODC). 2000;289-297.
10. Keidar I., Rajsbaum S. On the cost of fault-tolerant consensus when there are no faults - a tutorial, Technical Report MIT-LCS-TR-821. May 2001;MIT Laboratory for Computer Science, Cambridge, MA. Preliminary version in SIGACT News. 32:(2):2001;45-63. (published May 15th 2001).
11. L. Lamport, Lower bounds on consensus, Unpublished manuscript, March 2000.
12. Lynch N.A. Distributed Algorithms. 1996;Morgan Kaufmann, Los Altos, CA.
13. Moses Y., Rajsbaum S. A layered analysis of consensus. SIAM J. Comput. 31:(4):2002;989-1021. Previous version in: PODC, 1998.
14. Moses Y., Rajsbaum S. A layered analysis of consensus. SIAM J. Comput. 31:(4):2002;989-1021. Previous version in: PODC, 1998.
15. Schiper A. Early consensus in an asynchronous system with a weak failure detector. Distributed Comput. 10:(3):1997;149-157.
16. Skeen D. Nonblocking commit protocols. ACM SIGMOD International Symposium on Management of Data. 1981;133-142.