Structured derivations of consensus algorithms for failure detectors

DOI10.1145/277697.277755MaRDI QIDQ2790120zbMATH OpenOpenAlexFDO

Authors Jiong Yang, Eli Gafni, 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)

Cited in

(12)

• On the uncontended complexity of anonymous agreement
• A necessary and sufficient condition for transforming limited accuracy failure detectors
• Failure detectors encapsulate fairness
• Tight bounds for k-set agreement with limited-scope failure detectors
• On the computability power and the robustness of set agreement-oriented failure detector classes
• On the weakest failure detector ever
• Of choices, failures and asynchrony: the many faces of set agreement
• Locality and checkability in wait-free computing
• Agreeing within a few writes
• The Iterated Restricted Immediate Snapshot Model
• 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

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