Failure Detectors to Solve Asynchronous k-Set Agreement: a Glimpse of Recent Results

In the k-set agreement problem, each process proposes a value and has to decide a value in such a way that a decided value is a proposed value and at most k different values are decided. This problem can easily be solved in synchronous systems or in asynchronous systems prone to t process crashes when t < k. In contrast, it has been shown that k-set agreement cannot be solved in asynchronous systems when k < t. Hence, since several years, the failure detector-based approach has been investigated to circumvent this impossibility. This approach consists in enriching the underlying asynchronous system with an additional module per process that provides it with information on failures. Hence, without becoming synchronous, the enriched system is no longer fully asynchronous. This paper surveys this approach in both asynchronous shared memory systems and asynchronous message passing systems. It presents and discusses recent results and associated k-set agreement algorithms.

[1]  Corentin Travers,et al.  (anti-Ω x × Σ z )-based k-set agreement algorithms , 2010, OPODIS 2010.

[2]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1992, PODC '92.

[3]  Vassos Hadzilacos,et al.  Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract) , 1994, WDAG.

[4]  Rachid Guerraoui,et al.  The Alpha of Indulgent Consensus , 2007, Comput. J..

[5]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[6]  Soma Chaudhuri,et al.  More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems , 1993, Inf. Comput..

[7]  Michel Raynal,et al.  Synchronous Set Agreement: a Concise Guided Tour (including a new algorithm and a list of open problems) , 2006, 2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06).

[8]  Rachid Guerraoui,et al.  The Weakest Failure Detector for Message Passing Set-Agreement , 2008, DISC.

[9]  Piotr Zielinski.  Anti-Ω: the weakest failure detector for set agreement , 2008, PODC '08.

[10]  ChaudhuriSoma,et al.  Tight bounds for k-set agreement , 2000 .

[11]  Rachid Guerraoui,et al.  Tight failure detection bounds on atomic object implementations , 2010, JACM.

[12]  M. Raynal,et al.  Looking for the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems: Is Πk the End of the Road? , 1929 .

[13]  Eli Gafni,et al.  Generalized FLP impossibility result for t-resilient asynchronous computations , 1993, STOC.

[14]  Michel Raynal,et al.  In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement , 2006, OPODIS.

[15]  Achour Mostéfaoui,et al.  Randomized k-set agreement , 2001, SPAA '01.

[16]  Michel Raynal,et al.  k-Arbiter: A Safe and General Scheme for h-out of-k Mutual Exclusion , 1998, Theor. Comput. Sci..

[17]  Gil Neiger,et al.  Failure Detectors and the Wait-Free Hierarchy. , 1995, ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing.

[18]  Achour Mostéfaoui,et al.  On the computability power and the robustness of set agreement-oriented failure detector classes , 2008, Distributed Computing.

[19]  Michel Raynal,et al.  Communication and Agreement Abstractions for Fault-Tolerant Asynchronous Distributed Systems , 2010, Synthesis Lectures on Distributed Computing Theory.

[20]  Rachid Guerraoui,et al.  Sharing is harder than agreeing , 2008, PODC '08.

[21]  Michel Raynal,et al.  A simple proof of the necessity of the failure detector Sigma to implement an atomic register in asynchronous message-passing systems , 2010, Inf. Process. Lett..

[22]  Nancy A. Lynch,et al.  Tight bounds for k-set agreement , 2000, J. ACM.

[23]  Maurice Herlihy,et al.  Tight bounds for k-set agreement with limited-scope failure detectors , 2003, PODC '03.

[24]  Michel Raynal,et al.  A Timing Assumption and Two t-Resilient Protocols for Implementing an Eventual Leader Service in Asynchronous Shared Memory Systems , 2007, 10th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'07).

[25]  Michel Raynal,et al.  The k-simultaneous consensus problem , 2010, Distributed Computing.

[26]  Hagit Attiya,et al.  Sharing memory robustly in message-passing systems , 1990, PODC '90.

[27]  Michel Raynal,et al.  Looking for the Weakest Failure Detector for k-Set Agreement in Message-Passing Systems: Is ${\it \Pi}_k${\it \Pi}_k the End of the Road? , 2009, SSS.

[28]  Antonio Fernández,et al.  Brief announcement: weakest failure detectors via an egg-laying simulation , 2009, PODC '09.

[29]  Achour Mostéfaoui,et al.  k-set agreement with limited accuracy failure detectors , 2000, PODC '00.

[30]  Peter Robinson,et al.  Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement , 2009, OPODIS.

[31]  Michael E. Saks,et al.  Wait-free k-set agreement is impossible: the topology of public knowledge , 1993, STOC.

[32]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[33]  Nancy A. Lynch,et al.  On the weakest failure detector ever , 2007, PODC '07.

[34]  Rachid Guerraoui,et al.  The weakest failure detectors to solve certain fundamental problems in distributed computing , 2004, PODC '04.

[35]  Marcin Paprzycki,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..

[36]  Michel Rennes.  Failure Detectors for Asynchronous Distributed Systems: An Introduction , 2008, Wiley Encyclopedia of Computer Science and Engineering.

[37]  Petr Kuznetsov,et al.  The weakest failure detector for solving k-set agreement , 2009, PODC '09.

[38]  Maurice Herlihy,et al.  The topological structure of asynchronous computability , 1999, JACM.

[39]  Leslie Lamport,et al.  On interprocess communication , 1986, Distributed Computing.

[40]  Rachid Guerraoui,et al.  The disagreement power of an adversary , 2011, Distributed Computing.