Tight bounds for asynchronous randomized consensus

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 155-164

  Attiya, Hagit ^a   Censor, Keren ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Distributed computing; Isoperimetric inequality; Lower bound; Randomized algorithms; Shared memory

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; FINITE ELEMENT METHOD; PARALLEL ALGORITHMS; PROBABILITY DISTRIBUTIONS;

ISOPERIMETRIC INEQUALITY; LOWER BOUNDS; RANDOMIZED ALGORITHMS; SHARED MEMORY;

RANDOM PROCESSES;

EID: 35448936821     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250814     Document Type: Conference Paper

References (28)

1. K. Abrahamson. On achieving consensus using a shared memory. PODC 1988, pp. 291-302.
2. J. Aspnes. Time- and space-efficient randomized consensus. PODC 1990, pp. 325-332.
3. J. Aspnes. Lower bounds for distributed coin-flipping and randomized consensus. J. ACM, 45(3):415-450, May 1998.
4. J. Aspnes. Randomized protocols for aynchronous consensus. Dist. Comp., 16(2-3):165-176, Sept. 2003.
5. J. Aspnes and M. Herlihy. Fast randomized consensus using shared memory. J. Alg., 11(3):441-461, 1990.
6. 2 n) operations per processor. SIAM J. Comput., 25(5):1024-1044, 1996.
7. H. Attiya, D. Dolev, and N. Shavit. Bounded polynomial randomized consensus. PODC 1989, pp. 281-293.
8. H. Attiya and J. L. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. John Wiley & Sons, 2nd edition, 2004.
9. Y. Aumann. Efficient asynchronous consensus with the weak adversary scheduler. PODC 1997, pp. 209-218.
10. Y. Aumann and M. A. Bender. Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler. Dist. Comp., 17(3):191-207, Mar. 2005.
11. Y. Aumann and A. Kapah-Levy. Cooperative sharing and asynchronous consensus using single-reader single-writer registers. SODA 1999, pp. 61-70.
12. Z. Bar-Joseph and M. Ben-Or. A tight lower bound for randomized synchronous consensus. PODC 1998, pp. 193-199.
13. 2 log n) operations. WDAG 1991, pp. 143-150.
14. T. D. Chandra. Polylog randomized wait-free consensus. PODC 1996, pp. 166-175.
15. B. Chor, A. Israeli, and M. Li. On processor coordination using asynchronous hardware. PODC 1987, pp. 86-97.
16. D. Dolev and H. R. Strong. Authenticated algorithms for byzantine agreement. SIAM J. Comput., 12(4):656-666, 1983.
17. W. Feller. An Introduction to Probability Theory and Its Applications, volume 1. John Wiley & Sons, 3rd edition, 1968.
18. W. Feller. An Introduction to Probability Theory and Its Applications, volume 2. John Wiley & Sons, 2nd edition, 1971.
19. 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.
20. 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.
21. M. Herlihy. Wait-free synchronization. ACM Trans. Prog. Lang. Syst, 13(1):124-149, January 1991.
22. L. Lamport. The part-time parliament. ACM Trans. Comput. Syst., 16(2):133-169, May 1998.
23. M. C. Loui and H. H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, pp. 163-183, 1987.
24. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
25. Y. Moses and S. Rajsbaum. The unified structure of consensus: A layered analysis approach. PODC 1998, pp. 123-132.
26. M. Saks, N. Shavit, and H. Woll. Optimal time randomized consensus-making resilient algorithms fast in practice. PODC 1991, pp. 351-362.
27. G. Schechtman. Levy type inequality for a class of finitie metric spaces. In Lecture Notes in Mathematics: Martingle Theory in Harmonic Analysis and Banach Spaces, volume 939, pp. 211-215. Springer-Verlag, 1981.
28. F. B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Comput Surv., 22(4):299-319, Dec. 1990.