Untangling partial agreement: iterated x-consensus simulations

DOI10.1007/978-3-319-21741-3_10zbMATH Open1428.68075OpenAlexW2277873734MaRDI QIDQ5207909FDOQ5207909

Authors: Damien Imbs, Sergio Rajsbaum, Adrián Valle 

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

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

zbMATH Keywords

distributed computingconsensuswait-freedomasynchronous systemsiterated immediate snapshotread/write shared memorytask solvability

Mathematics Subject Classification ID

Distributed systems (68M14)

Cites Work

• Impossibility of distributed consensus with one faulty process
• Atomic snapshots of shared memory
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony
• The topological structure of asynchronous computability
• Title not available (Why is that?)
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Unifying synchronous and asynchronous message-passing models
• Simulations and reductions for colorless tasks
• A combinatorial characterization of the distributed 1-solvable tasks
• Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
• The topology of distributed adversaries
• Three-Processor Tasks Are Undecidable
• Title not available (Why is that?)
• A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
• Immediate atomic snapshots and fast renaming
• A classification of wait-free loop agreement tasks
• The Heard-Of model: computing in distributed systems with benign faults
• Automatically increasing the fault-tolerance of distributed algorithms
• The Iterated Restricted Immediate Snapshot Model
• Power and limits of distributed computing shared memory models
• Sharing memory robustly in message-passing systems
• The BG distributed simulation algorithm
• The multiplicative power of consensus numbers
• A completeness theorem for a class of synchronization objects
• An impossibility about failure detectors in the iterated immediate snapshot model
• Decomposition of distributed programs into communication-closed layers
• Title not available (Why is that?)
• Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
• Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus
• Title not available (Why is that?)
• Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks
• Sporadic Solutions to Zero-One Exclusion Tasks
• Solvability in Asynchronous Environments II: Finite Interactive Tasks
• The Complexity Gap between Consensus and Safe-Consensus

Cited In (3)

• An impossibility about failure detectors in the iterated immediate snapshot model
• k-Immediate Snapshot and x-Set Agreement: How Are They Related?
• The Iterated Restricted Immediate Snapshot Model

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)