Lock-free deques and doubly linked lists

DOI10.1016/J.JPDC.2008.03.001MaRDI QIDQ436838zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

concurrentdequedoubly linked listlock-freemulti-threadnon-blockingshared data structure

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Principles of Distributed Systems
• scientific article; zbMATH DE number 2006660
• scientific article; zbMATH DE number 1696666
• Fast and lock-free concurrent priority queues for multi-thread systems
• DCAS-based concurrent deques

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

Describes a project that uses

Uses Software

• Noble

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)