Every problem has a weakest failure detector
From MaRDI portal
Publication:2934334
DOI10.1145/1400751.1400763zbMath1301.68127MaRDI QIDQ2934334
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
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68M14: Distributed systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
68W15: Distributed algorithms
Related Items
What Can be Computed in a Distributed System?, Wait-freedom with advice, Perfect failure detection with very few bits, Anonymous asynchronous systems: the case of failure detectors, 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, In search of lost time, Failure detectors encapsulate fairness, Renaming and the weakest family of failure detectors, The weakest failure detector for eventual consistency