An impossibility about failure detectors in the iterated immediate snapshot model
From MaRDI portal
Publication:975436
DOI10.1016/J.IPL.2008.05.001zbMath1191.68130OpenAlexW2081422263MaRDI QIDQ975436
Corentin Travers, Sergio Rajsbaum, Michel Raynal
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.05.001
distributed computingdistributed computabilityfailure detectorprocess crashasynchronous shared memory systematomic read/write registeriterated immediate snapshot modelsnapshot operation
Related Items (4)
Power and limits of distributed computing shared memory models ⋮ The solvability of consensus in iterated models extended with safe-consensus ⋮ Untangling Partial Agreement: Iterated x-consensus Simulations ⋮ t-Resilient Immediate Snapshot Is Impossible
Cites Work
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- Failure detectors as type boosters
- The topological structure of asynchronous computability
- Conditions on input vectors for consensus solvability in asynchronous distributed systems
- The Iterated Restricted Immediate Snapshot Model
- Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
- The Committee Decision Problem
- Impossibility of distributed consensus with one faulty process
- Atomic snapshots of shared memory
- Unreliable failure detectors for reliable distributed systems
- The weakest failure detector for solving consensus
- Atomic Snapshots in O (n log n) Operations
- Disk Paxos
- A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
- Immediate atomic snapshots and fast renaming
- Distributed Computing
- The weakest failure detectors to solve certain fundamental problems in distributed computing
This page was built for publication: An impossibility about failure detectors in the iterated immediate snapshot model
