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

heapoptimal parallel algorithmParallel data structureparallel random access machinepriority queue

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

• Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
• Concurrent access of priority queues
• Concurrent Search and Insertion in AVL Trees
• Heaps on Heaps
• 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?)
• Optimal merging and sorting on the EREW PRAM
• Parallel Merge Sort
• Parallel priority queues

Cited in

(23)

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

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)