A Partitioning Selection Algorithm on Multiprocessors

The so-called(m,n)selection problem is the problem of selecting the m smallest(or largest)elements from n given numbers(n>m).With the development of parallel computers, much attention has been paid to the design of efficient algorithms of(m,n)problem for these machines.The parallel selection algorithm has been successful on networks,but seldom studied on the multiprocessing systems.This paper,based on a partitioning approach,proposes a partitioning algorithm of selection on multiprocessors using Valiant …