Optimal parallel construction of heaps

DOI10.1016/0020-0190(93)90139-ZMaRDI QIDQ1313734zbMATH OpenOpenAlexFDO

Authors C. M. Khoong

Publication date 24 February 1994

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(93)90139-z

zbMATH Keywords

priority queuesabstract data typeparallel heap construction algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Distributed algorithms (68W15)

Recommendations

• Building heaps in parallel
• Heap construction in the parallel comparison tree model
• Some comments on building heaps in parallel
• Heaps with bits
• Parallel heap operations on an EREW PRAM

Cites work

• An optimal parallel algorithm to construct a deap
• An optimally efficient selection algorithm
• Building heaps in parallel
• Efficient parallel k selection algorithm
• Parallel selection
• Parallelism in Comparison Problems

Cited in

(8)

• Building heaps in parallel
• Heap construction in the parallel comparison tree model
• Heap construction: Optimal in both worst and average cases?
• Some comments on building heaps in parallel
• Parameterized self-adjusting heaps
• Comparator networks for binary heap construction
• Priority queues on parallel machines
• In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses

Describes a project that uses

Uses Software

• heapsort

This page was built for publication: Optimal parallel construction of heaps

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