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

Saved in:

Bibliographic Details
Title:	Analysis of Multi-Sort Algorithm on Multi-Mesh of Trees (MMT) architecture.
Authors:	Rakesh, Nitin¹ nitin.rakesh@juit.ac.in, Nitin¹ delnitin@ufl.edu
Source:	Journal of Supercomputing. Sep2011, Vol. 57 Issue 3, p276-313. 38p.
Subjects:	Parallel algorithms, List processing (Electronic computers), Computational complexity, Numerical grid generation (Numerical analysis), Computers in architecture
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 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) 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. [ABSTRACT FROM AUTHOR]
	Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
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 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) 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. [ABSTRACT FROM AUTHOR]
ISSN:	09208542
DOI:	10.1007/s11227-010-0404-4