Analysis of Multi-Sort Algorithm on Multi-Mesh of Trees (MMT) architecture

Various sorting algorithms using parallel architectures have been proposed in the search for more efficient results. This paper introduces the Multi-Sort Algorithm for Multi-Mesh of Trees (MMT) Architecture for N=n4 elements with more efficient time complexity compared to previous architectures. The shear sort algorithm on Single Instruction Multiple Data (SIMD) mesh model requires $4\sqrt{N}+O\sqrt{N}$ time for sorting N elements, arranged on a $\sqrt{N}\times \sqrt{N}$ mesh, whereas Multi-Sort algorithm on the SIMD Multi-Mesh (MM) Architecture takes O(N1/4) time for sorting the same N elements, which proves that Multi-Sort is a better sorting approach. We have improved the time complexity of intrablock Sort. The Communication time complexity for 2D Sort in MM is O(n), whereas this time in MMT is O(log n). The time complexity of compare–exchange step in MMT is same as that in MM, i.e., O(n). It has been found that the time complexity of the Multi-Sort on MMT has been improved as on Multi-Mesh architecture.

[1]  Hamid R. Arabnia,et al.  Parallel Edge-Region-Based Segmentation Algorithm Targeted at Reconfigurable MultiRing Network , 2003, The Journal of Supercomputing.

[2]  Franco P. Preparata,et al.  New Parallel-Sorting Schemes , 1978, IEEE Transactions on Computers.

[3]  Bhabani P. Sinha,et al.  A New Network Topology with Multiple Meshes , 1999, IEEE Trans. Computers.

[4]  Selim G. Akl,et al.  Optimal Parallel Merging and Sorting Without Memory Conflicts , 1987, IEEE Transactions on Computers.

[5]  Bhabani P. Sinha,et al.  An Efficient Sorting Algorithm on the Multi-Mesh Network , 1997, IEEE Trans. Computers.

[6]  Isaac D. Scherson,et al.  Parallel Sorting in Two-Dimensional VLSI Models of Computation , 1989, IEEE Trans. Computers.

[7]  S.M. Bhandarkar,et al.  The Hough Transform on a Reconfigurable Multi-Ring Network , 1995, J. Parallel Distributed Comput..

[8]  Xie Hongwei,et al.  An Improved Parallel Sorting Algorithm for Odd Sequence , 2008, 2008 International Conference on Advanced Computer Theory and Engineering.

[9]  Hamid R. Arabnia,et al.  A Reconfigurable Architecture for Image Processing and Computer Vision , 1995, Int. J. Pattern Recognit. Artif. Intell..

[10]  Nitin,et al.  Designing a Fault-tolerant Fully-Chained Combining Switches Multi-stage Interconnection Network with Disjoint Paths , 2011, The Journal of Supercomputing.

[11]  Kai Hwang,et al.  Computer architecture and parallel processing , 1984, McGraw-Hill Series in computer organization and architecture.

[12]  Hamid R. Arabnia,et al.  Arbitrary Rotation of Raster Images with SIMD Machine Architectures , 1987, Comput. Graph. Forum.

[13]  Bhabani P. Sinha,et al.  Multi-Mesh-an efficient topology for parallel processing , 1995, Proceedings of 9th International Parallel Processing Symposium.

[14]  Masahiro Sowa,et al.  Dual-execution mode processor architecture , 2008, The Journal of Supercomputing.

[15]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[16]  Prasanta K. Jana,et al.  Multi-mesh of trees with its parallel algorithms , 2004, J. Syst. Archit..

[17]  Michael Garland,et al.  Designing efficient sorting algorithms for manycore GPUs , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.