Parallel heap: an optimal parallel priority queue

DOI10.1007/BF00128644MaRDI QIDQ973413zbMATH OpenOpenAlexFDO

Authors Narsingh Deo, Sushil K. Prasad

Publication date 31 May 2010

Published in The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00128644

zbMATH Keywords

heappriority queueparallel random access machineoptimal parallel algorithmParallel data structure

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Parallel algorithms in computer science (68W10)

Recommendations

• Parallel priority queues
• An efficient algorithm for concurrent priority queue heaps
• Parallel algorithms for priority queue operations
• Parallel heap operations on an EREW PRAM
• Parallel priority queues based on binomial heaps

Cites work

• scientific article; zbMATH DE number 3825195 (Why is no real title available?)
• scientific article; zbMATH DE number 3905859 (Why is no real title available?)
• scientific article; zbMATH DE number 1142306 (Why is no real title available?)
• Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
• Concurrent Search and Insertion in AVL Trees
• Concurrent access of priority queues
• Heaps on Heaps
• Optimal merging and sorting on the EREW PRAM
• Parallel Merge Sort
• Parallel priority queues

Cited in

(19)

• A parallel priority queue with constant time operations
• Randomized priority queues for fast parallel access
• Parallel priority queues
• Building a parallel branch and bound library
• scientific article; zbMATH DE number 7561439 (Why is no real title available?)
• Architecture independent parallel selection with applications to parallel priority queues
• scientific article; zbMATH DE number 1979501 (Why is no real title available?)
• Parallel priority queues based on binomial heaps
• ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES
• Priority queues on parallel machines
• AN EFFICIENT ALGORITHM FOR MANAGING A PARALLEL HEAP∗
• The soft heap
• A comparative study of parallel and sequential priority queue algorithms
• scientific article; zbMATH DE number 1760034 (Why is no real title available?)
• Routing on trees via matchings
• TSLQueue: an efficient lock-free design for priority queues
• Building heaps in parallel
• Parallel algorithms for priority queue operations
• Parallel algorithms for priority queue operations

This page was built for publication: Parallel heap: an optimal parallel priority queue

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