Abstract
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=n 4 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(N 1/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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Jana PK (2003) Multi-Mesh of Trees with its parallel algorithms. J Syst Archit, 193–206
De M, Das D, Ghosh M, Sinha BP (1997) An efficient sorting algorithm on multi-mesh. IEEE Trans Comput 46(10):1132–1137
Das D, Sinha BP (1995) Multi-mesh an efficient topology for parallel processing. In: Proceeding of the ninth international parallel processing symposium, 1995, pp 17–21
Das D, De M, Sinha BP (1999) A new network topology with multiple mesh. IEEE Trans Comput 48(5):536–551
Scherson ID, Sen S (1989) Parallel sorting algorithm in two-dimensional VLSI models of computation. IEEE Trans Comput 38(2):238–249
Preparata F (1978) New parallel sorting schemes. IEEE Trans Comput 27(7):669–673
Knuth DE (1973) The art of computer programming, sorting and searching, vol 3. Addison-Wesley, Reading
Akl SG, Santoro N (1987) Optimal parallel merging and sorting without memory conflicts. IEEE Trans Comput 36(11):1367–1369
Hwang K, Briggs FA (1989) Computer architecture and parallel processing. McGraw-Hill, New York
Arabnia HR, Oliver MA (1987) Arbitrary rotation of raster images with SIMD machine architectures. Int J Eurograph Assoc (Comput Graph Forum) 6(1):3–12
Bhandarkar SM, Arabnia HR, Smith JW (1995) A reconfigurable architecture for image processing and computer vision. Int J Pattern Recognit Artif Intell (IJPRAI) 9(2):201–229 (special issue on VLSI Algorithms and architectures for computer vision, image processing, pattern recognition and AI)
Bhandarkar SM, Arabnia HR (1995) The hough transform on a reconfigurable multi-ring network. J Parallel Distrib Comput 24(1):107–114
Arif Wani M, Arabnia HR (2003) Parallel edge-region-based segmentation algorithm targeted at reconfigurable multi-ring network. J Supercomput 25(1):43–63
Satish N, Harris M, Garland M (2009) Designing efficient sorting algorithms for manycore GPUs. In: IEEE international symposium on parallel & distributed processing, 2009, pp 1–10
Xie H, Xue Y (2008) An improved parallel sorting algorithm for odd sequence. In: International conference on advanced computer theory and engineering, 2008, pp 356–360
Nitin, Garhwal S, Srivastava N (2009) Designing a fault-tolerant fully-chained combining switches multi-stage interconnection network with disjoint paths. J Supercomput. doi:10.1007/s11227-009-0336-z
Akanda MdM, Abderazek BA, Sowa M (2008) Dual-execution mode processor architecture. J Supercomput 44(2):103–125
Author information
Authors and Affiliations
Corresponding author
Additional information
N. Rakesh, Member, IEEE.
Nitin, Senior Member, IACSIT and Member, SIAM and IEEE.
Rights and permissions
About this article
Cite this article
Rakesh, N., Nitin Analysis of Multi-Sort Algorithm on Multi-Mesh of Trees (MMT) architecture. J Supercomput 57, 276–313 (2011). https://doi.org/10.1007/s11227-010-0404-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-010-0404-4