The inherent price of indulgence

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2002, Pages 88-97

  Dutta, Partha ^a   Guerraoui, Rachid ^a  

^a EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; FAULT TOLERANT COMPUTER SYSTEMS; GLOBAL OPTIMIZATION; REQUIREMENTS ENGINEERING; THEOREM PROVING; TIME SHARING SYSTEMS;

GLOBAL DECISION; INDULGENT CONSENSUS ALGORITHMS; ROUND BY ROUND FAULT DETECTORS; TIME COMPLEXITY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0036949395     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/571825.571838     Document Type: Conference Paper

References (10)

1. M. K. Aguilera and S. Toueg. A simple bivalency proof that t-resilient consensus requires t - 1 rounds. Information Processing Letters, 71 (3-4):155-158, 1999.
2. T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, 1996.
3. B. Charron-Bost, R. Guerraoui, and A. Schiper. Synchronous system and perfect failure detector: solvability and efficiency issues. In Proceedings of the IEEE International Conference on Dependable Systems and Networks (DSN), pages 523-532, New York, June 2000.
4. C. Dwork, N. A. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288-323, April 1988.
5. M. J. Fisher, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32 (2):374-382, April 1985.
6. E. Gafni. Round-by-round fault detectors: Unifying synchrony and asynchrony. In Proceedings of the 17th ACM Symposium on Principles of Distributed Computing (PODC-17), pages 143-152, Puerto Vallarta, Mexico, 1998.
7. R. Guerraoui. Indulgent algorithms. In Proceedings of the 19th ACM Symposium on Principles of Distributed Computing (PODC-19), pages 289-298, Portland, OR, July 2000.
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.
9. 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.
10. N. A. Lynch. Distributed Algorithms, Morgan Kaufmann, 1996.