Lock-free deques and doubly linked lists
From MaRDI portal
Publication:436838
DOI10.1016/J.JPDC.2008.03.001zbMATH Open1243.68163OpenAlexW2155213629MaRDI QIDQ436838FDOQ436838
Authors: Håkan Sundell, Philippas Tsigas
Publication date: 26 July 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2008.03.001
Recommendations
Cites Work
- Randomized wait-free concurrent objects (extended abstract)
- Practical implementations of non-blocking synchronization primitives
- Title not available (Why is that?)
- Built-In Coloring for Highly-Concurrent Doubly-Linked Lists
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Safe memory reclamation for dynamic lock-free objects using atomic reads and writes
- Two-handed emulation, how to build non-blocking implementations of complex data-structures using DCAS
- Disjoint-access-parallel implementations of strong shared memory primitives
- Lock-free linked lists using compare-and-swap
- An Optimistic Approach to Lock-Free FIFO Queues
- Algorithms – ESA 2005
- Principles of Distributed Systems
Cited In (6)
Uses Software
This page was built for publication: Lock-free deques and doubly linked lists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436838)