View in EDS PDF Full Text

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, Nitin1 nitin.rakesh@juit.ac.in, Nitin1 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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 63540810
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Analysis of Multi-Sort Algorithm on Multi-Mesh of Trees (MMT) architecture.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Rakesh%2C+Nitin%22">Rakesh, Nitin</searchLink><relatesTo>1</relatesTo><i> nitin.rakesh@juit.ac.in</i><br /><searchLink fieldCode="AR" term="%22Nitin%22">Nitin</searchLink><relatesTo>1</relatesTo><i> delnitin@ufl.edu</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Supercomputing%22">Journal of Supercomputing</searchLink>. Sep2011, Vol. 57 Issue 3, p276-313. 38p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Parallel+algorithms%22">Parallel algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22List+processing+%28Electronic+computers%29%22">List processing (Electronic computers)</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+complexity%22">Computational complexity</searchLink><br /><searchLink fieldCode="DE" term="%22Numerical+grid+generation+%28Numerical+analysis%29%22">Numerical grid generation (Numerical analysis)</searchLink><br /><searchLink fieldCode="DE" term="%22Computers+in+architecture%22">Computers in architecture</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=63540810
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s11227-010-0404-4
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 38
        StartPage: 276
    Subjects:
      – SubjectFull: Parallel algorithms
        Type: general
      – SubjectFull: List processing (Electronic computers)
        Type: general
      – SubjectFull: Computational complexity
        Type: general
      – SubjectFull: Numerical grid generation (Numerical analysis)
        Type: general
      – SubjectFull: Computers in architecture
        Type: general
    Titles:
      – TitleFull: Analysis of Multi-Sort Algorithm on Multi-Mesh of Trees (MMT) architecture.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Rakesh, Nitin
      – PersonEntity:
          Name:
            NameFull: Nitin
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 09
              Text: Sep2011
              Type: published
              Y: 2011
          Identifiers:
            – Type: issn-print
              Value: 09208542
          Numbering:
            – Type: volume
              Value: 57
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: Journal of Supercomputing
              Type: main
ResultId 1