Abstract
Purchase PDF (59 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (2)
Purchase PDF (946 K)
doi:10.1016/S0020-0190(99)00113-1 
Copyright © 1999 Elsevier Science B.V. All rights reserved.
Selecting small ranks in EREW PRAM
Received 30 June 1999;
revised 27 September 1999.
Communicated by L. Boasson
Available online 23 November 1999.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Given an array of n items from a totally ordered set, we show that the kth smallest element of the array can be found in O(lgn(lg
n−lg(n/k))) time and O(n) work on an EREW PRAM. This means, in particular, that the kth smallest item can be found in O(lgn) time using n/lgn processors on an EREW PRAM as long as k≤n/lg(c)n for some constant c. Here lg(c)n is the logarithm, iterated c times, of n and lgn is the number of times the logarithm is taken before the resulting number becomes less than 1.
Author Keywords: Selection; Parallel algorithms; PRAM; Combinatorial problems
