By Topic

Very fast optimal parallel algorithms for heap construction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
P. F. Dietz ; Dept. of Comput. Sci., Rochester Univ., NY, USA ; R. Ramant

We give two algorithms for permuting n items in an array into heap order on a CRCW PRAM. The first is deterministic and runs in O(log log n) time and performs O(n) operations and is time- and work-optimal. The second is randomized and runs in O(log log log n) time with high probability, performing O(n) operations. No PRAM algorithm with o(log n) run-time was previously known for this problem. We also study the parallel complexity of selecting the kth smallest of n elements on the CRCW PRAM, a problem of independent interest. We show that this problem can be solved deterministically in O(log log n+log k/log log n) time and O(n) operations for all 1⩽k⩽n/2, improving on existing algorithms when k is small compared to n. This run-time is also shown to be optimal

Published in:

Parallel and Distributed Processing, 1994. Proceedings. Sixth IEEE Symposium on

Date of Conference:

26-29 Oct 1994