We use cookies to improve your experience with our site.
Chen Guoliang, Shen Hong. A Bitonic Selection Algorithm on Multiprocessor System. Journal of Computer Science and Technology, 1989, 4(4): 315-322.
Citation: Chen Guoliang, Shen Hong. A Bitonic Selection Algorithm on Multiprocessor System. Journal of Computer Science and Technology, 1989, 4(4): 315-322.

A Bitonic Selection Algorithm on Multiprocessor System

  • The so-called (m, n) selection problem is defined as the selection of the m smallest (or largest) numbers from n given numbers (n>m). Solving this problem in parallel mode has been successful on the networks, but it is seldom studied on the multiprocessor systems. This paper first, based on Batcher's principle of bitonic merging, proposes the bitonic selection network. Then it repeals the varying rule of the pivots in all successive ranks of the network through our observation to the data transfer property in the network. Finally, according to this rule, the parallel selection algorithm with running time O (lognlogm)1) on n processors is presented.
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return