DCAS-based concurrent deques
From MaRDI portal
Publication:1849584
DOI10.1007/S00224-002-1058-2zbMath1017.68146OpenAlexW2065052953MaRDI QIDQ1849584
Paul A. Martin, David L. Detlefs, Ole Agesen, Christine H. Flood, Alexander T. Garthwaite
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
Related Items (4)
Built-in coloring for highly-concurrent doubly-linked lists ⋮ A dynamic-sized nonblocking work stealing deque ⋮ An optimistic approach to lock-free FIFO queues ⋮ Nonblocking \(k\)-compare-single-swap
Uses Software
This page was built for publication: DCAS-based concurrent deques