Highly-efficient wait-free synchronization

DOI10.1007/S00224-013-9491-YMaRDI QIDQ487262zbMATH OpenOpenAlexFDO

Authors Panagiota Fatourou, Nikolaos D. Kallimanis

Publication date 19 January 2015

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-013-9491-y

zbMATH Keywords

synchronizationcombiningconcurrent data structuresconcurrent queuesconcurrent stacksuniversal constructionswait freedom

Mathematics Subject Classification ID

Data structures (68P05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1263230
• On the inherent weakness of conditional synchronization primitives
• On the inherent weakness of conditional primitives
• Software transactional memory

Cites work

• scientific article; zbMATH DE number 1263230 (Why is no real title available?)
• A time complexity lower bound for randomized implementations of some shared objects
• Combining funnels: A dynamic approach to software combining
• Help When Needed, But No More: Efficient Read/Write Partial Snapshot
• Highly-efficient wait-free synchronization
• Space- and time-adaptive nonblocking algorithms
• The RedBlue Adaptive Universal Constructions
• Universal constructions for multi-object operations

Cited in

(12)

• When is recoverable consensus harder than consensus?
• The RedBlue family of universal constructions
• Efficient fetch-and-increment
• scientific article; zbMATH DE number 7774267 (Why is no real title available?)
• How to share concurrent wait-free variables
• Extending the wait-free hierarchy to multi-threaded systems
• A Wait-free Queue with Polylogarithmic Step Complexity
• Distributed Computing – IWDC 2005
• Highly-efficient wait-free synchronization
• A wait-free queue with polylogarithmic step complexity
• Laws of order, expensive synchronization in concurrent algorithms cannot be eliminated
• Universal constructions that ensure disjoint-access parallelism and wait-freedom

Describes a project that uses

Uses Software

• GitHub
• Flat-Combining
• Hoard
• PSim

This page was built for publication: Highly-efficient wait-free synchronization

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