Building heaps in parallel

DOI10.1016/0020-0190(91)90154-AzbMath0714.68035OpenAlexW1967125472MaRDI QIDQ751273

Nageswara 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)

Related Items (9)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Heaps on Heaps
• Quotient Networks
• The Parallel Evaluation of General Arithmetic Expressions
• Building heaps fast

This page was built for publication: Building heaps in parallel