Structured derivations of consensus algorithms for failure detectors

DOI10.1145/277697.277755zbMath1333.68285OpenAlexW2038719275MaRDI QIDQ2790120

Eli Gafni, Jiong Yang, Gil Neiger

Publication date: 2 March 2016

Published in: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (12)

A necessary and sufficient condition for transforming limited accuracy failure detectors ⋮ On the computability power and the robustness of set agreement-oriented failure detector classes ⋮ On the weakest failure detector ever ⋮ Agreeing within a few writes ⋮ On the uncontended complexity of anonymous agreement ⋮ Failure detectors encapsulate fairness ⋮ The Iterated Restricted Immediate Snapshot Model ⋮ Of choices, failures and asynchrony: the many faces of set agreement ⋮ Tight bounds for \(k\)-set agreement with limited-scope failure detectors ⋮ Locality and checkability in wait-free computing ⋮ Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures ⋮ Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links

This page was built for publication: Structured derivations of consensus algorithms for failure detectors