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