Even better DCAS-based concurrent deques

DOI10.1007/3-540-40026-5_4MaRDI QIDQ2766861zbMATH OpenFDO

Authors David L. Detlefs, Christine H. Flood, Alexander T. Garthwaite, Nir Shavit, Guy L. jun. Steele, P. A. Martin

Publication date 28 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-40026-5_4

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computing methodologies and applications (68U99)

Recommendations

• DCAS-based concurrent deques
• Fast and lock-free concurrent priority queues for multi-thread systems
• Competitive concurrent distributed queuing
• Concurrent access of priority queues
• Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
• An optimistic approach to lock-free FIFO queues

Cited in

(13)

• DCAS-based concurrent deques
• A dynamic-sized nonblocking work stealing deque
• Nonblocking \(k\)-compare-single-swap
• Solo-valency and the cost of coordination
• Built-in coloring for highly-concurrent doubly-linked lists
• scientific article; zbMATH DE number 437540 (Why is no real title available?)
• Built-In Coloring for Highly-Concurrent Doubly-Linked Lists
• Lock-free deques and doubly linked lists
• Lock-free reference counting
• 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
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Efficient multi-word compare and swap

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

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