Randomized consensus in expected O(n log n) individual work

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2008, Pages 325-333

  Aspnes, James ^a   Attiya, Hagit ^b   Censor, Keren ^b  

^a Yale University   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Consensus; Distributed computing; Randomized algorithms; Shared memory

Indexed keywords

COMPUTATION THEORY;

CONSENSUS; RANDOMIZED ALGORITHMS; SHARED MEMORY; TOTAL WORK; WRITE OPERATIONS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 56349121071     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1400751.1400794     Document Type: Conference Paper

References (14)

1. K. Abrahamson. On achieving consensus using a shared memory. In Proceedings of the 7th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 291-302, 1988.
2. J. Aspnes. Time- and space-efficient randomized consensus. J. Algorithms, 14(3):414-431, 1993.
3. J. Aspnes. Randomized protocols for aynchronous consensus. Distributed Computing, 16(2-3): 165-176, Sept. 2003.
4. J. Aspnes and M. Herlihy. Fast randomized consensus using shared memory. Journal of Algorithms, 11(3):441-461, 1990.
5. 2 n) operations per processor. SIAM J. Comput., 25(5): 1024-1044, 1996.
6. H. Attiya and K. Censor. Tight bounds for asynchronous randomized consensus. In Proceedings of the 39th annual A CM symposium, on Theory of computing (STOC), pages 155-164, 2007.
7. 2 log n) operations. In Proceedings of the 5th International Workshop on Distributed Algorithms (WDAG), pages 143-150, 1991.
8. 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.
9. M. Herlihy. Wait-free synchronization. ACM Trans. Prog. Lang. Syst., 13(1):124-149, January 1991.
10. L. Lamport. The part-time parliament. ACM Trans. Comput. Syst., 16(2): 133-169, May 1998.
11. M. C. Loui and H. H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, pages 163-183, 1987.
12. N. A. Lynch, R. Segala, and F. W. Vaandrager. Observing branching structure through probabilistic contexts. SIAM J. Comput., 37(4):977-1013, 2007.
13. M. Saks, N. Shavit, and H. Woll. Optimal time randomized consensus-making resilient algorithms fast in practice. In Proceedings of the 2nd annual ACM-SIAM symposium, on Discrete algorithms, pages 351-362, 1991.
14. F. B. Schneider. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Comput. Surv., 22(4):299-319, Dec. 1990.