Time and communication efficient consensus for crash failures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4167 LNCS, Issue , 2006, Pages 314-328

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

^a UNIVERSITY OF COLORADO   (United States)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

COMMUNICATION COMPLEXITIES; MESSAGE COMPLEXITY SCRIPT; POINT-TO-POINT MESSAGES;

COMPUTER SCIENCE;

EID: 33845210348     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11864219_22     Document Type: Conference Paper

References (26)

1. S. Amdur, S. Weber, and V. Hadzilacos, On the message complexity of binary agreement under crash failures, Distributed Computing, 5 (1992) 175 - 186.
2. A. Bagchi, and S.L. Hakimi, Information dissemination in distributed systems with faulty units, IEEE Transactions on Computing, 43 (1994) 698 - 710.
3. N.T.J. Bailey, "The Mathematical Theory of Infectious Diseases and its Applications, "Charles Griffin, London, 1975.
4. B.S. Chlebus, and D.R. Kowalski, Gossiping to reach consensus, in Proceedings, 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 2002, pp. 220 - 229.
5. B.S. Chlebus, D.R. Kowalski, and A.A. Shvartsman, Collective asynchronous reading with polylogarithmic worst-case overhead, in Proceedings, 36th ACM Symposium on Theory of Computing (STOC), 2004, pp. 321 - 330.
6. 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 Proceedings, 6th ACM Symposium on Principles of Distributed Computing (PODC), 1987, pp. 1 - 12.
7. R. De Prisco, A. Mayer, and M. Yung, Time-optimal message-efficient work performance in the presence of faults, in Proceedings, 13th ACM Symposium on Principles of Distributed Computing (PODC), 1994, pp. 161 - 172.
8. D. Dolev, and R. Reischuk, Bounds on information exchange for Byzantine agreement, Journal of the ACM, 32 (1985) 191 - 204.
9. C. Dwork, J. Halpern, and O. Waarts, Performing work efficiently in the presence of faults, SIAM Journal on Computing, 27 (1998) 1457-1491.
10. M. Fisher, and N. Lynch, A lower bound for the time to assure interactive consistency, Information Processing Letters, 14 (1982) 183 - 186.
11. M. Fisher, N. Lynch, and M. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM, 32 (1985) 374 - 382.
12. Z. Galil, A. Mayer, and M. Yung, Resolving message complexity of Byzantine agreement and beyond, in Proceedings, 36th IEEE Symposium on Foundations of Computer Science (FOCS), 1995, pp. 724 - 733.
13. J.A. Garay, and Y. Moses, Fully polynomial Byzantine agreement for n >3t processors in t + 1 rounds, SIAM Journal on Computing, 27 (1998) 247 - 290.
14. G. Georgiou, D.R., Kowalski, and A.A. Shvartsman, Efficient gossip and robust distributed computation, Theoretical Computer Science, 347 (2005) 130 - 166.
15. V. Hadzilacos, and J.Y. Halpern, Message-optimal protocols for Byzantine agreement, Mathematical Systems Theory, 26 (1993) 41 - 102.
16. 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.
17. J. Hromkovic, R. Klasing, A. Pelc, P. Ruzicka, and W. Unger, "Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance," Springer-Verlag, 2005.
18. R. Karp, G. Schindelhauer, S. Shenker, and B. Vöcking, Randomized rumor spreading, in Proceedings, 41st IEEE Symposium on Foundations of Computer Science (FOCS), 2000, pp. 565 - 574.
19. D. Kempe, and J. Kleinberg, Protocols and impossibility results for gossip-based communication mechanisms, in Proceedings, 43rd IEEE Symposium on Foundations of Computer Science (FOCS), 2002, pp. 471 - 480.
20. D. Kempe, J. Kleinberg, and A. Demers, Spatial gossip and resource location protocols, Journal of the ACM, 51 (2004) 943 - 967.
21. D.R. Kowalski, P. Musial, and A.A. Shvartsman, Explicit combinatorial structures for cooperative distributed algorithms, in Proceedings, 25th International Conference on Distributed Computing Systems (ICDCS), 2005, pp. 48 - 58.
22. M. Pease, R. Shostak, and L. Lamport, Reaching agreement in the presence of faults, Journal of the ACM, 27 (1980) 228 - 234.
23. N. Pippenger, Sorting and selecting in rounds, SIAM Journal on Computing, 16 (1987) 1032-1038.
24. O. Reingold, S.P. Vadhan, and A. Wigderson, Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors, Annals of Mathematics, 155 (2002) 157 - 187.
25. R. van Renesse, Y. Minsky, and M. Hayden, A gossip-style failure detection service, in Proceedings, IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing, 1998, pp. 55 - 70.
26. A. Ta-Shma, C. Umans, and D. Zucker man, Loss-less condensers, unbalanced expanders, and extractors, in Proceedings, 33rd ACM Symposium on Theory of Computing (STOC), 2001, pp. 143 - 152.