Optimal parallel weighted multiselection

Abstract

Copyright © 2002 IEEEWeighted multiselection requires us to select r elements from a given set of n elements, each associated with a weight such that each element selected is on a pre-specified weighted-rank, where an element is on weighted-rank k if it is the smallest element such that the aggregated weight of all elements not greater than it in the set is not smaller than k. This paper presents efficient algorithms for solving this problem both sequentially and in parallel on EREW PRAM. Our sequential algorithm solves this problem in time O(nlogr) which is optimal. Our parallel algorithm runs in O(T/sub 1/logr) time on an EREW PRAM with 1 < p /spl les/ n processors, and is optimal with respect to T/sub 1/ which is the time complexity for single-element weighted selection using p processors. We give a parallel algorithm for single-element weighted selection using p EREW processors which runs cost-optimally in O(n/p) time for 1 < p /spl les/ nloglogn/logn, and time-optimally in O(logn/loglogn) time for nloglogn/logn < p /spl les/ n.Hong She