Lock-free deques and doubly linked lists

DOI10.1016/j.jpdc.2008.03.001zbMath1243.68163OpenAlexW2155213629MaRDI QIDQ436838

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

zbMATH Keywords

non-blockingconcurrentdequedoubly linked listlock-freemulti-threadshared data structure

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Built-in coloring for highly-concurrent doubly-linked lists

Uses Software

• Noble

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Built-In Coloring for Highly-Concurrent Doubly-Linked Lists
• Safe memory reclamation for dynamic lock-free objects using atomic reads and writes
• Two-handed emulation
• Randomized wait-free concurrent objects (extended abstract)
• Disjoint-access-parallel implementations of strong shared memory primitives
• Lock-free linked lists using compare-and-swap
• Practical implementations of non-blocking synchronization primitives
• An Optimistic Approach to Lock-Free FIFO Queues
• Algorithms – ESA 2005
• Principles of Distributed Systems