Parallel heap: an optimal parallel priority queue

DOI10.1007/BF00128644zbMath1187.68170OpenAlexW1967362387MaRDI QIDQ973413

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

priority queueheapparallel random access machineoptimal parallel algorithmParallel data structure

Mathematics Subject Classification ID

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

Related Items (5)

Routing on trees via matchings ⋮ AN EFFICIENT ALGORITHM FOR MANAGING A PARALLEL HEAP∗ ⋮ Architecture independent parallel selection with applications to parallel priority queues ⋮ Unnamed Item ⋮ ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal merging and sorting on the EREW PRAM
• Parallel priority queues
• Heaps on Heaps
• Parallel Merge Sort
• Concurrent access of priority queues
• Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
• Concurrent Search and Insertion in AVL Trees

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