Untangling partial agreement: iterated x-consensus simulations
From MaRDI portal
Publication:5207909
Recommendations
- The Iterated Restricted Immediate Snapshot Model
- The \(k\)-simultaneous consensus problem
- k-Immediate Snapshot and x-Set Agreement: How Are They Related?
- Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement
- An impossibility about failure detectors in the iterated immediate snapshot model
Cites work
- scientific article; zbMATH DE number 1179121 (Why is no real title available?)
- scientific article; zbMATH DE number 1559574 (Why is no real title available?)
- A classification of wait-free loop agreement tasks
- A combinatorial characterization of the distributed 1-solvable tasks
- A completeness theorem for a class of synchronization objects
- A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
- An impossibility about failure detectors in the iterated immediate snapshot model
- An introductory tutorial to concurrency-related distributed recursion
- Atomic snapshots of shared memory
- Automatically increasing the fault-tolerance of distributed algorithms
- Decomposition of distributed programs into communication-closed layers
- Distributed computing through combinatorial topology
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus
- Immediate atomic snapshots and fast renaming
- Impossibility of distributed consensus with one faulty process
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- Power and limits of distributed computing shared memory models
- Renaming is weaker than set agreement but for perfect renaming: a map of sub-consensus tasks
- Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
- Sharing memory robustly in message-passing systems
- Simulations and reductions for colorless tasks
- Solvability in Asynchronous Environments II: Finite Interactive Tasks
- Sporadic solutions to zero-one exclusion tasks
- Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
- Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
- The BG distributed simulation algorithm
- The Complexity Gap between Consensus and Safe-Consensus
- The Heard-Of model: computing in distributed systems with benign faults
- The Iterated Restricted Immediate Snapshot Model
- The multiplicative power of consensus numbers
- The topological structure of asynchronous computability
- The topology of distributed adversaries
- Three-Processor Tasks Are Undecidable
- Unifying synchronous and asynchronous message-passing models
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
Cited in
(8)- An impossibility about failure detectors in the iterated immediate snapshot model
- Understanding the set consensus partial order using the Borowsky-Gafni simulation (extended abstract)
- k-Immediate Snapshot and x-Set Agreement: How Are They Related?
- Read-write memory and \(k\)-set consensus as an affine task
- Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement
- The Iterated Restricted Immediate Snapshot Model
- The \(k\)-simultaneous consensus problem
- The multiplicative power of consensus numbers
This page was built for publication: Untangling partial agreement: iterated \(x\)-consensus simulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207909)
