On the computability power and the robustness of set agreement-oriented failure detector classes

DOI10.1007/s00446-008-0064-2zbMath1267.68070OpenAlexW2166765530MaRDI QIDQ2377255

Corentin Travers, Sergio Rajsbaum, Michel Raynal, Achour Mostefaoui

Publication date: 28 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-008-0064-2

zbMATH Keywords

fault-tolerancedistributed algorithmasynchronous systemunreliable failure detectorset-agreement

Mathematics Subject Classification ID

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

Related Items (4)

Anonymous asynchronous systems: the case of failure detectors ⋮ Failure detectors encapsulate fairness ⋮ On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems ⋮ Perfect failure detection with very few bits

Cites Work

• From \(\diamond \mathcal W\) to \(\omega\) : A simple bounded quiescent reliable broadcast-based transformation
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Tight bounds for \(k\)-set agreement with limited-scope failure detectors
• Structured derivations of consensus algorithms for failure detectors
• The topological structure of asynchronous computability
• Conditions on input vectors for consensus solvability in asynchronous distributed systems
• Impossibility of distributed consensus with one faulty process
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
• k-set agreement with limited accuracy failure detectors
• The combined power of conditions and failure detectors to solve asynchronous set agreement
• Irreducibility and additivity of set agreement-oriented failure detector classes
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Set consensus using arbitrary objects (preliminary version)
• Failure detectors and the wait-free hierarchy (extended abstract)
• Distributed Computing

This page was built for publication: On the computability power and the robustness of set agreement-oriented failure detector classes