The combined power of conditions and failure detectors to solve asynchronous set agreement

DOI10.1145/1073814.1073848zbMath1314.68077OpenAlexW2056860700MaRDI QIDQ5177240

Achour Mostefaoui, Sergio Rajsbaum, Michel Raynal

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

snapshotshared memoryconsensusasynchronous systemprocess crashset agreementfailure detection

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (2)

On the computability power and the robustness of set agreement-oriented failure detector classes ⋮ Narrowing Power vs. Efficiency in Synchronous Set Agreement

This page was built for publication: The combined power of conditions and failure detectors to solve asynchronous set agreement