A Unified O(log N) and Optimal Sorting Vector Algorithm

被引：1
|
作者：
高庆狮
机构：
来源：
JournalofComputerScienceandTechnology | 1995年 / 05期
关键词：
Parallel processing; sorting; time complexity; optimal algorithm; multi-processor system;
D O I：
暂无
中图分类号：
TP311 [程序设计、软件工程];
学科分类号：
摘要：
A unilied vector sorting algorithm (VSA) is proposed, which sorts N arbitrary num-bers with clog. N-bits on an SIMD multi-processor system (SMMP) with processors and a composite interconnected network in time, where c is an arbitrary positive constant. When is an arbitrary small posi-tive constant and u = log2 N, it is an O(logN) algorithm and when it is an optimal algorithm,pT = O(N log N)); where u = 1, c = 1 and e = 0.5 (a constant).
引用
收藏
页码：470 / 475
页数：6
相关论文
共 50 条
  • [21] AN O(N LOG N LOG LOG N) PARALLEL MAXIMUM MATCHING ALGORITHM FOR BIPARTITE GRAPHS
    KIM, T
    CHWA, KY
    INFORMATION PROCESSING LETTERS, 1987, 24 (01) : 15 - 17
  • [22] An O(log n log log n) space algorithm for undirected st-connectivity
    Trifonov, Vladimir
    SIAM JOURNAL ON COMPUTING, 2008, 38 (02) : 449 - 483
  • [23] An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem
    Asadpour, Arash
    Goemans, Michel X.
    Madry, Aleksander
    Gharan, Shayan Oveis
    Saberi, Amin
    OPERATIONS RESEARCH, 2017, 65 (04) : 1043 - 1061
  • [24] An O(N log N) algorithm for shape modeling
    Malladi, R.
    Sethian, J. A.
    Proceedings of the National Academy of Sciences of the United States of America, 93 (18):
  • [25] AN O(N LOG N) MANHATTAN PATH ALGORITHM
    LIPSKI, W
    INFORMATION PROCESSING LETTERS, 1984, 19 (02) : 99 - 102
  • [26] An O(N log N) algorithm for shape modeling
    Malladi, R
    Sethian, JA
    PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1996, 93 (18) : 9389 - 9392
  • [27] An O(log n/log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
    Asadpour, Arash
    Goemans, Michel X.
    Madry, Aleksander
    Gharan, Shayan Oveis
    Saberi, Amin
    PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 379 - +
  • [28] Sorting Real Numbers in O(n √log n) Time and Linear Space
    Han, Yijie
    ALGORITHMICA, 2020, 82 (04) : 966 - 978
  • [29] An optimal O(n log n) algorithm for finding an enclosing planar rectilinear annulus of minimum width
    Gluchshenko, Olga N.
    Hamacher, Horst W.
    Tamir, Arie
    OPERATIONS RESEARCH LETTERS, 2009, 37 (03) : 168 - 170
  • [30] OPTIMAL PARALLEL SELECTION HAS COMPLEXITY O (LOG LOG N)
    AJTAI, M
    KOMLOS, J
    STEIGER, WL
    SZEMEREDI, E
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1989, 38 (01) : 125 - 133
12345