Issue No. 04 - October (1991 vol. 2)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.97899
<p>An adaptive parallel algorithm for inducing a priority queue structure on an n-element array is presented. The algorithm is extended to provide optimal parallel construction algorithms for three other heap-like structures useful in implementing double-ended priority queues, namely min-max heaps, deeps, and min-max-pair heaps. It is shown that an n-element array can be made into a heap, a deap, a min-max heap, or a min-max-pairheap in O(log n+(n/p)) time using no more than n/log n processors, in the exclusive-read-exclusive-write parallel random-access machine model.</p>
Index Termsparallel initialization algorithms; adaptive parallel algorithm; priority queue structure;n-element array; parallel construction algorithms; heap-like structures; double-endedpriority queues; min-max heaps; deeps; min-max-pair heaps; processors;exclusive-read-exclusive-write parallel random-access machine; computationalcomplexity; data structures; parallel algorithms; queueing theory
Z. Wen and S. Olariu, "Optimal Parallel Initialization Algorithms for a Class of Priority Queues," in IEEE Transactions on Parallel & Distributed Systems, vol. 2, no. , pp. 423-429, 1991.