PARALLEL SORTING ON CAYLE GRAPHS

被引:5
|
作者
GORDON, DM
机构
[1] Department of Computer Science, University of Georgia, Athens, 30602, GA
关键词
SORTING; HYPERCUBE; SORTING NETWORK; PARALLEL ALGORITHM; COMPLEXITY;
D O I
10.1007/BF01759059
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
This paper presents a parallel algorithm for sorting on any graph with a Hamiltonian path and 1-factorization. For an n-cube the algorithm is equivalent to the sequential balanced sorting network of Dowd, Perl, Rudolph, and Saks. The application of this algorithm to other networks is discussed.
引用
收藏
页码:554 / 564
页数:11
相关论文
共 50 条
  • [31] ON PARALLEL HASHING AND INTEGER SORTING
    MATIAS, Y
    VISHKIN, U
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 1991, 12 (04): : 573 - 606
  • [32] FAST PARALLEL SORTING ALGORITHMS
    HIRSCHBERG, DS
    COMMUNICATIONS OF THE ACM, 1978, 21 (08) : 657 - 661
  • [33] A SORTING CLASSIFICATION OF PARALLEL RENDERING
    MOLNAR, S
    COX, M
    ELLSWORTH, D
    FUCHS, H
    IEEE COMPUTER GRAPHICS AND APPLICATIONS, 1994, 14 (04) : 23 - 32
  • [34] PARALLEL COMPLEXITY OF SORTING PROBLEMS
    AIGNER, M
    JOURNAL OF ALGORITHMS, 1982, 3 (01) : 79 - 88
  • [35] CONWAY PARALLEL SORTING ALGORITHM
    WARSHAUER, ML
    JOURNAL OF ALGORITHMS, 1986, 7 (02) : 270 - 276
  • [36] Parallel sorting by exact splitting
    Dian, F
    Tang, ZZ
    I-SPAN 2004: 7TH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND NETWORKS, PROCEEDINGS, 2004, : 92 - 97
  • [37] PARALLEL ALGORITHMS FOR MERGING AND SORTING
    DEO, N
    SARKAR, D
    INFORMATION SCIENCES, 1991, 56 (1-3) : 151 - 161
  • [38] PARALLEL SORTING WITH SERIAL MEMORIES
    OWENS, RM
    JA, JJ
    IEEE TRANSACTIONS ON COMPUTERS, 1985, 34 (04) : 379 - 383
  • [39] Engineering Parallel String Sorting
    Timo Bingmann
    Andreas Eberle
    Peter Sanders
    Algorithmica, 2017, 77 : 235 - 286
  • [40] Parallel integer sorting is more efficient than parallel comparison sorting on exclusive write PRAMs
    Han, YJ
    Shen, XJ
    PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 419 - 428