Parallel heap: an optimal parallel priority queue

DOI10.1007/BF00128644zbMATH Open1187.68170OpenAlexW1967362387MaRDI QIDQ973413FDOQ973413

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Parallel Merge Sort
• Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
• Heaps on Heaps
• Optimal merging and sorting on the EREW PRAM
• Concurrent access of priority queues
• Parallel priority queues
• Concurrent Search and Insertion in AVL Trees
• Title not available (Why is that?)

Cited In (19)

• Building a parallel branch and bound library
• Title not available (Why is that?)
• A parallel priority queue with constant time operations
• Randomized priority queues for fast parallel access
• Parallel priority queues
• Architecture independent parallel selection with applications to parallel priority queues
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Routing on trees via matchings
• TSLQueue: an efficient lock-free design for priority queues
• Parallel algorithms for priority queue operations
• Building heaps in parallel
• 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)