Tight bounds for asynchronous randomized consensus

Journal of the ACM

Volumn 55, Issue 5, 2008, Pages

  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

CONTROL THEORY; RANDOM PROCESSES;

DISTRIBUTED COMPUTING; ISOPERIMETRIC INEQUALITY; LOWER BOUND; RANDOMIZED ALGORITHMS; SHARED-MEMORY;

ALGORITHMS;

EID: 56349162640     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1411509.1411510     Document Type: Article

References (38)

1. ABRAHAMSON, K. 1988. On achieving consensus using a shared memory. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM, New York, 291-302.
2. ALON, N., AND SPENCER, J. H. 2000. The Probabilistic Method, 2nd ed. Wiley, New York.
3. ASPNES, J. 1990. Time- and space-efficient randomized consensus. In Proceedings of the 9th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM, New York, 325-332.
4. ASPNES, J. 1998. Lower bounds for distributed coin-flipping and randomized consensus. J. ACM 45, 3 (May), 415-450.
5. ASPNES, J. 2003. Randomized protocols for aynchronous consensus. Distrib. Comput. 16, 2-3 (Sept.), 165-176.
6. ASPNES, J., ATTIYA, H., AND CENSOR, K. 2008. Randomized consensus in expected O(n log n) individual work. In Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM, New York, 325-334.
7. ASPNES, J., AND HERLIHY, M. 1990. Fast randomized consensus using shared memory. J. Algorithms 11, 3, 441-461.
8. 2 n) operations per processor. SIAM J. Comput. 25, 5, 1024-1044.
9. ATTIYA, H., AND CENSOR, K. 2008. Lower bounds for randomized consensus under a weak adversary. In Proceedings of the 27th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM, New York, 315-324.
10. ATTIYA, H., DOLEV, D., AND SHAVIT, N. 1989. Bounded polynomial randomized consensus. In Proceedings of the 8th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM, New York, 281-293.
11. ATTIYA, H., AND WELCH, J. L. 2004. Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd ed. Wiley, New York.
12. AUMANN, Y. 1997. Efficient asynchronous consensus with the weak adversary scheduler. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM, New York, 209-218.
13. AUMANN, Y., AND BENDER, M. A. 2005. Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler. Distrib. Comput. 17, 3 (Mar.), 191-207.
14. AUMANN, Y., AND KAPAH-LEVY, A. 1999. Cooperative sharing and asynchronous consensus using single-reader single-writer registers. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 61-70.
15. BAR-JOSEPH, Z., AND BEN-OR, M. 1998. A tight lower bound for randomized synchronous consensus. In Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM, New York, 193-199.
16. BEN-OR, M., PAVLOV, E., AND VAIKUNTANATHAN, V. 2006. Byzantine agreement in the full-information model in o(log n) rounds. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC). ACM, New York, 179-186.
17. 2 log n) operations. In Proceedings of the 5th International Workshop on Distributed Algorithms (WDAG). Springer-Verlag, Berlin/Heidelberg, Germany, 143-150.
18. CHANDRA, T. D. 1996. Polylog randomized wait-free consensus. In Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM, New York, 166-175.
19. CHOR, B., ISRAELI, A., AND LI, M. 1987. On processor coordination using asynchronous hardware. In Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing (PODC). ACM, New York, 86-97.
20. DOLEV, D., AND STRONG, H. R. 1983. Authenticated algorithms for byzantine agreement. SIAM J. Comput. 12, 4, 656-666.
21. FELLER, W. 1968. An Introduction to Probability Theory and Its Applications, 3rd ed. Vol. 1. Wiley, New York.
22. FISCHER, M. J., AND LYNCH, N. A. 1982. A lower bound for the time to assure interactive consistency. Inf. Process. Lett. 14, 4, 183-186.
23. FISCHER, M. J., LYNCH, N. A., AND PATERSON, M. S. 1985. Impossibility of distributed consensus with one faulty process. J. ACM 32, 2 (Apr.), 374-382.
24. GOLDWASSER, S., PAVLOV, E., AND VAIKUNTANATHAN, V. 2006. Fault-tolerant distributed computing in full-information networks. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (Washington, DC) IEEE Computer Society Press, Los Alamitos, CA, 15-26.
25. HERLIHY, M. 1991. Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13, 1 (Jan.), 124-149.
26. KAPRON, B., KEMPE, D., KING, V., SAIA, J., AND SANWALANI, V. 2008. Fast asynchronous byzantine agreement and leader election with full information. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM, New York, 1038-1047.
27. KING, V., SAIA, J., SANWALANI, V., AND VEE, E. 2006a. Scalable leader election. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA). ACM, New York, 990-999.
28. KING, V., SAIA, J., SANWALANI, V., AND VEE, E. 2006b. Towards secure and scalable computation in peer-to-peer networks. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (Washington, DC) IEEE Computer Society Press, Los Alamitos, CA, 87-98.
29. LAMPORT, L. 1998. The part-time parliament. ACM Trans. Comput. Syst. 16, 2 (May), 133-169.
30. LOUI, M. C., AND ABU-AMARA, H. H. 1987. Memory Requirements for Agreement Among Unreliable Asynchronous Processes. JAI Press, Greenwich, Conn., 163-183.
31. LYNCH, N. A. 1996. Distributed Algorithms. Morgan-Kaufmann, San Mateo, CA.
32. MOSES, Y., AND RAJSBAUM, S. 2002. A layered analysis of consensus. SIAM J. Comput. 31, 4, 989-1021.
33. MOTWANI, R., AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambrigde University Press, Cambridge, UK.
34. RAYNAL, M., AND ROY, M. 2005. A note on a simple equivalence between round-based synchronous and asynchronous models. In Proceedings of the 11th Pacific Rim International Symposium on Dependable Computing (PRDC) (Washington, DC) IEEE Computer Society Press, Los Alamitos, CA, 387-392.
35. SAKS, M., SHAVIT, N., AND WOLL, H. 1991. Optimal time randomized consensus-making resilient algorithms fast in practice. In Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 351-362.
36. SANTORO, N., AND WIDMAYER, P. 1989. Time is not a healer. In Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science (STACS). Springer-Verlag, Berlin/Heidelberg, Germany 304-313.
37. SCHECHTMAN, G. 1981. Levy type inequality for a class of finitie metric spaces. In Lecture Notes in Mathematics: Martingle Theory in Harmonic Analysis and Banach Spaces. Vol. 939. Springer-Verlag, Berlin/Heidelberg, Germany 211-215.
38. SCHNEIDER, F.B. 1990. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Comput. Surv. 22, 4 (Dec.), 299-319.