Building heaps in parallel

DOI10.1016/0020-0190(91)90154-AMaRDI QIDQ751273zbMATH OpenOpenAlexFDO

Authors N. S. V. Rao, Weixiong Zhang

Publication date 1991

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

Full work available at URL https://doi.org/10.1016/0020-0190(91)90154-a

zbMATH Keywords

hypercubeparallel algorithmsdesign of algorithmsEREW PRAM

Mathematics Subject Classification ID

Data structures (68P05) Distributed algorithms (68W15)

Recommendations

• Optimal parallel construction of heaps
• Some comments on building heaps in parallel
• Parallel heap: an optimal parallel priority queue
• Parallel heap operations on an EREW PRAM
• Heaps with bits

Cites work

• scientific article; zbMATH DE number 4155887 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• Building heaps fast
• Heaps on Heaps
• Quotient Networks
• The Parallel Evaluation of General Arithmetic Expressions

Cited in

(11)

• Some comments on building heaps in parallel
• ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES
• Heaps with bits
• Priority queues on parallel machines
• Optimal parallel construction of heaps
• Building heaps fast
• Heap construction in the parallel comparison tree model
• Routing on trees via matchings
• Parallel algorithms for priority queue operations
• Merging heaps in parallel
• Parallel algorithms for priority queue operations

This page was built for publication: Building heaps in parallel

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