A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
From MaRDI portal
Cited in
(29)- Power and limits of distributed computing shared memory models
- An algorithmic approach to the asynchronous computability theorem
- The computational power of distributed shared-memory models with bounded-size registers
- An impossibility about failure detectors in the iterated immediate snapshot model
- Collapsibility of read/write models using discrete Morse theory
- Revisionist simulations: a new approach to proving space lower bounds
- Hundreds of impossibility results for distributed computing
- Untangling partial agreement: iterated \(x\)-consensus simulations
- A classification of wait-free loop agreement tasks
- t-resilient immediate snapshot Is impossible
- Structure theory of flip graphs with applications to weak symmetry breaking
- Communication pattern models: an extension of action models for dynamic-network distributed systems
- The computational power of distributed shared-memory models with bounded-size registers
- A simple characterization of asynchronous computations
- Wait-free approximate agreement on graphs
- Wait-free approximate agreement on graphs
- New combinatorial topology bounds for renaming: the lower bound
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing
- Partial synchrony based on set timeliness
- Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement
- The Iterated Restricted Immediate Snapshot Model
- An Introduction to the Topological Theory of Distributed Computing with Safe-consensus
- The topology of distributed adversaries
- A speedup theorem for asynchronous computation with applications to consensus and approximate agreement
- Bounds on the step and namespace complexity of renaming
- Brief announcement: On decidability of 2-process affine models
- Why Extension-Based Proofs Fail
- Schlegel diagram and optimizable immediate snapshot protocol
- The solvability of consensus in iterated models extended with safe-consensus
This page was built for publication: A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361482)
