Failure detectors are schedulers
DOI10.1145/1281100.1281146zbMATH Open1283.68088OpenAlexW2162187197MaRDI QIDQ5401427FDOQ5401427
Authors: Alejandro Cornejo, Sergio Rajsbaum, Michel Raynal, Corentin Travers 
Publication date: 13 March 2014
Published in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1281100.1281146
Recommendations
- An impossibility about failure detectors in the iterated immediate snapshot model
- The Iterated Restricted Immediate Snapshot Model
- Brief announcement: Increasing the power of the iterated immediate snapshot model with failure detectors
- On the computability power and the robustness of set agreement-oriented failure detector classes
- Unreliable failure detectors for reliable distributed systems
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (10)
- An impossibility about failure detectors in the iterated immediate snapshot model
- Asynchronous bounded lifetime failure detectors
- Brief announcement: Increasing the power of the iterated immediate snapshot model with failure detectors
- Automatic Classification of Eventual Failure Detectors
- Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
- Failure detectors encapsulate fairness
- Partial synchrony based on set timeliness
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
- The Iterated Restricted Immediate Snapshot Model
- Asynchronous failure detectors
This page was built for publication: Failure detectors are schedulers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5401427)
