Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms

DOI10.1007/978-3-540-75142-7_34MaRDI QIDQ3523228zbMATH OpenOpenAlexFDO

Authors Gadi Taubenfeld

Publication date 2 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75142-7_34

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Recommendations

• Distributed Computing
• The complexity of obstruction-free implementations
• The weakest failure detectors to boost obstruction-freedom
• The Weakest Failure Detectors to Boost Obstruction-Freedom
• Synchronizing without locks is inherently expensive

Cited in

(5)

• A protocol converter for nonblocking protocols
• Proving that non-blocking algorithms don't block
• Contention-sensitive data structures and algorithms
• Distributed Computing
• Adaptive progress: a gracefully-degrading liveness property

This page was built for publication: Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms

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