An Introduction to the Topological Theory of Distributed Computing with Safe-consensus
From MaRDI portal
Publication:5179019
DOI10.1016/j.entcs.2012.05.004zbMath1347.68261OpenAlexW1993726501WikidataQ113318124 ScholiaQ113318124MaRDI QIDQ5179019
Publication date: 18 March 2015
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2012.05.004
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Combinatorial aspects of simplicial complexes (05E45)
Related Items (1)
Cites Work
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- A classification of wait-free loop agreement tasks
- The Combinatorial Structure of Wait-Free Solvable Tasks
- The topological structure of asynchronous computability
- A combinatorial characterization of the distributed 1-solvable tasks
- The Iterated Restricted Immediate Snapshot Model
- Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
- Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus
- Impossibility of distributed consensus with one faulty process
- Atomic snapshots of shared memory
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Wait-free k-set agreement is impossible
- The asynchronous computability theorem for t-resilient tasks
- A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
- Immediate atomic snapshots and fast renaming
- Distributed Computing
- Unnamed Item
- Unnamed Item
This page was built for publication: An Introduction to the Topological Theory of Distributed Computing with Safe-consensus
