DCAS-based concurrent deques

DOI10.1007/S00224-002-1058-2MaRDI QIDQ1849584zbMATH OpenOpenAlexFDO

Authors Ole Agesen, David L. Detlefs, Christine H. Flood, Alexander T. Garthwaite, P. A. Martin

Publication date 1 December 2002

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-002-1058-2

zbMATH Keywords

concurrent dequesDCAS operation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Even better DCAS-based concurrent deques
• Linearizable Wait-Free Iteration Operations in Shared Double-Ended Queues
• Two-handed emulation, how to build non-blocking implementations of complex data-structures using DCAS
• Lock-free and practical doubly linked list-based deques using single-word compare-and-swap
• Lock-free deques and doubly linked lists

Cited in

(10)

• A dynamic-sized nonblocking work stealing deque
• An optimistic approach to lock-free FIFO queues
• Nonblocking \(k\)-compare-single-swap
• Built-in coloring for highly-concurrent doubly-linked lists
• Even better DCAS-based concurrent deques
• scientific article; zbMATH DE number 437540 (Why is no real title available?)
• Lock-free deques and doubly linked lists
• Two-handed emulation, how to build non-blocking implementations of complex data-structures using DCAS
• Lock-free and practical doubly linked list-based deques using single-word compare-and-swap
• Faster randomized repeated choice and DCAS

Describes a project that uses

Uses Software

• SIMPLIFY

This page was built for publication: DCAS-based concurrent deques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849584)