Randomized protocols for asynchronous consensus

Distributed Computing

Volumn 16, Issue 2-3, 2003, Pages 165-175

  Aspnes, James ^a  

^a Yale University   (United States)

Author keywords

Agreement; Asynchrony; Consensus; Randomization

Indexed keywords

ALGORITHMS; ASYNCHRONOUS TRANSFER MODE; COMPUTER SYSTEM RECOVERY; PROBABILITY DISTRIBUTIONS; SCHEDULING;

SHARED MEMORY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0141610192     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-002-0081-5     Document Type: Conference Paper

References (53)

1. Abrahamson KRR (1988) On achieving consensus using a shared memory. In: Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, pp291-302, Toronto, Ontario, Canada, August 1988
2. Afek Y, Greenberg DS, Merritt M, Taubenfeld G (1995) Computing with faulty shared objects. J Assoc Comput Machin 42:1231-1274
3. Afek Y, Merritt M, Taubenfeld G (1999) The power of multiobjects. Inform Comput 153(1):117-138
4. Aguilera MK, Toueg S (1998) Failure detection and randomization: A hybrid approach to solve consensus. SIAM J Comput 28(3):890-903
5. Aguilera MK, Chen W, Toueg S (2000) Failure detection and consensus in the crash recovery model. Distrib Comput 13(2):99-125
6. Aguilera MK, Toueg S (1998) Correctness proof of Ben-Or's randomized consensus algorithm. Technical Report TR98-1682, Cornell University, Computer Science, May 17
7. Alur R, Attiya H, Taubenfeld G (1997) Time-adaptive algorithms for syncronization. SIAM J Comput 26(2):539-556, April 1997
8. Anderson JH, Moir M (1999) Wait-free syncronization in multi-programmed systems: Integrating priority-based and quantum-based scheduling. In: Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, pp 123-132, Atlanta, Georgia, USA, 3-6 May 1999
9. Aspnes J (1993) Time- and space-efficient randomized consensus. J Algorithms 14(3):414-431
10. Aspnes J (1998) Lower bounds for distributed coin-flipping and randomized consensus. J Assoc Comput Machin 45(3):415-450
11. Aspnes J Fast deterministic consensus in a noisy environment. In: Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, pp 299-309, Portland, Oregon, July 2000 To appear, Journal of Algorithms
12. Aspnes J, Herlihy M (1990) Fast randomized consensus using shared memory. J Algorithms 11(3):441-461
13. Aspnes J, Shah G, Shah J Wait-free consensus with infinite arrivals. In: Proceedings of the 34th Annual ACM Symposium on the Theory of Computing, pp 524-533, 19-21 May 2002
14. 2 N) operations per processor. SIAM J Comput 25(5):1024-1044
15. Attiya H, Dolev D, Shavit N Bounded polynomial randomized consensus. In: Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, pp281-293, Edmonton, Alberta, Canada, 14-16 August 1989
16. Attiya H, Dwork C, Lynch N, Stockmeyer L (1994) Bounds on the time to reach agreement in the presence of timing uncertainty. Journal Assoc Comput Machin 41(1): 122-152,
17. Attiya H, Welch J (1998) Distributed Computing: Fundamentals, Simulations, and Advanced Topics. New York, NY: McGraw-Hill
18. Yonatan Aumann Efficient asynchronous consensus with the weak adversary scheduler. In: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, pp 209-218, Santa Barbara, California, 21-24 August 1997
19. Aumann Y, Bender MA Efficient asynchronous consensus with the value-oblivious adversary scheduler. In: Meyer auf der Heide M, Monien (eds) Automata, Languages and Programming, 23rd International Colloquium, Lecture Notes in Computer Science, Vol 1099, pp 622-633, Paderbom, Germany, 8-12 July 1996, Berlin Heidelberg New York: Springer
20. Ben-Or M Another advantage of free choice: Completely asynchronous agreement protocols (extended abstract). In: Proceedings of the Second Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp 27-30, Montreal, Quebec, Canada, August 1983
21. Bracha G, Rachman O Approximated counters and randomized consensus. Technical Report 662, Technion, 1990
22. 2log n) operations. In: Toueg S, Spirakis PG, Kirousis LM (eds) Distributed Algorithms, 5th International Workshop, Lecture Notes in Computer Science Vol. 579, pp 143-150, Delphi, Greece, 7-9 October 1991, Berlin Heidelberg New York: Springer 1992
23. Bracha G, Toueg S (1985) Asynchronous consensus and broadcast protocols. J Assoc Comput Machin 32(4):824-840
24. Buhrman H, Panconesi A, Silvestri R, Vitanyi PMB (2000) On the importance of having an identity or is consensus really universal? In: Proceedings of the Fourteenth International Symposium on Distributed Computing, pp 134-148, Toledo, Spain, 4-6 October
25. Canetti R, Rabin T (1993) Fast asynchronous Byzantine agreement with optimal resilience (extended abstract). In: Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, pp 42-51, San Diego, California, 16-18 May
26. Chandra TD (1996) Polylog randomized wait-free consensus. In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, pp 166-175, Philadelphia, Pennsylvania, USA, 23-26 May
27. Chandra TD, Hadzilacos V, Toueg S (1996) The weakest failure detector for solving Consensus. J Assoc Comput Machin 43(4):685-722
28. Chandra TD, Toueg S (1996) Unreliable failure detectors for reliable distributed systems. J Assoc Comput Machin 43(2):225-267
29. Chor B, Dwork C (1989) Randomization in Byzantine agreement. In: Advances in Computing Research 5: Randomness and Computation, pp 443-497. Greenwich, Connecticut: JAI Press
30. Chor B, Israeli A, Li M (1994) Wait-free consensus using asynchronous hardware. SIAM J Comput 23(4):701-712
31. Dolev D, Dwork C, Stockmeyer L (1987) On the minimal synchronism needed for distributed consensus. J Assoc Comput Machin 34(1):77-97
32. Dolev D, Friedman R, Keidar I, Malkhi D (1997) Failure detectors in omission failure environments. In: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, pp 286
33. Dwork C, Herlihy M, Plotkin S, Waarts O (1999) Time-lapse snapshots. SIAM J Comput 28(5):1848-1874
34. Dwork C, Lynch N, Stockmeyer L (1988) Consensus in the presence of partial synchrony. J Assoc Comput Machin 35(2):288-323
35. Feldman P, Micali S (1997) An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM J Comput 26(4): 873-933
36. Feller W (1970) An Introduction to Probability Theory and Its Application. New York: Wiley, 3rd edn
37. Fischer MJ, Lynch NA, Paterson MS (1985) Impossibility of distributed consensus with one faulty process. J Assoc Comput Machin 32(2):374-382
38. Goldreich O, Petrank E (1990) The best of both worlds: Guaranteeing termination in fast randomized byzantine agreement protocols. Inform Process Lett 36(1):45-49
39. Graham RL, Yao AC (1989) On the improbability of reaching Byzantine agreement. In: Proceedings of the 21st Annual ACM Symposium on the Theory of Computing, pp467-478, 15-17 May
40. Herlihy M (1991) Wait-free synchronization. ACM Trans Program Lang Syst 13(1):124-149
41. Herlihy M (1993) A methodology for implementing highly concurrent data objects, ACM Trans Program Lang Syst 15(5):745-770
42. Jayanti P (1997) Robust wait-free hierarchies. J Assoc Comput Machin 44(4):592-614
43. Jayanti P, Chandra TD, Toueg S (1998) Fault-tolerant wait-free shared objects. J Assoc Comput Machin 45(3):451-500
44. Loui MC, Abu-Amara HH (1987) Memory requirements for agreement among unreliable asynchronous processes. In: Preparata FP (ed) Advances in Computing Research, Vol 4, Greenwich, Connecticut: JAI Press
45. Pease M, Shostak R, Lamport L (1980) Reaching agreements in the presence of faults. J Assoc Comput Machin 27(2):228-234
46. Plotkin SA (1989) Sticky bits and universitality of consensus. In: Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, pp 159-176, New York, NY: ACM Press
47. Rabin MO (1983) Randomized Byzantine Generals. In: Proc 24th Ann IEEE Symp on Foundations of Computer Science, pp 403-409
48. Ruppert E (1997) Determining consensus numbers. In: Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, pp 93-99
49. Ruppert E (1998) Consensus numbers of multi-objects. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, pp 211-217
50. Ruppert E (1999) Consensus numbers of transactional objects. In: International Symposium on Distributed Computing, pp 312-326
51. Saks M, Shavit N, Woll H (1991) Optimal time randomized consensus - making resilient algorithms fast in practice. In: Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp 351-362, San Francisco, California, 28-30 January
52. Shavit N, Touitou D (1995) Software transactional memory. In: Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, pp 204-213
53. Zamsky A (1996) A randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time. In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, pp 201-208, Philadelphia, Pennsylvania, USA, 23-26 May