On the weakest failure detector ever

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2007, Pages 235-243

  Guerraoui, Rachid ^a   Herlihy, Maurice ^b   Kouznetsov, Petr ^c   Lynch, Nancy ^a   Newport, Calvin ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Brown Univerity   (United States)

^c MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

Author keywords

Failure detectors; Set agreement; Wait free impossibilities; Weakest failure detector ever

Indexed keywords

FAILURE DETECTORS; SET AGREEMENT; WAIT FREE IMPOSSIBILITIES; WEAKEST FAILURE DETECTOR EVER;

DISTRIBUTED COMPUTER SYSTEMS; INFORMATION ANALYSIS; PROBLEM SOLVING; RANDOM PROCESSES;

COMPUTER SYSTEM RECOVERY;

EID: 36849049248     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1281100.1281135     Document Type: Conference Paper

References (16)

1. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit. Atomic snapshots of shared memory. J. ACM, 40(4):873-890, 1993.
2. E. Borowsky and E. Gafni. Generalized FLP impossibility result for t-resilient asynchronous computations. In Proceedings of the 25th ACM Symposium on Theory of Computing, pages 91-100, May 1993.
3. T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. J. ACM, 43(4):685-722, July 1996.
4. T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. J. ACM, 43(2):225-267, Mar. 1996.
5. S. Chaudhuri. More choices allow more faults: Set consensus problems in totally asynchronous systems. Information and Computation, 105(1):132-158, 1993.
6. C. Delporte-Gallet, H. Fauconnier, R. Guerraoui, V. Hadzilacos, P. Kouznetsov, and S. Toueg. The weakest failure detectors to solve certain fundamental problems in distributed computing. In PODC, pages 338-346, 2004.
7. C. Delporte-Gallet, H. Fauconnier, R. Guerraoui, and P. Kouznetsov. Mutual exclusion in asynchronous systems with failure detectors. J. Parallel Distrib. Comput., 65(4):492-505, 2005.
8. M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374-382, Apr. 1985.
9. R. Guerraoui and P. Kouznetsov. On failure detectors and type boosters. In Proceedings of the 17th International Symposium on Distributed Computing, pages 292-305. Springer-Verlag, 2003.
10. M. Herlihy and N. Shavit. The asynchronous computability theorem for t-resilient tasks. In Proceedings of the 25th ACM Symposium on Theory of Computing, pages 111-120, May 1993.
11. M. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst., 12(3):463-492, 1990.
12. P. Jayanti. Robust wait-free hierarchies. Journal of the ACM, 44(4):592-614, 1997.
13. G. Neiger. Failure detectors and the wait-free hierarchy. In 14th ACM Symposium on Principles of Distributed Computing, 1995.
14. M. Raynal and C. Travers. In search of the holy grail: Looking for the weakest failure detector for wait-free set agreement. In OPODIS, pages 3-19, 2006.
15. M. Saks and F. Zaharoglou. Wait-free k-set agreement is impossible: The topology of public knowledge. In Proceedings of the Twenty fifth ACM Symposium on Theory of Computing, pages 101-110, May 1993.
16. J. Yang, G. Neiger, and E. Gafni. Structured derivations of consensus algorithms for failure detectors. In Proceedings of the 17th ACM Symposium on Principles of Distributed Computing, pages 297-306, 1998.