The asynchronous computability theorem for t-resilient tasks

We give necessary and sufficient combinatorial conditions characterizing the computational tasks that can be solved by N asynchronous processes, up to t of which can fail by halting. The range of possible input and output values for an asynchronous task can be associated with a high-dimensional geometric structure called a simplicial complex. Our main theorem characterizes computability y in terms of the topological properties of this complex. Most notably, a given task is computable only if it can be associated with a complex that is simply connected with trivial homology groups. In other words, the complex has “no holes!” Applications of this characterization include the first impossibility results for several long-standing open problems in distributed computing, such as the “renaming” problem of Attiya et. al., the “k-set agreement” problem of Chaudhuri, and a generalization of the approximate agreement problem.

[1]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

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

[3]  Sam Toueg,et al.  Some Results on the Impossibility, Universality, and Decidability of Consensus , 1992, WDAG.

[4]  Maurice Herlihy,et al.  Wait-free synchronization , 1991, TOPL.

[5]  Nancy A. Lynch,et al.  Reaching approximate agreement in the presence of faults , 1986, JACM.

[6]  P. Giblin.  Graphs, surfaces, and homology , 1977 .

[7]  Nancy A. Lynch,et al.  Electing a leader in a synchronous ring , 1987, JACM.

[8]  James H. Anderson,et al.  Composite registers , 1990, PODC '90.

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

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

[11]  Hagit Attiya,et al.  Achievable cases in an asynchronous environment , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[12]  Nancy A. Lynch,et al.  Are wait-free algorithms fast? , 1994, JACM.

[13]  Solomon Lefschetz,et al.  Introduction to Topology , 1950 .

[14]  Shmuel Zaks,et al.  A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor , 1988, PODC '88.

[15]  John R. Harper,et al.  Algebraic topology : a first course , 1982 .

[16]  Alan Fekete.  Asymptotically optimal algorithms for approximate agreement , 1986, PODC '86.

[17]  Maurice Herlihy,et al.  Impossibility results for asynchronous PRAM (extended abstract) , 1991, SPAA '91.

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

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

[20]  Nir Shavit,et al.  Atomic snapshots of shared memory , 1990, JACM.

[21]  Fred B. Schneider,et al.  Inexact agreement: accuracy, precision, and graceful degradation , 1985, PODC '85.