Every problem has a weakest failure detector

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2008, Pages 75-84

  Jayanti, Prasad ^a   Toueg, Sam ^b  

^a DARTMOUTH COLLEGE   (United States)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Asynchronous system; Failure detector; Fault tolerance

Indexed keywords

FAULT TOLERANCE;

ASYNCHRONOUS SYSTEM; FAILURE DETECTORS; FAULT-TOLERANT DISTRIBUTED COMPUTING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 57549106841     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1400751.1400763     Document Type: Conference Paper

References (13)

1. Marcos K. Aguilera, Sam Toueg, and Boris Deianov. Revisiting the weakest failure detector for uniform reliable broadcast. In DISC'99: Proceedings of the thirteenth International Symposium on Distributed Computing, pages 13-33, LNCS vol. 1693. Springer-Verlag, September 1999.
2. Alfred V. Alio, John E. Hopcroft, and Jeffrey D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, 1974.
3. Michael Ben-Or. Another advantage of free choice (extended abstract): Completely asynchronous agreement protocols. In PODC'83: Proceedings of the second annual ACM symposium on Principles of distributed computing, pages 27-30. ACM Press, August 1983.
4. Tushar D. Chandra, Vassos Hadzilacos, and Sam Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43(4):685-722, July 1996.
5. Tushar D. Chandra and Sam Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, March 1996.
6. Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Vassos Hadzilacos, Petr Kouznetsov, and Sam Toueg. The weakest failure detectors to solve certain fundamental problems in distributed computing. In PODC'04: Proceedings of the twenty-third annual ACM symposium on Principles of Distributed Computing, pages 338-346. ACM Press, July 2004.
7. Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, and Petr Kouznetsov. Mutual exclusion in asynchronous systems with failure detectors. Journal of Parallel and Distributed Computing, 65(4):492-505, April 2005.
8. Danny Dolev, Cynthia Dwork, and Larry Stockmeyer. On the minimal synchronism needed for distributed consensus. Journal of the ACM, 34(1):77-97, January 1987.
9. Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. Consensus in the presence of partial synchrony. Journal of the ACM, 35(2):288-323, April 1988.
10. Rachid Guerraoui, Michal Kapalka, and Petr Kouznetsov. The weakest failure detectors to boost obstruction-freedom. In DISC'06: Proceedings of the twentieth International Symposium on Distributed Computing, pages 399-412, LNCS vol. 4167. Springer-Verlag, September 2006.
11. Joseph Y. Halpern and Aleta Ricciardi. A knowledge-theoretic analysis of uniform distributed coordination and failure detectors. In PODC'99: Proceedings of the eighteenth annual ACM symposium, on Principles of Distributed Computing, pages 73-82. ACM Press, May 1999.
12. Maurice P. Herlihy and Jeannette M. Wing. Linearizability: a correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems (TOPLAS), 12(3):463-492, July 1990.
13. Piotr Zielinski. Anti-omega: the weakest failure detector for set agreement. Technical Report UCAM-CL-TR-694, Computer Laboratory, University of Cambridge, Cambridge, UK, July 2007.