An optimal parallel algorithm for the multiselection problem

@article{Alsuwaiyel2001AnOP,
  title={An optimal parallel algorithm for the multiselection problem},
  author={Muhammad H. Alsuwaiyel},
  journal={Parallel Computing},
  year={2001},
  volume={27},
  pages={861-865}
}
Given a set S of n elements drawn from a linearly ordered set, and a set K = {k1, k2, . . . , kr} of positive integers between 1 and n, the multiselection problem is to select the kith smallest element for all values of i, 1 ≤ i ≤ r. We present a simple optimal algorithm to solve this problem that runs in O(n log r) time on the EREW PRAM with n1− processors, 0 < < 1. 

From This Paper

Topics from this paper.