Extending the wait-free hierarchy to multi-threaded systems

DOI10.1007/S00446-022-00425-XOpenAlexW4226371127MaRDI QIDQ2166369

Ludmila Courtillat-Piazza, Matthieu Perrin, Grégoire Bonin, Achour Mostefaoui

Publication date: 24 August 2022

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

Full work available at URL: https://doi.org/10.1007/s00446-022-00425-x

zbMATH Keywords

universalitymemory allocationwait-freedomconsensus numberarrival modelsmulti-threaded system

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• From binary consensus to multivalued consensus in asynchronous message-passing systems
• Power and limits of distributed computing shared memory models
• Highly-efficient wait-free synchronization
• Abstraction for concurrent objects
• Bounded cost algorithms for multivalued consensus using binary consensus instances
• Common2 extended to stacks and unbounded concurrency
• The concurrency hierarchy, and algorithms for unbounded concurrency
• From bounded to unbounded concurrency objects and back
• Concurrent Programming: Algorithms, Principles, and Foundations
• Renaming in an asynchronous environment
• Impossibility of distributed consensus with one faulty process
• A new solution of Dijkstra's concurrent programming problem
• A completeness theorem for a class of synchronization objects
• A Complexity-Based Hierarchy for Multiprocessor Synchronization

This page was built for publication: Extending the wait-free hierarchy to multi-threaded systems