The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems

This paper defines the basic notions of local and non-local tasks, and determines the minimum information about failures that is necessary to solve any non-local task in message-passing systems. It also introduces a natural weakening of the well-known set agreement task, and show that, in some precise sense, it is the weakest non-local task in message-passing systems.

[1]  Vassos Hadzilacos,et al.  On the Relationship Between the Atomic Commitment and Consensus Problems , 1990, Fault-Tolerant Distributed Computing.

[2]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1985, JACM.

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

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

[5]  Soma Chaudhuri,et al.  Agreement is harder than consensus: set consensus problems in totally asynchronous systems , 1990, PODC '90.

[6]  Sam Toueg,et al.  Every problem has a weakest failure detector , 2008, PODC '08.

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

[8]  Piotr Zielinski.  Automatic Classification of Eventual Failure Detectors , 2007, DISC.

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

[10]  Shmuel Zaks,et al.  A Combinatorial Characterization of the Distributed 1-Solvable Tasks , 1990, J. Algorithms.

[11]  Marcos K. Aguilera,et al.  Revising the Weakest Failure Detector for Uniform Reliable Broadcast , 1999, DISC.

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

[13]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1996, JACM.

[14]  Joseph Y. Halpern,et al.  A knowledge-theoretic analysis of uniform distributed coordination and failure detectors , 2004, Distributed Computing.

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

[16]  Piotr Zielinski,et al.  Anti-Ω: the weakest failure detector for set agreement , 2010, PODC '08.

[17]  Rachid Guerraoui,et al.  Mutual exclusion in asynchronous systems with failure detectors , 2005, J. Parallel Distributed Comput..

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

[19]  Carole Delporte-Gallet,et al.  Brief Announcement: The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems , 2009, DISC.

[20]  Carole Delporte-Gallet,et al.  The Minimum Failure Detector For Non-Local Tasks In Message-Passing Systems , 2009 .

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

[22]  Rachid Guerraoui,et al.  The weakest failure detectors to boost obstruction-freedom , 2006, Distributed Computing.

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

[24]  Michael J. Fischer,et al.  The Consensus Problem in Unreliable Distributed Systems (A Brief Survey) , 1983, FCT.