Failure detectors in loosely named systems

DOI10.1145/1400751.1400762zbMath1301.68119OpenAlexW2020967059MaRDI QIDQ2934333

Israel Nir, Yehuda Afek

Publication date: 12 December 2014

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

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

zbMATH Keywords

wait-freefailure detectors\textsc{Symmetry Breaking}anti-\({\Omega}\)loosely named systemsset consensus

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (3)

Renaming and the weakest family of failure detectors ⋮ The renaming problem in shared memory systems: an introduction ⋮ Anti-\(\Omega \): the weakest failure detector for set agreement

This page was built for publication: Failure detectors in loosely named systems