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
fDate :
10/1/1997 12:00:00 AM
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;
Journal_Title :
Computers, IEEE Transactions on
