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

DOI10.1007/978-3-540-75142-7_12MaRDI QIDQ3523203zbMATH OpenOpenAlexFDO

Authors Wei Chen, Yu Chen, XueZheng Liu, Jialin 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)

Recommendations

• Partition approach to failure detectors for k-set agreement
• The weakest failure detector for solving k-set agreement
• On the road to the weakest failure detector for k-set agreement in message-passing systems
• \(K\)-set agreement with limited accuracy failure detectors
• Tight bounds for \(k\)-set agreement with limited-scope failure detectors
• Tight bounds for k-set agreement with limited-scope failure detectors
• Tight bounds for \(k\)-set agreement with limited-scope failure detectors
• Failure detectors to solve asynchronous k-set agreement: a glimpse of recent results
• The Weakest Failure Detector for Message Passing Set-Agreement

Cited in

(10)

• On the weakest failure detector ever
• Simultaneous consensus vs set agreement: a message-passing-sensitive hierarchy of agreement problems
• Anti-Ω
• The Weakest Failure Detector for Message Passing Set-Agreement
• The weakest failure detector for solving k-set agreement
• Partial synchrony based on set timeliness
• The combined power of conditions and failure detectors to solve asynchronous set agreement
• Partition approach to failure detectors for k-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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3523203)