Highly-efficient wait-free synchronization

DOI10.1007/s00224-013-9491-yzbMath1314.68108OpenAlexW2096138267MaRDI QIDQ487262

Nikolaos D. Kallimanis, Panagiota Fatourou

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

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

Related Items (5)

Extending the wait-free hierarchy to multi-threaded systems ⋮ A Wait-free Queue with Polylogarithmic Step Complexity ⋮ Universal constructions that ensure disjoint-access parallelism and wait-freedom ⋮ The RedBlue family of universal constructions ⋮ Highly-efficient wait-free synchronization

Uses Software

• GitHub
• PSim
• Hoard
• Flat-Combining

Cites Work

• Highly-efficient wait-free synchronization
• Combining funnels: A dynamic approach to software combining
• A time complexity lower bound for randomized implementations of some shared objects
• The RedBlue Adaptive Universal Constructions
• Help When Needed, But No More: Efficient Read/Write Partial Snapshot
• Universal constructions for multi-object operations
• Unnamed Item
• Unnamed Item

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