Failure detectors are schedulers

DOI10.1145/1281100.1281146zbMath1283.68088OpenAlexW2162187197MaRDI QIDQ5401427

Sergio Rajsbaum, Michel Raynal, Alejandro Cornejo, 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

zbMATH Keywords

failure detectoriterated asynchronous model

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (3)

Partial synchrony based on set timeliness ⋮ Failure detectors encapsulate fairness ⋮ The Iterated Restricted Immediate Snapshot Model

This page was built for publication: Failure detectors are schedulers