An efficient algorithm for concurrent priority queue heaps

DOI10.1016/S0020-0190(96)00148-2zbMath0900.68171OpenAlexW2099292526MaRDI QIDQ1350117

Srinivasan Parthasarathy, Michael L. Scott, Galen C. Hunt, Maged M. Michael

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00148-2

zbMATH Keywords

SynchronizationData structuresHeapConcurrencyPriority queueBit-reversal

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Data structures (68P05)

Related Items (1)

Solving the shortest path tour problem

Cites Work

• Concurrent access of priority queues
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient algorithm for concurrent priority queue heaps