Abstract
The problem of selecting thekth largest or smallest element of {x i +y j |x i εX andy j εY ∀i,j} whereX=(x 1,x 2, ..,x n ) andY=(y 1,y 2, ...,y n ) are two arrays ofn elements each, is considered. Certain improvements to an existing algorithm are proposed. An algorithm requiringO(logk·logn) units of time on a Shared Memory Model of a parallel computer havingO(n 1+1/β) processors is presented where β is a pre-assigned constant lying between 1 and 2.
Similar content being viewed by others
References
P. Gupta and G. P. Bhattacharjee,Parallel generation of combinations lexicographically, Proc. of 1st conf. of Foundation of Software Technology and Theoretical Computer Science, India (1981), 193–200.
L. H. Harper, T. H. Payne, J. E. Savage and E. Strans,Sorting X+Y, CACM, 18, 6 (1975), 347–349.
D. Heller,A survey of parallel algorithms in numerical linear algebra, Technical Report, Department of Comp. Sc., Carnegie-Mellon University, Pittsburgh (1976).
D. S. Hirschberg,Fast parallel sorting algorithms, CACM, 21, 8 (1978), 657–661.
D. B. Johnson and T. Mizoguchi,Selecting the kth element in X+Y and X 1+X 2+...X n , SIAM J. Comput. 7, 2 (1978), 147–153.
D. E. Knuth,The Art of Computer Programming Vol. 3, Addison-Wesley, Reading Mass. (1973).
H. T. Kung,Synchronized and asynchronous parallel algorithms for multiprocessors, in:Algorithms and Complexity: New Directions and Recent Results, edited by J. F. Traub, Academic Press, N.Y. (1976), 153–200.
W. L. Miranker,A survey of parallelism in numerical analysis, SIAM Review 13, 4 (1971), 524–527.
D. Nassimi and Sarataj Sahni,Parallel permutation and sorting algorithms and a new generalized connection network, University of Minnesota, TR-79-8 (1979).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gupta, P., Bhattacharjee, G.P. A parallel selection algorithm. BIT 24, 274–287 (1984). https://doi.org/10.1007/BF02136026
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02136026