Asynchronous Computability Theorems for t-Resilient Systems

A task is a distributed coordination problem where processes start with private inputs, communicate with one another, and then halt with private outputs. A protocol that solves a task is t-resilient if it tolerates halting failures by t or fewer processes. The t-resilient asynchronous computability theorem stated here characterizes the tasks that have t-resilient protocols in a shared-memory model. This result generalizes the prior (wait-free) asynchronous computability theorem of Herlihy and Shavit to a broader class of failure models, and requires introducing several novel concepts.

[1]  Petr Kuznetsov,et al.  Brief announcement: on L-resilience, hitting sets, and colorless tasks , 2010, PODC '10.

[2]  Eli Gafni,et al.  Immediate atomic snapshots and fast renaming , 1993, PODC '93.

[3]  Elizabeth Borowsky,et al.  Capturing the power of resiliency and set consensus in distributed systems , 1996 .

[4]  Eli Gafni,et al.  A simple algorithmically reasoned characterization of wait-free computation (extended abstract) , 1997, PODC '97.

[5]  Dmitry N. Kozlov,et al.  Chromatic subdivision of a simplicial complex , 2012 .

[6]  Dmitry N. Kozlov,et al.  Combinatorial topology of the standard chromatic subdivision and Weak Symmetry Breaking for 6 processes , 2015, ArXiv.

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

[8]  Dmitry N. Kozlov,et al.  Combinatorial Algebraic Topology , 2007, Algorithms and computation in mathematics.

[9]  L. Glaser.  Geometrical combinatorial topology , 1970 .

[10]  R. Ho.  Algebraic Topology , 2022 .

[11]  Petr Kuznetsov,et al.  Turning Adversaries into Friends: Simplified, Made Constructive, and Extended , 2010, OPODIS.

[12]  Maurice Herlihy,et al.  Distributed Computing Through Combinatorial Topology , 2013 .

[13]  Nancy A. Lynch,et al.  The BG distributed simulation algorithm , 2001, Distributed Computing.

[14]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .

[15]  Rachid Guerraoui,et al.  The Disagreement Power of an Adversary , 2009, DISC.

[16]  Petr Kuznetsov,et al.  A generalized asynchronous computability theorem , 2013, PODC.

[17]  Maurice Herlihy,et al.  The asynchronous computability theorem for t-resilient tasks , 1993, STOC.

[18]  Michel Raynal,et al.  Brief announcement: increasing the power of the iterated immediate snapshot model with failure detectors , 2012, PODC '12.

[19]  Ronald Brown.  Groupoids and crossed objects in algebraic topology , 1999 .

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

[21]  Maurice Herlihy,et al.  The topology of distributed adversaries , 2013, Distributed Computing.