Weakening Failure Detectors for k-Set Agreement Via the Partition Approach

DOI10.1007/978-3-540-75142-7_12zbMath1145.68348OpenAlexW2171373158MaRDI QIDQ3523203

Yu Chen, XueZheng Liu, Wei Chen, Jia-Lin Zhang

Publication date: 2 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75142-7_12

zbMATH Keywords

\(k\)-set agreementfailure detectorpartitioned failure detectors

Mathematics Subject Classification ID

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

Related Items (5)

On the weakest failure detector ever ⋮ The Weakest Failure Detector for Message Passing Set-Agreement ⋮ 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 ⋮ Simultaneous Consensus vs Set Agreement: A Message-Passing-Sensitive Hierarchy of Agreement Problems

This page was built for publication: Weakening Failure Detectors for k-Set Agreement Via the Partition Approach