Gossiping to reach consensus

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2002, Pages 220-229

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

^a UNIVERSITY OF COLORADO   (United States)

^b UNIVERSITY OF WARSAW   (Poland)

^c UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

Adaptive adversary; Consensus; Distributed algorithm; Gossiping; Lower bound; Processor failures

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; RESPONSE TIME (COMPUTER SYSTEMS);

DISTRIBUTED ALGORITHM; GOSSIPING ALGORITHMS; POLYLOGARITHMIC FACTOR;

ALGORITHMS;

EID: 0036957216     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/564905.564908     Document Type: Conference Paper

References (37)

1. M. Ajtai, J. Aspnes, C. Dwork, and O. Waarts, A theory of competitive analysis of distributed algorithms, in Proc. 33rd IEEE Symp. on Foundations of Computer Science, 1994, pp. 401-411.
2. S. Amdur, S. Weber, and V. Hadzilacos, On the message complexity of binary agreement under crash failures, Distributed Computing, 5 (1992) 175-186.
3. R.J. Anderson, and H. Woll, Algorithms for the certified write-all problem, SIAM J. Computing, 26 (1997) 1277-1283.
4. J. Aspnes, Lower bounds for distributed coin-flipping and randomized consensus, J. ACM, 45 (1998) 415-450.
5. J. Aspnes, Time- and space-efficient randomized consensus, J. Algorithms, 14 (1993) 414-431.
6. J. Aspnes and W. Hurwood, Spreading rumors rapidly despite an adversary, J. Algorithms, 26 (1998) 386-411.
7. N.T.J. Bailey, "The Mathematical Theory of Infectious Diseases and its Applications", Charles Griffin, London, 1975.
8. Z. Bar-Joseph, and M. Ben-Or, A tight lower bound for randomized synchronous consensus, in Proc., 17th ACM Symp. on Principles of Distributed Computing, 1998, pp. 193-199.
9. M. Ben-Or, Another advantage of free choice: Completely asynchronous agreement protocols, in Proc., 2nd ACM Symp. on Principles of Distributed Computing, 1983, pp. 27-30.
10. G. Bracha, unpublished manuscript, Cornell University, 1984.
11. T.D. Chandra, and S. Toueg, Time and message efficient reliable broadcast, in Proc., 4th Int. Workshop on Distributed Algorithms, 1990, Springer LNCS 486, pp. 289-303.
12. B.S. Chlebus, L. Ga̧sieniec, D.R. Kowalski, and A.A. Shvartsman, Bounding work and communication in robust cooperative computation, submitted.
13. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swineheart, and D. Terry, Epidemic algorithms for replicated database maintenance, in Proc., 6th ACM Symp. on Principles of Distributed Computing, 1987, pp. 1-12.
14. K. Diks and A. Pelc, Optimal adaptive broadcasting with a bounded fraction of faulty nodes, Algorithmica, 28 (2000) 37-50.
15. D. Dolev, and R. Reischuk, Bounds on information exchange for Byzantine agreement, J. ACM, 32 (1985) 191-204.
16. C. Dwork, J. Halpern, and O. Waarts, Performing work efficiently in the presence of faults, SIAM J. on Computing, 27 (1998) 1457-1491.
17. C. Dwork, D. Peleg, N. Pippenger, and E. Upfal, Fault tolerance in networks of bounded degree, SIAM J. on Computing, 17 (1988) 975-988.
18. M. Fisher, and N. Lynch, A lower time for the time to assure interactive consistency, Information Processing Letters, 14 (1982) 183-186.
19. M. Fisher, N. Lynch, and M. Paterson, Impossibility of distributed consensus with one faulty process, J. ACM, 32 (1985) 374-382.
20. Z. Galil, A. Mayer, and M. Yung, Resolving message complexity of Byzantine agreement and beyond, in Proc. 36th IEEE Symp. on Foundations of Computer Science, 1995, pp. 724-733.
21. J.A. Garay, and Y. Moses, Fully polynomial Byzantine agreement for n > 3t processors in t + 1 rounds, SIAM J. Computing, 27 (1998) 247-290.
22. O. Goldreich, and E. Petrank, The best of both worlds: guaranteeing termination in fast randomized byzantine agreement protocols, Information Processing Letters, 36 (1990) 45-49.
23. V. Hadzilacos, and J.Y. Halpern, Message-optimal protocols for Byzantine agreement, Mathematical Systems Theory, 26 (1993) 41-102.
24. V. Hadzilacos, and S. Toueg, Fault-tolerant broadcast and related problems, in "Distributed Systems", 2nd ed., S. Mullender (ed.), Eddison-Wesley, 1993, pp. 97-145.
25. M. Harchol-Balter, T. Leighton, and D. Lewin, Resource discovery in distributed networks, in Proc., 18th ACM Symp. on Principles of Distributed Computing, 1999, pp. 229-238.
26. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking, Randomized rumor spreading, in Proc., 41st IEEE Symp. on Foundations of Computer Science, 2000, pp. 565-574.
27. D. Kempe, J. Kleinberg, and A. Demers, Spatial gossip and resource location protocols, in Proc., 33rd ACM Symp. on Theory of Computing, 2001, pp. 163-172.
28. L. Lamport, and M.J. Fischer, Byzantine generals and transaction commit protocols, manuscript, 1982.
29. L. Lamport, R. Shostak, and M. Pease, The Byzantine generals problem, ACM Transactions on Programming Languages and Systems, 4 (1982) 382-401.
30. A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica, 8 (1988) 261-277.
31. G.A. Margulis, Explicit group-theoretical constructions of combinatorial schemes and their applications to the design of expanders and concentrators, Problems of Information Transmission, 24 (1988) 39-46.
32. M. Pease, R. Shostak, and L. Lamport, Reaching agreement in the presence of faults, J. ACM, 27 (1980) 228-234.
33. A. Pelc, Fault-tolerant broadcasting and gossiping in communication networks, Networks, 28 (1996) 43-156.
34. M.O. Rabin, Randomized byzantine generals, in Proc., 24th IEEE Symp. on Foundations of Computer Science, 1983, pp. 403-409.
35. M. Saks, N. Shavit, and H. Woll, Optimal time randomized consensus - making resilient algorithms fast in practice, in Proc. 2nd SIAM-ACM Symp. on Discrete Algorithms, 1991, pp. 351-362.
36. E. Upfal, Tolerating a linear number of faults in networks of bounded degree, Information and Computation, 115 (1994) 312-320.
37. R. van Renesse, Y. Minsky, and M. Hayden, A gossip-style failure detection service, in Proc., IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing, 1998, pp. 55-70.