The weakest failure detectors to solve certain fundamental problems in distributed computing
From MaRDI portal
Publication:5501514
DOI10.1145/1011767.1011818zbMath1321.68102MaRDI QIDQ5501514
Carole Delporte-Gallet, Vassos Hadzilacos, Hugues Fauconnier, Sam Toueg, Petr Kuznetsov, Rachid Guerraoui
Publication date: 3 August 2015
Published in: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://infoscience.epfl.ch/record/83471/files/1596162953p115-delporte.pdf
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68P05: Data structures
68M14: Distributed systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
Wait-freedom with advice, Anonymous asynchronous systems: the case of failure detectors, On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems, The minimum information about failures for solving non-local tasks in message-passing systems, Managed agreement: generalizing two fundamental distributed agreement problems, An impossibility about failure detectors in the iterated immediate snapshot model, Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links, A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems, Asynchronous bounded lifetime failure detectors, Practically-self-stabilizing virtual synchrony, Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks, Failure detectors encapsulate fairness, Consensus in rooted dynamic networks with short-lived stability, On implementing omega in systems with weak reliability and synchrony assumptions, On the weakest failure detector ever
