Parallel heap operations on an EREW PRAM

DOI10.1006/JPDC.1994.1024MaRDI QIDQ1325977zbMATH OpenOpenAlexFDO

Authors Weixiong Zhang, Richard E. Korf

Publication date 15 May 1994

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jpdc.1994.1024

zbMATH Keywords

dynamic processor allocationEREW PRAMinsertion algorithmsparallel algorithmparallel heap operationsroot deletion

Mathematics Subject Classification ID

Data structures (68P05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• Parallel heap: an optimal parallel priority queue
• Parallel algorithms for priority queue operations
• Building heaps in parallel
• Parallel algorithms for priority queue operations
• Some comments on building heaps in parallel

Cited in

(16)

• Optimal parallel construction of heaps
• An efficient algorithm for concurrent priority queue heaps
• O( N) time algorithms for Hamiltonian suffix and min-max-pair heap operations on the hypercube
• Merging heaps in parallel
• Small-Rank Selection in Parallel, with Applications to Heap Construction
• scientific article; zbMATH DE number 1555945 (Why is no real title available?)
• scientific article; zbMATH DE number 1760164 (Why is no real title available?)
• Heap construction in the parallel comparison tree model
• Routing on trees via matchings
• ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES
• Heaps with bits
• Parallel algorithms for priority queue operations
• Some comments on building heaps in parallel
• An optimal algorithm for deleting the root of a heap
• Building heaps in parallel
• Parallel heap: an optimal parallel priority queue

This page was built for publication: Parallel heap operations on an EREW PRAM

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