Journal of Computer Science and Technology

, Volume 3, Issue 4, pp 241–250 | Cite as

A partitioning selection algorithm on multiprocessors

  • Chen Guoliang 
Regular Papers


The so-called (m, n) selection, problem is the problem of selecting them smallest (or largest) elements fromn 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’s merging and sorting schemes. By means of this algorithm, (m, n) selection problem can be completed in paralleln/2 processors in timeO (lognloglogm-log(n/m)loglog(n/m))1).


Selection Algorithm Selection Problem Selection Network MINs Sequence Merging Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    V.E. Alekseyev, Sorting algorithms with minimum memoryKibernetika,5:5(1969), 99–103.Google Scholar
  2. [2]
    A.C.C. Yao, Bounds on selection networks,SIAM.J.Comput.,9: 3 (1980), 566–582.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    B.W. Wah and G.L. Chen, A partitioning approach to the design of selection networks,IEEE Trans. on computers,23:3(1984), 261–268.CrossRefMathSciNetGoogle Scholar
  4. [4]
    G.L. Chen, Well-balanced partitioning selection network (in Chinese),Computer Research and Development,21:11(1984), 9–21.Google Scholar
  5. [5]
    H.S. Stone, Parallel processing with the perfect shuffle,IEEE Trans. on computers,20:2(1971), 153–161.zbMATHCrossRefGoogle Scholar
  6. [6]
    G.L. Chen and H. Shen Bitonic selection network and bitonic selection algorithm on multiprocessors, Submitted to Journal of computer science and technology for publication.Google Scholar
  7. [7]
    L. G. Valiant, Parallelism in comparison problems,SIAM. J. Comput.,4:3(1975), 348–355.zbMATHCrossRefMathSciNetGoogle Scholar
  8. [8]
    K.E. Batcher, Sorting networks and their applications, Proc. 1968, SJCC, AFIPS Press.,32(1968), 307–314.Google Scholar
  9. [9]
    F.P. Preparata, New parallel-sorting schemes,IEEE Trans. on Computers,27:7 (1978), 669–673.zbMATHCrossRefMathSciNetGoogle Scholar
  10. [10]
    G.L. Chen and Z.L. Wang, A merging approach to the parallel selection algorithm (in Chinese),Chinese Journal of Computers,11:1(1988), 14–21.Google Scholar
  11. [11]
    G.L. Chen and J. Liu, A partitioning selection algorithm on multiprocessors (in Chinese), Submitted to Computer Research and Development for publication.Google Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 1988

Authors and Affiliations

  • Chen Guoliang 
    • 1
  1. 1.University of Science and Technology of ChinaHefei

Personalised recommendations