Lock-free deques and doubly linked lists
From MaRDI portal
Recommendations
Cites work
- A practical multi-word compare-and-swap operation
- A pragmatic implementation of non-blocking linked-lists
- Algorithms – ESA 2005
- An optimistic approach to lock-free FIFO queues
- Built-In Coloring for Highly-Concurrent Doubly-Linked Lists
- Disjoint-access-parallel implementations of strong shared memory primitives
- Even better DCAS-based concurrent deques
- scientific article; zbMATH DE number 571325 (Why is no real title available?)
- Lock-free and practical doubly linked list-based deques using single-word compare-and-swap
- Lock-free linked lists using compare-and-swap
- Practical implementations of non-blocking synchronization primitives
- Randomized wait-free concurrent objects (extended abstract)
- Safe memory reclamation for dynamic lock-free objects using atomic reads and writes
- The repeat offender problem: A mechanism for supporting dynamic-sized, lock-free data structures
- Two-handed emulation, how to build non-blocking implementations of complex data-structures using DCAS
Cited in
(6)- DCAS-based concurrent deques
- Built-in coloring for highly-concurrent doubly-linked lists
- scientific article; zbMATH DE number 17818 (Why is no real title available?)
- A pragmatic implementation of non-blocking linked-lists
- Non-blocking doubly-linked lists with good amortized complexity
- Lock-free and practical doubly linked list-based deques using single-word compare-and-swap
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)