An efficient algorithm for concurrent priority queue heaps

DOI10.1016/S0020-0190(96)00148-2MaRDI QIDQ1350117zbMATH OpenOpenAlexFDO

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

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

ConcurrencyPriority queueSynchronizationData structuresBit-reversalHeap

Mathematics Subject Classification ID

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

Recommendations

• Concurrent access of priority queues
• Parallel heap: an optimal parallel priority queue
• Power balance and apportionment algorithms for the United States Congress
• Parallel heap operations on an EREW PRAM
• Parallel priority queues based on binomial heaps

Cites work

• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3905859 (Why is no real title available?)
• Concurrent access of priority queues

Cited in

(12)

• TSLQueue: an efficient lock-free design for priority queues
• Power balance and apportionment algorithms for the United States Congress
• Min-max heaps and generalized priority queues
• Lock-free concurrent binomial heaps
• A heap-based concurrent priority queue with mutable priorities for faster parallel algorithms
• Solving the shortest path tour problem
• Concurrent access of priority queues
• Parallel heap: an optimal parallel priority queue
• scientific article; zbMATH DE number 1979501 (Why is no real title available?)
• The soft heap
• Concurrent lock-free unbounded priority queue with mutable priorities
• Fast and lock-free concurrent priority queues for multi-thread systems

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

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