Efficient parallel algorithms for selection and multiselection on mesh-connected computers

In this paper we present a set of efficient parallel algorithms for selection and multiselection on a /spl radic/p/spl times//spl radic/p mesh-connected computer. Our main contributions include: a new algorithm for single-element selection for the general case when p/spl les/n based on the generalized bitonic selection approach, which is more efficient than the previously known result for this problem when p/spl ges/n/sup 1/2+/spl epsiv// for any /spl epsiv/>0; an efficient algorithm for multiselection on SIMD mesh for selecting r elements from n given elements; an efficient algorithm for multiselection on an MIMD mesh that runs in O(logr(p/sup 1/2/+n/p(log/sup 2/ p)) time and is time-optimal w.r.t. the current best result on single-element selection on mesh.