• DocumentCode
    1272160
  • Title

    An efficient sorting algorithm on the multi-mesh network

  • Author

    De, Mallika ; Das, Debasish ; Ghosh, Mabhin ; Sinha, Bhabani P.

  • Author_Institution
    Kalyani Univ., India
  • Volume
    46
  • Issue
    10
  • fYear
    1997
  • fDate
    10/1/1997 12:00:00 AM
  • Firstpage
    1132
  • Lastpage
    1137
  • Abstract
    The shear-sort algorithm on an SIMD mesh model requires 4√N+o(√N) time for sorting N elements arranged on a √N×√N mesh. In this paper, we present an algorithm for sorting N elements in time O(N1/4) on an SIMD multi-mesh architecture, thereby significantly improving the order of the time complexity. The multi-mesh architecture is built around n2 blocks, where each block is an n×n mesh with n=N1/4, so that each processor will uniformly have four neighbors in the final topology
  • Keywords
    computational complexity; multiprocessor interconnection networks; sorting; SIMD mesh model; multi-mesh architecture; multi-mesh network; shear-sort algorithm; sorting algorithm; time complexity; Concurrent computing; Hypercubes; Merging; Multidimensional systems; Routing; Sorting; Topology;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.628397
  • Filename
    628397
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1272160