Every problem has a weakest failure detector

DOI10.1145/1400751.1400763zbMath1301.68127OpenAlexW2004688613MaRDI QIDQ2934334

Prasad Jayanti, Sam Toueg

Publication date: 12 December 2014

Published in: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1400751.1400763

zbMATH Keywords

fault-toleranceasynchronous systemfailure detector

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (11)

Anonymous asynchronous systems: the case of failure detectors ⋮ In search of lost time ⋮ Failure detectors encapsulate fairness ⋮ Renaming and the weakest family of failure detectors ⋮ On set consensus numbers ⋮ The minimum information about failures for solving non-local tasks in message-passing systems ⋮ What Can be Computed in a Distributed System? ⋮ The weakest failure detector for eventual consistency ⋮ Anti-\(\Omega \): the weakest failure detector for set agreement ⋮ Wait-freedom with advice ⋮ Perfect failure detection with very few bits

This page was built for publication: Every problem has a weakest failure detector