The weakest failure detector for solving k-set agreement

DOI10.1145/1582716.1582735zbMath1291.68046OpenAlexW1969718746MaRDI QIDQ5170305

Petr Kuznetsov, Eli Gafni

Publication date: 23 July 2014

Published in: Proceedings of the 28th ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-set agreementweakest failure detectorfailure detectorsBG-simulationsynchrony assumptions

Mathematics Subject Classification ID

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

Related Items

A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling ⋮ Failure detectors encapsulate fairness ⋮ On set consensus numbers ⋮ On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems ⋮ Anti-\(\Omega \): the weakest failure detector for set agreement