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

DOI10.1007/S00446-008-0064-2MaRDI QIDQ2377255zbMATH OpenOpenAlexFDO

Authors Sergio Rajsbaum, Michel Raynal, Corentin Travers, 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

asynchronous systemdistributed algorithmfault-toleranceset-agreementunreliable failure detector

Mathematics Subject Classification ID

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

Recommendations

• Irreducibility and additivity of set agreement-oriented failure detector classes
• On the road to the weakest failure detector for k-set agreement in message-passing systems
• The combined power of conditions and failure detectors to solve asynchronous set agreement
• The weakest failure detector for solving k-set agreement
• \(K\)-set agreement with limited accuracy failure detectors

Cites work

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

Cited in

(18)

• Failure detectors encapsulate fairness
• Set agreement power is not a precise characterization for oblivious deterministic anonymous objects
• On the weakest failure detector ever
• Simultaneous consensus vs set agreement: a message-passing-sensitive hierarchy of agreement problems
• Anti-Ω
• Anonymous asynchronous systems: the case of failure detectors
• On Set Consensus Numbers
• Failure detectors to solve asynchronous k-set agreement: a glimpse of recent results
• The combined power of conditions and failure detectors to solve asynchronous set agreement
• Irreducibility and additivity of set agreement-oriented failure detector classes
• On the Classification of Deterministic Objects via Set Agreement Power
• On the weakest failure detector ever
• Partition approach to failure detectors for k-set agreement
• Failure detectors are schedulers
• The Notion of Veto Number and the Respective Power of $\Diamond {\cal P}$ and $\Diamond {\cal S}$ to Solve One-Shot Agreement Problems
• On the road to the weakest failure detector for k-set agreement in message-passing systems
• Perfect failure detection with very few bits
• ``\(\varGamma\)-accurate failure detectors

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

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