Highly-efficient wait-free synchronization
DOI10.1007/S00224-013-9491-YzbMATH Open1314.68108OpenAlexW2096138267MaRDI QIDQ487262FDOQ487262
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
synchronizationcombiningconcurrent data structuresconcurrent queuesconcurrent stacksuniversal constructionswait freedom
Data structures (68P05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- The RedBlue Adaptive Universal Constructions
- Title not available (Why is that?)
- Help When Needed, But No More: Efficient Read/Write Partial Snapshot
- Combining funnels: A dynamic approach to software combining
- A time complexity lower bound for randomized implementations of some shared objects
- Space- and time-adaptive nonblocking algorithms
- Highly-efficient wait-free synchronization
- Universal constructions for multi-object operations
Cited In (9)
- The RedBlue family of universal constructions
- Title not available (Why is that?)
- How to share concurrent wait-free variables
- Extending the wait-free hierarchy to multi-threaded systems
- A Wait-free Queue with Polylogarithmic Step Complexity
- Highly-efficient wait-free synchronization
- A wait-free queue with polylogarithmic step complexity
- Are Lock-Free Concurrent Algorithms Practically Wait-Free?
- Universal constructions that ensure disjoint-access parallelism and wait-freedom
Uses Software
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)
