View in EDS PDF Full Text

The UTFLA: uniformization of non-uniform iteration spaces in two-level perfect nested loops using SFLA.

Saved in:
Bibliographic Details
Title: The UTFLA: uniformization of non-uniform iteration spaces in two-level perfect nested loops using SFLA.
Authors: Mahjoub, Shabnam1 shabnam.mahjoub@yahoo.com, Vojoudi, Hakimeh1
Source: Journal of Supercomputing. Jun2016, Vol. 72 Issue 6, p2221-2234. 14p.
Subjects: Non-uniform memory access, Parallelizing compilers, Loops (Group theory), Computer software execution, Algorithms
Abstract: One of the factors increasing the execution time of computational programs is the loops, and parallelization of the loops is used to decrease this time. One of the steps of parallelizing compilers is uniformization of non-uniform loops in wavefront method which is considered as a NP-hard problem. In this paper, a new method has been presented to make uniform the non-uniform two-level perfect nested loops using the frog-leaping algorithm, called UTFLA, which is a combination of deterministic and stochastic methods, because the challenge most of loop paralleling methods, old or dynamic or new ones, face is the high algorithm execution time. UTFLA has been designed in a way to find the best results with the lowest amount of basic dependency cone size in the minimum possible time and gives more appropriate results in a more reasonable time compared to other methods. [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: 115560618
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: The UTFLA: uniformization of non-uniform iteration spaces in two-level perfect nested loops using SFLA.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Mahjoub%2C+Shabnam%22">Mahjoub, Shabnam</searchLink><relatesTo>1</relatesTo><i> shabnam.mahjoub@yahoo.com</i><br /><searchLink fieldCode="AR" term="%22Vojoudi%2C+Hakimeh%22">Vojoudi, Hakimeh</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Supercomputing%22">Journal of Supercomputing</searchLink>. Jun2016, Vol. 72 Issue 6, p2221-2234. 14p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Non-uniform+memory+access%22">Non-uniform memory access</searchLink><br /><searchLink fieldCode="DE" term="%22Parallelizing+compilers%22">Parallelizing compilers</searchLink><br /><searchLink fieldCode="DE" term="%22Loops+%28Group+theory%29%22">Loops (Group theory)</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+software+execution%22">Computer software execution</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: One of the factors increasing the execution time of computational programs is the loops, and parallelization of the loops is used to decrease this time. One of the steps of parallelizing compilers is uniformization of non-uniform loops in wavefront method which is considered as a NP-hard problem. In this paper, a new method has been presented to make uniform the non-uniform two-level perfect nested loops using the frog-leaping algorithm, called UTFLA, which is a combination of deterministic and stochastic methods, because the challenge most of loop paralleling methods, old or dynamic or new ones, face is the high algorithm execution time. UTFLA has been designed in a way to find the best results with the lowest amount of basic dependency cone size in the minimum possible time and gives more appropriate results in a more reasonable time compared to other methods. [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=115560618
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s11227-016-1725-8
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 14
        StartPage: 2221
    Subjects:
      – SubjectFull: Non-uniform memory access
        Type: general
      – SubjectFull: Parallelizing compilers
        Type: general
      – SubjectFull: Loops (Group theory)
        Type: general
      – SubjectFull: Computer software execution
        Type: general
      – SubjectFull: Algorithms
        Type: general
    Titles:
      – TitleFull: The UTFLA: uniformization of non-uniform iteration spaces in two-level perfect nested loops using SFLA.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Mahjoub, Shabnam
      – PersonEntity:
          Name:
            NameFull: Vojoudi, Hakimeh
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 06
              Text: Jun2016
              Type: published
              Y: 2016
          Identifiers:
            – Type: issn-print
              Value: 09208542
          Numbering:
            – Type: volume
              Value: 72
            – Type: issue
              Value: 6
          Titles:
            – TitleFull: Journal of Supercomputing
              Type: main
ResultId 1