Optimal parallel multiselection on EREW PRAM
Author(s)
Shen, Hong
Griffith University Author(s)
Year published
1997
Metadata
Show full item recordAbstract
Multiselection requires to select r elements at specified ranks in a given set of n elements, r ≤ n. This paper proposes a paradigm for parallel multiselection to achieve the optimal cost. Following this paradigm and employing a cost-optimal algorithm for single-element selection, a cost-optimal parallel algorithm for multiselection is presented. Our algorithm runs in O(nϵ log r) time on an EREW PRAM with n1−ϵ processors for any 0 < ϵ < 1. In the special case when ϵ =log(lognlog*n)logn, our algorithm requires O(lognlog*nlogr) time and O(n log r) cost.Multiselection requires to select r elements at specified ranks in a given set of n elements, r ≤ n. This paper proposes a paradigm for parallel multiselection to achieve the optimal cost. Following this paradigm and employing a cost-optimal algorithm for single-element selection, a cost-optimal parallel algorithm for multiselection is presented. Our algorithm runs in O(nϵ log r) time on an EREW PRAM with n1−ϵ processors for any 0 < ϵ < 1. In the special case when ϵ =log(lognlog*n)logn, our algorithm requires O(lognlog*nlogr) time and O(n log r) cost.
View less >
View less >
Journal Title
Parallel Computing
Volume
23
Issue
13
Subject
Distributed Computing
Cognitive Sciences