Fast indulgent consensus with zero degradation

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

Volumn 2485, Issue , 2002, Pages 191-208

  Dutta, Partha ^a   Guerraoui, Rachid ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONSENSUS ALGORITHMS; FAILURE DETECTION; IMPACT PERFORMANCE; LOWER BOUNDS; MESSAGE PASSING SYSTEMS; PROCESS CRASH; UNRELIABLE FAILURE DETECTOR;

MESSAGE PASSING;

EID: 84937565083     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36080-8_18     Document Type: Conference Paper

References (14)

1. M.K. Aguilera, W. Chen, and S. Toueg. Failure detection and consensus in the crash-recovery model. Distributed Computing, 13(2):99-125, May 2000. 192
2. F. Brasileiro, F. Greve, A. Mostefaoui, and M. Raynal. Consensus in one communication step. In Proceedings of the 6th International Conference on Parallel Computing Technology, pages 42-50, Novosibirsk, Russia, September 2001. 198
3. T.D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43(4):685-722, 1996. 192, 193
4. T.D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, 1996. 191, 192, 193, 200, 202, 204
5. D. Dolev, C. Dwork, and L. Stockmeyer. On the minimal synchrony needed for distributed consensus. Journal of ACM, 34(1):77-97, 1987. 192
6. M. J. Fischer, N.A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, 1985. 192, 201
7. R. Guerraoui. Indulgent algorithms. In Proceedings of the 19th ACM Symposium on the Principles of Distributed Computing (PODC-19), pages 289-298, Portland, OR, July 2000. 192, 193
8. M. Hurfin and M. Raynal. A simple and fast asynchronous consensus protocol based on a weak failure detector. Distributed Computing, 12(4):209-223, 1999. 193, 194, 200, 202, 203
9. V. Hadzilacos and S. Toueg. Fault-tolerant broadcasts and related problems. In S. Mullender, editor, Distributed Systems, ACM Press Books, chapter 5, pages 97-146. Addison-Wesley, second edition, 1993. 192
10. I. Keidar and S. Rajsbaum. On the cost of fault-tolerant consensus when there are no faults - a tutorial. Technical Report MIT-LCS-TR-821, MIT, May 2001. 192, 193, 198, 203
11. L. Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-565, July 1978. 200
12. L. Lamport. The part-time parliament. Technical Report 49, System Research Center, Digital Equipment Corp, Palo Alto, September 1989. A revised version of the paper also appeared in ACM Transaction on Computer Systems, 16(2):133-169, May 1998. 191, 192, 202, 203
13. A. Mostefaoui and M. Raynal. Leader-based consensus. Parallel Processing Letters, 11(1):95-107, March 2001. 194, 202, 203
14. A. Schiper. Early consensus in an asynchronous system with a weak failure detector. Distributed Computing, 10(3):149-157, 1997. 193, 194, 200, 202, 203