Recommendations
Cites work
- scientific article; zbMATH DE number 1696666 (Why is no real title available?)
- scientific article; zbMATH DE number 571325 (Why is no real title available?)
- scientific article; zbMATH DE number 2006660 (Why is no real title available?)
- scientific article; zbMATH DE number 2013836 (Why is no real title available?)
- scientific article; zbMATH DE number 2013841 (Why is no real title available?)
- 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
- Lock-free linked lists using compare-and-swap
- Practical implementations of non-blocking synchronization primitives
- Principles of Distributed Systems
- Randomized wait-free concurrent objects (extended abstract)
- 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
Cited in
(6)- scientific article; zbMATH DE number 17818 (Why is no real title available?)
- scientific article; zbMATH DE number 2006660 (Why is no real title available?)
- Principles of Distributed Systems
- Built-in coloring for highly-concurrent doubly-linked lists
- Non-blocking doubly-linked lists with good amortized complexity
- DCAS-based concurrent deques
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)