Untangling Partial Agreement: Iterated x-consensus Simulations
From MaRDI portal
Publication:5207909
DOI10.1007/978-3-319-21741-3_10zbMath1428.68075OpenAlexW2277873734MaRDI QIDQ5207909
Adrián Valle, Damien Imbs, Sergio Rajsbaum
Publication date: 14 January 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-21741-3_10
distributed computingasynchronous systemsconsensuswait-freedomtask solvabilityiterated immediate snapshotread/write shared memory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The topology of distributed adversaries
- Power and limits of distributed computing shared memory models
- An impossibility about failure detectors in the iterated immediate snapshot model
- Decomposition of distributed programs into communication-closed layers
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- A classification of wait-free loop agreement tasks
- The Heard-Of model: computing in distributed systems with benign faults
- Unifying synchronous and asynchronous message-passing models
- Round-by-round fault detectors (extended abstract)
- Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks
- Simulations and reductions for colorless tasks
- The topological structure of asynchronous computability
- A combinatorial characterization of the distributed 1-solvable tasks
- Automatically increasing the fault-tolerance of distributed algorithms
- The Iterated Restricted Immediate Snapshot Model
- Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
- Impossibility of distributed consensus with one faulty process
- Three-Processor Tasks Are Undecidable
- Solvability in Asynchronous Environments II: Finite Interactive Tasks
- Atomic snapshots of shared memory
- Sharing memory robustly in message-passing systems
- Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- The BG distributed simulation algorithm
- Sporadic Solutions to Zero-One Exclusion Tasks
- Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
- The multiplicative power of consensus numbers
- Generalized FLP impossibility result for t-resilient asynchronous computations
- A completeness theorem for a class of synchronization objects
- A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
- Immediate atomic snapshots and fast renaming
- The Complexity Gap between Consensus and Safe-Consensus
