The Weakest Failure Detector for Message Passing Set-Agreement

DOI10.1007/978-3-540-87779-0_8MaRDI QIDQ3540224zbMATH OpenOpenAlexFDO

Authors Carole Delporte-Gallet, Hugues Fauconnier, Andreas Tielmann, Rachid Guerraoui

Publication date 20 November 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-87779-0_8

zbMATH Keywords

failure detectorsset-agreement

Mathematics Subject Classification ID

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

Recommendations

• 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
• Anti-Ω
• Anti-\(\Omega \): the weakest failure detector for set agreement
• Weakening Failure Detectors for k-Set Agreement Via the Partition Approach

Cites work

• Anti-\(\Omega \): the weakest failure detector for set agreement
• Anti-Ω
• Automatic Classification of Eventual Failure Detectors
• Distributed Computing
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Indulgent algorithms (preliminary version)
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• On the weakest failure detector ever
• Sharing is harder than agreeing
• Sharing memory robustly in message-passing systems
• The topological structure of asynchronous computability
• The weakest failure detector for solving consensus
• Unreliable failure detectors for reliable distributed systems
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• Weakening Failure Detectors for k-Set Agreement Via the Partition Approach

Cited in

(10)

• Simultaneous consensus vs set agreement: a message-passing-sensitive hierarchy of agreement problems
• Anti-Ω
• Weakening Failure Detectors for k-Set Agreement Via the Partition Approach
• Anonymous asynchronous systems: the case of failure detectors
• scientific article; zbMATH DE number 2013834 (Why is no real title available?)
• 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
• The minimum information about failures for solving non-local tasks in message-passing systems
• A simple proof of the necessity of the failure detector \(\Sigma \) to implement an atomic register in asynchronous message-passing systems
• Anti-\(\Omega \): the weakest failure detector for set agreement

This page was built for publication: The Weakest Failure Detector for Message Passing Set-Agreement

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