Fast and lock-free concurrent priority queues for multi-thread systems
From MaRDI portal
Publication:1779732
DOI10.1016/J.JPDC.2004.12.005zbMath1101.68498OpenAlexW2129017891MaRDI QIDQ1779732
Philippas Tsigas, Håkan Sundell
Publication date: 1 June 2005
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.67.1310
Related Items (4)
Concurrent linearizable nearest neighbour search in LockFree-kD-tree ⋮ Lock-free concurrent binomial heaps ⋮ Unnamed Item ⋮ NB{\texttt{malloc}}: Allocating memory in a lock-free manner
This page was built for publication: Fast and lock-free concurrent priority queues for multi-thread systems
