Failure detectors as type boosters

DOI10.1007/s00446-007-0043-zzbMath1266.68053OpenAlexW2038362823MaRDI QIDQ1954255

Rachid Guerraoui, Petr Kuznetsov

Publication date: 20 June 2013

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

Full work available at URL: https://doi.org/10.1007/s00446-007-0043-z

Mathematics Subject Classification ID

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

Related Items

On the weakest failure detector ever ⋮ On set consensus numbers ⋮ The computational structure of progress conditions and shared objects ⋮ The impossibility of boosting distributed service resilience ⋮ An impossibility about failure detectors in the iterated immediate snapshot model ⋮ On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems ⋮ Wait-freedom with advice

Cites Work

• Unnamed Item
• Unnamed Item
• The impossibility of boosting distributed service resilience
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Atomic snapshots of shared memory
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Robust wait-free hierarchies
• All of Us Are Smarter than Any of Us: Nondeterministic Wait-Free Hierarchies Are Not Robust
• Determining Consensus Numbers
• Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus
• Randomized wait-free concurrent objects (extended abstract)
• Consensus power makes (some) sense! (extended abstract)
• Failure detectors and the wait-free hierarchy (extended abstract)
• On the weakest failure detector ever
• Distributed Computing

This page was built for publication: Failure detectors as type boosters