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 条
  • [1] Unified O(log N) and optimal sorting vector algorithm
    Gao, Qingshi
    1995, Allerton Press Inc, New York, NY, USA (10)
  • [2] A Novel In-Place Sorting Algorithm with O(n log z) Comparisons and O(n log z) Moves
    Mahmoud, Hanan Ahmed-Hosni
    Al-Ghreimil, Nadia
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 16, 2006, 16 : 239 - 244
  • [3] An O(n3/2 √log(n)) algorithm for sorting by reciprocal translocations
    Ozery-Flato, Michal
    Shamir, Ron
    COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2006, 4009 : 258 - 269
  • [4] On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n log n) Time
    Cunha, Luis Felipe I.
    Kowada, Luis Antonio B.
    Hausen, Rodrigo de A.
    de Figueiredo, Celina M. H.
    ADVANCES IN BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 2013, 8213 : 126 - 135
  • [5] An O(n(3/2) root log(n)) algorithm for sorting by reciprocal translocations
    Ozery-Flato, Michal
    Shamir, Ron
    JOURNAL OF DISCRETE ALGORITHMS, 2011, 9 (04) : 344 - 357
  • [6] AN OPTIMAL O(LOG LOG-N) TIME PARALLEL STRING MATCHING ALGORITHM
    BRESLAUER, D
    GALIL, Z
    SIAM JOURNAL ON COMPUTING, 1990, 19 (06) : 1051 - 1058
  • [7] The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(n log n) Time
    Firoz, Jesun S.
    Hasan, Masud
    Khan, Ashik Z.
    Rahman, M. Sohel
    WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2010, 5942 : 161 - 166
  • [8] The 1.375 Approximation Algorithm for Sorting by Transpositions Can Run in O(n log n) Time
    Firoz, Jesun Sahariar
    Hasan, Masud
    Khan, Ashik Zinnat
    Rahman, M. Sohel
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2011, 18 (08) : 1007 - 1011
  • [9] Deterministic sorting in O (n log log n) time and linear space
    Han, YJ
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2004, 50 (01): : 96 - 105
  • [10] An optimal O(log log N)-time parallel algorithm for detecting all squares in a string
    Apostolico, A
    Breslauer, D
    SIAM JOURNAL ON COMPUTING, 1996, 25 (06) : 1318 - 1331
12345