The weakest failure detectors to boost obstruction-freedom

DOI10.1007/S00446-007-0046-9MaRDI QIDQ1954262zbMATH OpenOpenAlexFDO

Authors Rachid Guerraoui, Michał Kapałka, Petr Kuznetsov

Publication date 20 June 2013

Published in Distributed Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1007/s00446-007-0046-9

zbMATH Keywords

contention managerfailure detectornon-blockingobstruction-freeshared memorywait-free

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• The Weakest Failure Detectors to Boost Obstruction-Freedom
• Distributed Computing
• The complexity of obstruction-free implementations
• scientific article; zbMATH DE number 1263230
• Distributed Computing

Cites work

• A performance evaluation of lock-free synchronization protocols
• Distributed Computing
• Distributed Computing
• scientific article; zbMATH DE number 1696684 (Why is no real title available?)
• scientific article; zbMATH DE number 1179121 (Why is no real title available?)
• scientific article; zbMATH DE number 2006647 (Why is no real title available?)
• Impossibility of distributed consensus with one faulty process
• Indulgent algorithms (preliminary version)
• Randomized wait-free concurrent objects (extended abstract)
• Robust wait-free hierarchies
• The weakest failure detector for solving consensus
• Toward a theory of transactional contention managers
• Unreliable failure detectors for reliable distributed systems
• Wait-free algorithms for fast, long-lived renaming

Cited in

(14)

• Anonymity-preserving failure detectors
• Failure detectors encapsulate fairness
• The computational structure of progress conditions and shared objects
• Distributed universality
• The complexity of obstruction-free implementations
• Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms
• The Weakest Failure Detectors to Boost Obstruction-Freedom
• Towards a universal construction for transaction-based multiprocess programs
• What can be computed in a distributed system?
• Contention-sensitive data structures and algorithms
• Distributed Computing
• Distributed Computing
• Abortable and query-abortable objects and their efficient implementation
• The minimum information about failures for solving non-local tasks in message-passing systems

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

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