Lower bounds for randomized consensus under a weak adversary

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2008, Pages 315-324

  Attiya, Hagit ^a   Censor, Keren ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Consensus; Distributed computing; Lower bound; Message passing; Randomized algorithms; Shared memory

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; ECONOMIC AND SOCIAL EFFECTS; MEMORY ARCHITECTURE;

ASYNCHRONOUS SYSTEM; CONSENSUS; CONSENSUS ALGORITHMS; LOWER BOUNDS; MESSAGE PASSING SYSTEMS; RANDOMIZED ALGORITHMS; SHARED MEMORY; SHARED MEMORY SYSTEM;

MESSAGE PASSING;

EID: 56349160521     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1400751.1400793     Document Type: Conference Paper

References (27)

1. J. Aspnes, Lower bounds for distributed coin-flipping and randomized consensus. J. ACM, 45(3):415-450, May 1998.
2. J. Aspnes. Randomized protocols for asynchronous consensus. Distributed Computing, 16(2-3):165-176, Sept. 2003.
3. H. Attiya, A. Bar-Noy, D. Dolev, D. Peleg, and R. Reischuk. Renaming in an asynchronous environment. J. ACM, 37(3):524-548, July 1990.
4. H. Attiya and K. Censor. Tight bounds for asynchronous randomized consensus. In Proceedings of the 39th annual ACM symposium on Theory of computing (STOC), pages 155-164, 2007.
5. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics (2nd edition). McGraw-Hill, 1st edition, 1998.
6. Y. Aumann. Efficient asynchronous consensus with the weak adversary scheduler. In Proceedings of the 16th Annual ACM Symposium, on Principles of Distributed Computing (PODC), pages 209-218, 1997.
7. Y. Aumann and M. A. Bender. Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler. Distributed Computing, 17(3):191-207, Mar. 2005.
8. Y. Aumann and A. Kapah-Levy. Cooperative sharing and asynchronous consensus using single-reader single-writer registers. In Proceedings of the 10th annual, ACM-SIAM Symposium on Discrete algorithms (SODA), pages 61-70, 1999.
9. Z. Bar-Joseph and M. Ben-Or. A tight lower bound for randomized synchronous consensus. In Proceedings of the 17th Annual ACM Symposium, on Principles of Distributed Computing (PODC), pages 193-199, 1998.
10. M. Ben-Or, E. Pavlov, and V. Vaikuntanathan. Byzantine agreement in the full-information model in o(logra) rounds. In Proceedings of the 38th annual ACM symposium, on Theory of computing (STOC), pages 179-186, 2006.
11. M. Castro and B. Liskov. Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst., 20(4):398-461, 2002.
12. T. D. Chandra. Polylog randomized wait-free consensus. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 166-175, 1996.
13. S. Chaudhuri. More choices allow more faults: Set consensus problems in totally asynchronous systems. Information and Computation, 105(1): 132-158, 1993.
14. L. Cheung. Randomized wait-free consensus using an atomicity assumption. In Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS), pages 47-60, 2005.
15. B. Chor, A. Israeli, and M. Li. On processor coordination using asynchronous hardware. In Proceedings of the 6th Annual ACM Symposium, on Principles of Distributed Computing (PODC), pages 86-97, 1987.
16. B. Chor, M. Merritt, and D. B. Shmoys. Simple constant-time consensus protocols in realistic failure models. J. ACM, 36(3):591-614, July 1989.
17. D. Dolev and H. R. Strong. Authenticated algorithms for byzantine agreement. SIAM J. Comput., 12(4):656-666, 1983.
18. M. J. Fischer and N. A. Lynch. A lower bound for the time to assure interactive consistency. Inf. Process. Lett., 14(4):183-186, 1982.
19. M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374-382, Apr. 1985.
20. S. Goldwasser, E. Pavlov, and V. Vaikuntanathan. Fault-tolerant distributed computing in full-information networks. In Proceedings of the 47th Annual IEEE Symposium, on Foundations of Computer Science (FOCS), pages 15-26, 2006.
21. M. Herlihy. Wait-free synchronization. ACM Trans. Prog. Lang. Syst., 13(1):124-149, January 1991.
22. B. Kapron, D. Kempe, V. King, J. Saia, and V. Sanwalani. Fast asynchronous byzantine agreement and leader election with full information. In Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms (SODA), pages 1038-1047, 2008.
23. A. Karlin and A. C.-C. Yao. Probabilistic lower bounds for byzantine agreement and clock synchronization. Unpublished manuscript.
24. V. King, J. Saia, V. Sanwalani, and E. Vee. Scalable leader election. In Proceedings of the 17th annual ACM-SIAM symposium, on Discrete algorithm, (SODA), pages 990-999, 2006.
25. R. Kotla, L. Alvisi, M. Dahlin, A. Clement, and E. Wong. Zyzzyva: Speculative byzantine fault tolerance. In Proceedings of the 22nd ACM Symposium on Operating Systems Principles (SOSP), pages 45-58, 2007.
26. M. C. Loui and H. H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, pages 163-183, 1987.
27. Y. Moses and S. Rajsbaum. A layered analysis of consensus. SIAM J. Comput., 31(4):989-1021, 2002.