Failure detectors and the wait-free hierarchy (extended abstract)
From MaRDI portal
Publication:5361443
DOI10.1145/224964.224976zbMath1373.68142MaRDI QIDQ5361443
Publication date: 29 September 2017
Published in: Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing - PODC '95 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/224964.224976
68M14: Distributed systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
Related Items
The renaming problem in shared memory systems: an introduction, On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems, The gap in circumventing the impossibility of consensus, Partial synchrony based on set timeliness, Failure detectors as type boosters, On the computability power and the robustness of set agreement-oriented failure detector classes, On the weakest failure detector ever