The weakest failure detectors to boost obstruction-freedom

DOI10.1007/s00446-007-0046-9zbMath1266.68052OpenAlexW2047745508MaRDI QIDQ1954262

Rachid Guerraoui, Michał Kapałka, 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-0046-9

zbMATH Keywords

shared memoryobstruction-freewait-freefailure detectornon-blockingcontention manager

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (7)

Distributed universality ⋮ Towards a universal construction for transaction-based multiprocess programs ⋮ Failure detectors encapsulate fairness ⋮ The minimum information about failures for solving non-local tasks in message-passing systems ⋮ The computational structure of progress conditions and shared objects ⋮ Contention-sensitive data structures and algorithms ⋮ What Can be Computed in a Distributed System?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Wait-free algorithms for fast, long-lived renaming
• Impossibility of distributed consensus with one faulty process
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Robust wait-free hierarchies
• Indulgent algorithms (preliminary version)
• Toward a theory of transactional contention managers
• Randomized wait-free concurrent objects (extended abstract)
• A performance evaluation of lock-free synchronization protocols
• Distributed Computing
• Distributed Computing

This page was built for publication: The weakest failure detectors to boost obstruction-freedom