On the message complexity of indulgent consensus

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

Volumn 4731 LNCS, Issue , 2007, Pages 283-297

  Gilbert, Seth ^a   Guerraoui, Rachid ^a   Kowalski, Dariusz R ^b  

^a EPFL   (Switzerland)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FAILURE ANALYSIS;

CONSENSUS ALGORITHMS; MESSAGE COMPLEXITY; OPTIMAL MESSAGE;

MESSAGE PASSING;

EID: 38049011966     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75142-7_23     Document Type: Conference Paper

References (24)

1. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM 27(2), 228-234 (1980)
2. Fisher, M., Lynch, N., Paterson, M.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(2), 374-382 (1985)
3. Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. Journal of the ACM 35(2), 288-323 (1988)
4. Chandra, T., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225-267 (1996)
5. Lamport, L.: The part-time parliament. ACM Transactions on Computer Systems 16(2), 133-169 (1998)
6. Mostefaoui, A., Raynal, M.: Solving consensus using chandra-toueg's unreliable failure detectors: A general quorum-based approach. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol. 1693, pp. 49-63. Springer, Heidelberg (1999)
7. Guerraoui, R., Raynal, M.: The information structure of indulgent consensus. IEEE Transactions on Computers 53(4), 453-466 (2004)
8. Schiper, A.: Early consensus in an asynchronous system with a weak failure detector. Distributed Computing 10(3), 149-157 (1997)
9. Guerraoui, R.: Indulgent algorithms (preliminary version). In: Proceedings of the 19th Symposium on Principles of Distributed Computing (PODC), pp. 289-297 (2000)
10. Lynch, N.: Distributed Algorithms. Morgan Kaufman, San Francisco (1996)
11. Dutta, P., Guerraoui, R.: The inherent price of indulgence. In: Proceedings of the 21st Symposium on Principles of Distributed Computing (PODC), pp. 88-97 (2002)
12. Lamport, L.: Fast paxos. Technical Report MSR-TR-2005-12, Microsoft (2005)
13. Chandra, T., Toueg, S.: Time and message efficient reliable broadcasts. In: van Leeuwen, J., Santoro, N. (eds.) Distributed Algorithms. LNCS, vol. 486, pp. 289-303. Springer, Heidelberg (1991)
14. Galil, Z., Mayer, A., Yung, M.: Resolving message complexity of byzantine agreement and beyond. In: Proceedings of the 36th Symposium on Foundations of Computer Science (FOCS), pp. 724-733 (1995)
15. Fisher, M., Lynch, N.: A lower bound for the time to assure interactive consistency. Information Processing Letters (IPL) 14(4), 183-186 (1982)
16. Dolev, D., Strong, H.: Requirements for agreement in a distributed system. Technical Report RJ 3418, IBM Research, San Jose, CA (March 1982)
17. Lamport, L., Fisher, M.: Byzantine generals and transaction commit protocols. Unpublished (April 1982)
18. Dolev, D., Reischuk, R., Strong, H.R.: Early stopping in byzantine agreement. Journal of the ACM 37(4), 720-741 (1990)
19. Charron-Bost, B., Schiper, A.: Improving Fast Paxos: being optimistic with no overhead. In: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (PRDC), pp. 287-295 (2006)
20. Dwork, C., Halpern, J., Waarts, O.: Performing work efficiently in the presence of faults. SIAM Journal on Computing 27(5), 1457-1491 (1998)
21. Chlebus, B., Kowalski, D.: Gossiping to reach consensus. In: Proceedings of 14th Symposium on Parallel Algorithms and Architectures (SPAA), pp. 220-229 (2002)
22. Chlebus, B., Kowalski, D.: Robust gossiping with an application to consensus. Journal of Computer and System Science 72(8), 1262-1281 (2006)
23. Amdur, S., Weber, S., Hadzilacos, V.: On the message complexity of binary agreement under crash failures. Distributed Computing 5(4), 175-186 (1992)
24. Hadzilacos, V., Halpern, J.: Message-optimal protocols for byzantine agreement. Mathematical Systems Theory 26(1), 41-102 (1993)