Building heaps in parallel

DOI10.1016/0020-0190(91)90154-AzbMATH Open0714.68035OpenAlexW1967125472MaRDI QIDQ751273FDOQ751273

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

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

zbMATH Keywords

hypercubeparallel algorithmsdesign of algorithmsEREW PRAM

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The Parallel Evaluation of General Arithmetic Expressions
• Heaps on Heaps
• Building heaps fast
• Title not available (Why is that?)
• Quotient Networks

Cited In (11)

• Some comments on building heaps in parallel
• ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES
• Priority queues on parallel machines
• Heaps with bits
• 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)