Every problem has a weakest failure detector

DOI10.1145/1400751.1400763MaRDI QIDQ2934334zbMATH OpenOpenAlexFDO

Authors 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

asynchronous systemfailure detectorfault-tolerance

Mathematics Subject Classification ID

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

Recommendations

• The weakest failure detectors to solve certain fundamental problems in distributed computing
• On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion
• On the hardness of failure-sensitive agreement problems.
• On the weakest failure detector ever
• The weakest failure detector for solving k-set agreement

Cited in

(12)

• In search of lost time
• Failure detectors encapsulate fairness
• Renaming and the weakest family of failure detectors
• The weakest failure detector for eventual consistency
• Anonymous asynchronous systems: the case of failure detectors
• On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion
• What can be computed in a distributed system?
• Wait-freedom with advice
• Perfect failure detection with very few bits
• On set consensus numbers
• The minimum information about failures for solving non-local tasks in message-passing systems
• Anti-\(\Omega \): the weakest failure detector for set agreement

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934334)