Locally scalable randomized consensus for synchronous crash failures

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2009, Pages 290-299

  Chlebus, Bogdan S ^a   Kowalski, Dariusz R ^b  

^a The University of Colorado Denver   (United States)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Bit communication complexity; Consensus; Fault tolerance; Graph expansion; Lower bound; Message passing; Randomization; Scalability; Synchrony

Indexed keywords

COMMUNICATION COMPLEXITY; CONSENSUS; LOWER BOUND; LOWER BOUNDS; RANDOMIZATION;

COMMUNICATION; CONTROL THEORY; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; OVERLAY NETWORKS; PARALLEL ALGORITHMS; QUALITY ASSURANCE; SCALABILITY;

MESSAGE PASSING;

EID: 70449652346     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1583991.1584063     Document Type: Conference Paper

References (35)

1. K. Abrahamson, On achieving consensus using shared memory, in Proceedings of the 17th ACM Symposium on Principles of Distributed Computing (PODC), 1988, pp. 291-302.
2. N. Alon, and F.R.K. Chung, Explicit construction of linear sized tolerant networks, Discrete Mathematics, 72 (1988) 15-19.
3. S. Amdur, S. Weber, and V. Hadzilacos, On the message complexity of binary agreement under crash failures, Distributed Computing, 5 (1992) 175-186.
4. J. Aspnes, Lower bounds for distributed coin-flipping and randomized consensus, Journal of the ACM, 45 (1998) 415-450.
5. J. Aspnes, Randomized protocols for asynchronous consensus, Distributed Computing, 16 (2003) 165-175.
6. J. Aspnes, H. Attiya, and K. Censor, Randomized consensus in expected script O(n log n) individual work, in Proceedings of the 27th ACM Symposium on Principles of Distributed Computing (PODC), 2008, pp. 325-334.
7. J. Aspnes, and M. Herlihy, Fast randomized consensus using shared memory, Journal of Algorithms, 11 (1990) 441-461.
8. 2 n) operation per processor, SIAM Journal on Computing, 25 (1996) 1024-1044.
9. H. Attiya, and K. Censor, Tight bounds for asynchronous randomized consensus, Journal of the ACM, 55 (2008).
10. H. Attiya, and J. Welch, Distributed Computing, 2nd Edition, Wiley, 2004.
11. Y. Aumann, Efficient asynchronous consensus with the weak adversary scheduler, in Proceedings of the 16th ACM Symposium on Principles of Distributed Computing (PODC), 1997, pp. 209-218.
12. Y. Aumann, and M.A. Bender, Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler, Distributed Computing, 17 (2005) 191-207.
13. Z. Bar-Joseph, and M. Ben-Or, A tight lower bound for randomized synchronous consensus, in Proceedings of the 17th ACM Symposium on Principles of Distributed Computing (PODC), 1998, pp. 193-199.
14. M. Ben-Or, Another advantage of free choice: Completely asynchronous agreement protocols, in Proceedings of the 12th ACM Symposium on Principles of Distributed Computing (PODC), 1983, pp. 27-30.
15. G. Bracha, and O. Rachman, Randomized consensus in expected script O(n log n) operations, in Proceedings of of the 5th International Workshop on Distributed Algorithms (WDAG), 1991, Springer LNCS 579, pp. 143-150.
16. G. Bracha, and S. Toueg, Asynchronous consensus and broadcast protocols, Journal of the ACM, 32 (1985) 824-840.
17. T.D. Chandra, Polylog randomized wait-free consensus, in Proceedings of the 15th ACM Symposium on Principles of Distributed Computing (PODC), 1996, pp. 166-175.
18. B.S. Chlebus, and D.R. Kowalski, Robust gossiping with an application to consensus, Journal of Computer and System Sciences, 72 (2006) 1262-1281.
19. B.S. Chlebus, and D.R. Kowalski, Time and communication efficient consensus for crash failures, in Proceedings of the 21st International Symposium on Distributed Computing (DISC), 2006, Springer LNCS 4167, pp. 314-328.
20. B.S. Chlebus, D.R. Kowalski, and M. Strojnowski, Fast scalable deterministic consensus for crash failures, in Proceedings of the 28th ACM Symposium on Principles of Distributed Computing (PODC), 2009.
21. B. Chor, M. Merritt, and D.B. Shmoys, Simple constant-time protocols in realistic failure models, Journal of the ACM, 36 (1989) 591-614.
22. D. Dolev, and R. Reischuk, Bounds on information exchange for Byzantine agreement, Journal of the ACM, 32 (1985) 191-204.
23. P. Feldman, and S. Micali, An optimal probabilistic protocol for synchronous Byzantine agreement, SIAM Journal on Computing, 26 (1997) 873-933.
24. M. Fisher, and N. Lynch, A lower bound for the time to assure interactive consistency, Information Processing Letters, 14 (1982) 183-186.
25. M. Fisher, N. Lynch, and M. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM, 32 (1985) 374-382.
26. C. Georgiou, S. Gilbert, R. Guerraoui, and D.R. Kowalski, On the complexity of asynchronous gossip, in Proceedings of the 27th ACM Symposium on Principles of Distributed Computing (PODC), 2008, pp. 135-144.
27. S. Gilbert, R. Guerraoui, and D.R. Kowalski, On the message complexity of indulgent consensus, in Proceedings of the 21st International Symposium on Distributed Computing (DISC), 2007, pp. 283-297.
28. V. Hadzilacos, and J.Y. Halpern, Message-optimal protocols for Byzantine agreement, Mathematical Systems Theory, 26 (1993) 41-102.
29. D. Holtby, B.M. Kapron, and V. King, Lower bound for scalable Byzantine Agreement, Distributed Computing, 21 (2008) 239-248.
30. V. King, J. Saia, V. Sanwalani, and E. Vee, Towards secure and scalable computation in peer-to-peer networks, in Proceedings of the 47th IEEE Symposium on Foundations of Computer Science (FOCS), 2006, pp. 87-98.
31. M. Loui, and H. Abu-Amara, Memory requirements for agreement among unreliable asynchronous processes, Advances in Computing Research, 4 (1987) 163-183.
32. A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica, 8 (1988) 261-277.
33. Y. Moses, and S. Rajsbaum, A layered analysis of consensus, SIAM Journal on Computing, 31 (2002) 989-1021.
34. M.O. Rabin, Randomized Byzantine generals, in Proceedings of the 24th IEEE Symposium on Foundations of Computer Science (FOCS), 1983, pp. 403-409.
35. E. Upfal, Tolerating a linear number of faults in networks of bounded degree, Information and Computation, 115 (1994) 312-320.