On implementing omega with weak reliability and synchrony assumptions
From MaRDI portal
Publication:2943769
DOI10.1145/872035.872081zbMath1321.68099OpenAlexW4299511718MaRDI QIDQ2943769
Hugues Fauconnier, Carole Delporte-Gallet, Sam Toueg, Marcos Kawazoe Aguilera
Publication date: 4 September 2015
Published in: Proceedings of the twenty-second annual symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/872035.872081
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items (7)
Implementing unreliable failure detectors with unknown membership ⋮ Communication-efficient and crash-quiescent omega with unknown membership ⋮ Self-stabilizing indulgent zero-degrading binary consensus ⋮ When consensus meets self-stabilization ⋮ Communication-optimal eventually perfect failure detection in partially synchronous systems ⋮ A simple and communication-efficient omega algorithm in the crash-recovery model ⋮ Implementing the Omega failure detector in the crash-recovery failure model
Cites Work
This page was built for publication: On implementing omega with weak reliability and synchrony assumptions
