The weakest failure detector for solving k-set agreement

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2009, Pages 83-91

  Gafni, Eli ^a   Kuznetsov, Petr ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

BG simulation; Failure detectors; K set agreement; Synchrony assumptions

Indexed keywords

BG-SIMULATION; DISTRIBUTED COMPUTING; DISTRIBUTED SYSTEMS; FAILURE DETECTORS; K-SET AGREEMENT; SET-AGREEMENT; SHARED MEMORIES; SIMULATION TECHNIQUE; SYNCHRONOUS SYSTEM; SYNCHRONY ASSUMPTIONS;

COMPUTER SCIENCE; DISTRIBUTED COMPUTER SYSTEMS;

DETECTORS;

EID: 70350635599     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1582716.1582735     Document Type: Conference Paper

References (24)

1. Yehuda Afek, Eli Gafni, Sergio Rajsbaum, Michel Raynal, and Corentin Travers. Simultaneous consensus tasks: A tighter characterization of set-consensus. In ICDCN, pages 331-341, 2006.
2. Antonio Fernández Anta, Sergio Rajsbaum, and Corentin Travers. Weakest failure detectors via an egg-laying simulation (brief announcement). In PODC, 2009.
3. Elizabeth Borowsky and Eli Gafni. Generalized FLP impossibility result for t-resilient asynchronous computations. In STOC, pages 91-100, 1993.
4. Elizabeth Borowsky and Eli Gafni. Immediate atomic snapshots and fast renaming. In PODC, pages 41-51, New York, NY, USA, 1993. ACM Press.
5. Elizabeth Borowsky, Eli Gafni, Nancy A. Lynch, and Sergio Rajsbaum. The BG distributed simulation algorithm. Distributed Computing, 14(3):127-146, 2001.
6. Tushar Deepak Chandra, Vassos Hadzilacos, and Sam Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43(4):685-722, July 1996.
7. Tushar Deepak Chandra and Sam Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, March 1996.
8. Soma Chaudhuri. Agreement is harder than consensus: Set consensus problems in totally asynchronous systems. In PODC, pages 311-324, 1990.
9. Wei Chen, Jialin Zhang, Yu Chen, and Xuezheng Liu. Weakening failure detectors for k-set agreement via the partition approach. In DISC, pages 123-138, 2007.
10. F. Chu. Reducing Ω to ◇W. Information Processing Letters, 67(6):298-293, September 1998.
11. Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, and Andreas Tielmann. The disagreement power of an adversary (brief announcement). In PODC, 2009.
12. Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, April 1985.
13. Rachid Guerraoui, Maurice Herlihy, Petr Kouznetsov, Nancy A. Lynch, and Calvin C. Newport. On the weakest failure detector ever. In PODC, pages 235-243, August 2007.
14. Rachid Guerraoui, Maurice Herlihy, Petr Kuznetsov, Nancy A. Lynch, and Calvin C. Newport. On the weakest failure detector ever. Distributed Computing, 21(5):353-366, February 2009.
15. Rachid Guerraoui and Petr Kuznetsov. Failure detectors as type boosters. Distributed Computing, 20(5):343-358, 2008.
16. Maurice Herlihy and Nir Shavit. The asynchronous computability theorem for t-resilient tasks. In STOC, pages 111-120, May 1993.
17. Prasad Jayanti and Sam Toueg. Every problem has a weakest failure detector. In PODC, pages 75-84, 2008.
18. Petr Kuznetsov. Simple CHT: A new derivation of the weakest failure detector for consensus. Technical Report 2009-05, TU Berlin, February 2009. http://www.net.t-labs.tuberlin.de/~petr/pubs/chts.pdf.
19. Wai-Kau Lo and Vassos Hadzilacos. Using failure detectors to solve consensus in asynchronous shared memory systems. In WDAG, pages 280-295, 1994.
20. M.C. Loui and H.H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4:163-183, 1987.
21. Michel Raynal. K-anti-Omega, August 2007. Rump session at PODC 2007.
22. Michel Raynal and Corentin Travers. In search of the holy grail: Looking for the weakest failure detector for wait-free set agreement. In OPODIS, pages 3-19, 2006.
23. Michael Saks and Fotios Zaharoglou. Wait-free k-set agreement is impossible: The topology of public knowledge. In Proceedings of the 25th ACM Symposium on Theory of Computing, pages 101-110. ACM Press, May 1993.
24. Piotr Zieliński. Anti-omega: the weakest failure detector for set agreement. In PODC, August 2008.