Anti-Ω: The weakest failure detector for set agreement

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2008, Pages 55-64

  Zieliński, Piotr ^a  

^a GOOGLE INC   (United States)

Author keywords

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

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS;

FAILURE DETECTORS; SET AGREEMENT; SHARED-MEMORY SYSTEMS; SINGLE PROCESS; WAIT-FREE IMPOSSIBILITIES; WEAKEST FAILURE DETECTOR EVER;

DETECTORS;

EID: 57549104722     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Y. Afek, E. Gafni, S. Rajsbaum, M. Raynal, and C. Travers. Simultaneous consensus tasks: A tighter characterization of set-consensus. In ICDCN 2006, LNCS 4308, pages 331-341. Springer, 2006.
2. Y. Afek, G. Stupp, and D. Touitou. Long-lived and adaptive atomic snapshot and immediate snapshot. In PODC 2000, pages 71-80, New York, July 2000. ACM Press.
3. H. Attiya. A direct lower bound for k-set consensus. In PODC 1998, page 314, Puerto Vallarta, Mexico, 1998.
4. E. Borowsky and E. Gafni. Generalized FLP impossibility result for t-resilient asynchronous computations. In Proc. of the 25th Annual, ACM Symposium on the Theory of Computing, pages 91-100, San Diego, CA, USA, May 1993. ACM Press.
5. E. Borowsky and E. Gafni. Immediate atomic snapshots and fast renaming. In PODC 1993, pages 41-51, New York, 1993.
6. T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving Consensus. Journal of the ACM, 43(4):685-722, 1996.
7. S. Chaudhuri. More choices allow more faults: Set Consensus problems in totally asynchronous systems. INFCTRL: Information and Computation, 105, 1993.
8. W. Chen, Y. Chen, and J. Zhang. On failure detectors weaker than ever. Technical Report MSR-TR-2007-50, Microsoft Research, May 2007.
9. 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, April 1985.
10. E. Gafni and L. Lamport. Disk Paxos. In DISC 2000, pages 330-344, Toledo, Spain, 2000.
11. E. Gafni, S. Rajsbaum, and M. Herlihy. Subconsensus tasks: Renaming is weaker than set agreement. In DISC 2006, LNCS 4167, pages 329-338. Springer, 2006.
12. R. Guerraoui, M. Herlihy, P. Kouznetsov, N. Lynch, and C. Newport. On the weakest failure detector ever. In PODC 2007, Portland, OR, USA, August 2007.
13. R. Guerraoui. Indulgent algorithms. In PODC 2000, pages 289-298, New York, July 2000. ACM Press.
14. R. Guerraoui and P. Kouznetsov. Finally the weakest failure detector for Non-Blocking Atomic Commit. Technical Report LPD-2003-005, EPFL, Lausanne, Switzerland, December 2003.
15. R. Guerraoui and M. Raynal. The Alpha of indulgent Consensus. Comput. J, 50(1):53-67, 2007.
16. M. Herlihy and N. Shavit. The topological structure of asynchronous computability. JACM: Journal of the ACM, 46, 1999.
17. W. Lo and V. Hadzilacos. Using failure detectors to solve consensus in asynchronous shared-memory systems. In WDAG 1994, LNCS 857, pages 280-295, Terschelling, The Netherlands, 1994. Springer.
18. M. Raynal and C. Travers. In search of the holy grail: Looking for the weakest failure detector for wait-free set agreement. In OPODIS 2006, LNCS 4305, pages 3-19, Bordeaux, France, December 2006. Springer.
19. M. E. Saks and F. Zaharoglou. Wait-free k-set agreement is impossible: The topology of public knowledge. SICOMP: SIAM Journal on Computing, 29, 2000.
20. Piotr Zieliński. Automatic classification of eventual failure detectors. In DISC 2007, Lemesos, Cyprus, September 2007.