A classification of wait-free loop agreement tasks
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3812514 (Why is no real title available?)
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 3709228 (Why is no real title available?)
- scientific article; zbMATH DE number 3562105 (Why is no real title available?)
- scientific article; zbMATH DE number 709538 (Why is no real title available?)
- scientific article; zbMATH DE number 1559573 (Why is no real title available?)
- scientific article; zbMATH DE number 1559574 (Why is no real title available?)
- scientific article; zbMATH DE number 3235051 (Why is no real title available?)
- A combinatorial characterization of the distributed 1-solvable tasks
- A gap theorem for consensus types extended abstract
- A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
- A simple constructive computability theorem for wait-free computation
- Algebraic spans
- Atomic snapshots of shared memory
- Consensus power makes (some) sense! (extended abstract)
- Generalized FLP impossibility result for t-resilient asynchronous computations
- How to share concurrent wait-free variables
- Impossibility of distributed consensus with one faulty process
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- On the minimal synchronism needed for distributed consensus
- On the robustness of Herlihy's hierarchy
- Renaming in an asynchronous environment
- Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
- Set consensus using arbitrary objects (preliminary version)
- The asynchronous computability theorem for t-resilient tasks
- The unified structure of consensus, a layered analysis approach
- Three-Processor Tasks Are Undecidable
- Towards a topological characterization of asynchronous complexity
- Wait-free k-set agreement is impossible
- Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies (extended abstract)
Cited in
(20)- A non-topological proof for the impossibility of \(k\)-set agreement
- Power and limits of distributed computing shared memory models
- An algorithmic approach to the asynchronous computability theorem
- Classifying rendezvous tasks of arbitrary dimension
- The topology of look-compute-move robot wait-free algorithms with hard termination
- Wait-free solvability of colorless tasks in anonymous shared-memory model
- Revisionist simulations: a new approach to proving space lower bounds
- The relative power of composite loop agreement tasks
- Hundreds of impossibility results for distributed computing
- Untangling partial agreement: iterated \(x\)-consensus simulations
- scientific article; zbMATH DE number 7561451 (Why is no real title available?)
- Locality and checkability in wait-free computing
- Locality and checkability in wait-free computing
- Algebraic topology and distributed computing
- scientific article; zbMATH DE number 7228882 (Why is no real title available?)
- New combinatorial topology bounds for renaming: the lower bound
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing
- An Introduction to the Topological Theory of Distributed Computing with Safe-consensus
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects
- The evolution of non-degenerate and degenerate rendezvous tasks
This page was built for publication: A classification of wait-free loop agreement tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1870526)
