The asynchronous computability theorem for t-resilient tasks

@article{Herlihy1993TheAC,
  title={The asynchronous computability theorem for t-resilient tasks},
  author={Maurice Herlihy and Nir Shavit},
  journal={Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing},
  year={1993}
}
  • M. Herlihy, N. Shavit
  • Published 1 June 1993
  • Mathematics, Computer Science
  • Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing
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… 

Figures from this paper

Asynchronous Computability Theorem in Arbitrary Solo Models

The asynchronous computability theorem is established in d-solo system by borrowing concepts from combinatorial topology, in which a necessary and sufficient conditions for a task to be wait-free computable in that system.

A Topological Characterization to Arbitrary Resilient Asynchronous Complexity

The theorem states that the time complexity of any arbitrary resilient asynchronous algorithm is proportional to the level of a reduced delayed complex necessary to allow a simplicial map from a task’s input complex to its output complex.

The Topological Structure of Asynchronous Computability the Topological Structure of Asynchronous Computability

A new formalism for tasks is introduced, based on notions from classical algebraic and combinatorial topology, in which a task's possible input and output values are each associated with high-dimensional geometric structures called simplicial complexes, and computability is characterized in terms of the topological properties of these complexes.

A generalized asynchronous computability theorem

This work provides topological conditions for T to be solvable in M, and when applied to the wait-free model, these conditions result in the celebrated Asynchronous Computability Theorem of Herlihy and Shavit.

The topological structure of asynchronous computability

This work introduces a new formalism for tasks, based on notions from classical algebraic and combinatorial topology, in which a task''s possible input and output values are each associated with high-dimensional geometric structures called simplicial complexes, and characterize computability in terms of the topological properties of these complexes.

An algorithmic approach to the asynchronous computability theorem

This paper gives the first complete description of the asynchronous computability theorem, along with a proof of correctness, and proposes an alternative proof based on a distributed algorithmic, termed the “convergence algorithm”.

A Simple Algorithmic Characterization of Uniform Solvability (Extended Abstract)

The technique is used to generalize the alternative algorithmic proof, by Borowsky and Gafni, of the HS conditions, by showing that the infinite uniform sequence of task of Immediate Snapshots is uniformly solvable.

Using approximate agreement to obtain complete disagreement: the output structure of input-free asynchronous computations

  • S. Moran
  • Computer Science, Mathematics
    Proceedings Third Israel Symposium on the Theory of Computing and Systems
  • 1995
This paper studies the t-solvability problem by studying the properties of input/output mappings defined by t-resilient protocols, and presents a new, simple version of wait-free approximate agreement protocol.

A simple constructive computability theorem for wait-free computation

It is shown that a synchronization problem has a wait-free solution if and only if its input complex can be continuously “stretched and folded” to cover its output complex.

The Topology of Randomized Symmetry-Breaking Distributed Computing

Interestingly, it is found that solvability of leader election relates to the number of parties that possess correlated randomness, either directly or via their greatest common divisor, depending on the specific communication model.
...

References

SHOWING 1-10 OF 26 REFERENCES

A combinatorial characterization of the distributed tasks which are solvable in the presence of one faulty processor

A universal protocol is presented which solves any task which is found to be solvable by its condition, and a novel technique is derived to prove lower bounds on the number of messages that must be sent due to processor failure.

Generalized FLP impossibility result for t-resilient asynchronous computations

This paper generalizes FLP to multiple faults and establishes that k-set consensus proposed by Chaudhuri is impossible, if the protocol is to tolerate k failures, while there exists a protocol that tolerates k – 1 failures.

Achievable cases in an asynchronous environment

Two pairs of goals are exhibited that are achievable even in the presence of up to t ≪ n/2 faulty processors, contradicting the widely held assumption that no nontrivial goals are attainable in such a system.

Agreement is harder than consensus: set consensus problems in totally asynchronous systems

This work proves using a combinatorial argument that any k-resilient protocol for the k-set consensus problem would satisfy the uncertainty condition, while this seems to strengthen the conjecture that there is no k- Resilient Protocol for this problem.

Wait-free k-set agreement is impossible: the topology of public knowledge

It is shown that for any k<n, there is no deterministic wait-free protocol for n processors that solves the k-set agreement problem, and a topological structure is revealed that reveals a close analogy between the impossibility ofWait-free k- set agreement and the Brouwer fixed point theorem for thek-dimensional ball.

Asymptotically optimal algorithms for approximate agreement

This paper introduces some algorithms to solve crash-failure, failure-by-omission and Byzantine failure versions of the Byzantine Generals or consensus problem, where non-faulty processors need only

Impossibility results for asynchronous PRAM (extended abstract)

This papers shows that the extent to which asynchronous PRAM permits long-lived, highly concurrent data structures is no and there is a strict infinite hierarchy among objects that do not solve consensus.

Reaching approximate agreement in the presence of faults

This paper considers a variant of the Byzantine Generals problem, in which processes start with arbitrary real values rather than Boolean values or values from some bounded range, and in which

Some Results on the Impossibility, Universality, and Decidability of Consensus

A concurrent system in which all implementations of shared objects are wait-free is resilient to process crashes because every process can complete every operation on that object in a finite number of its own steps, regardless of the execution speeds of the remaining processes.

Wait-free synchronization

A hierarchy of objects is derived such that no object at one level has a wait-free implementation in terms of objects at lower levels, and it is shown that atomic read/write registers, which have been the focus of much recent attention, are at the bottom of the hierarchy.