We use cookies to improve your experience with our site.

Indexed in:

SCIE, EI, Scopus, INSPEC, DBLP, CSCD, etc.

Submission System
(Author / Reviewer / Editor)
Chen Guoliang. A Partitioning Selection Algorithm on Multiprocessors[J]. Journal of Computer Science and Technology, 1988, 3(4): 241-250.
Citation: Chen Guoliang. A Partitioning Selection Algorithm on Multiprocessors[J]. Journal of Computer Science and Technology, 1988, 3(4): 241-250.

A Partitioning Selection Algorithm on Multiprocessors

More Information
  • Published Date: October 09, 1988
  • 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 …
  • [1]
    V.E.Alekseyev, Sorting algorithms with minimum memory, Kibernetika, 5:5(1969), 99-103.
    [2]
    A.C.C.Yao, Bounds on selection networks, SIAM.J.Comput., 9:3(1980), 566-582.
    [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.
    [4]
    G.L.Chen, Well-balanced partitioning selection network (in Chinese), Computer Research and Development, 21:11(1984), 9-21.
    [5]
    H.S.Stone, Parallel processing with the perfect shuffle, IEEE Trans.on computers, 20:2(1971), 153-161. ……….

Catalog

    Article views (7) PDF downloads (1616) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return