Parallelization for Multi-dimensional Loops with Non-uniform Dependences.

Saved in:
Bibliographic Details
Title: Parallelization for Multi-dimensional Loops with Non-uniform Dependences.
Authors: Sam-Jin Jeong1 sjjeong@bu.ac.kr
Source: IAENG International Journal of Computer Science. Feb2018, Vol. 45 Issue 1, p107-111. 5p.
Subjects: Loops (Group theory), Parallelizing compilers, Software engineers, Integers, Parallel algorithms
Abstract: This paper presents two enhanced partitioning algorithms in order to improve parallelization of multidimensional loops with flow and anti-dependences Using distance of the first dependence, we show the first general enhanced algorithm of single-loops with both flow and anti-dependences. Using the first algorithm, loop interchanging method, and cycle shrinking method, we present parallelization of nested loops with simple subscripts. Using the second algorithm, we also present parallelization to multi-dimensional loops with both flow and anti-dependences. Our two presented algorithms show enhanced loop parallelization of multi-dimensional loops with both dependences. We will improve our proposed algorithms for multi-dimensional space with multiple dependences. [ABSTRACT FROM AUTHOR]
Copyright of IAENG International Journal of Computer Science is the property of International Association of Engineers (IAENG) 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: 128228811
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Parallelization for Multi-dimensional Loops with Non-uniform Dependences.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Sam-Jin+Jeong%22">Sam-Jin Jeong</searchLink><relatesTo>1</relatesTo><i> sjjeong@bu.ac.kr</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22IAENG+International+Journal+of+Computer+Science%22">IAENG International Journal of Computer Science</searchLink>. Feb2018, Vol. 45 Issue 1, p107-111. 5p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Loops+%28Group+theory%29%22">Loops (Group theory)</searchLink><br /><searchLink fieldCode="DE" term="%22Parallelizing+compilers%22">Parallelizing compilers</searchLink><br /><searchLink fieldCode="DE" term="%22Software+engineers%22">Software engineers</searchLink><br /><searchLink fieldCode="DE" term="%22Integers%22">Integers</searchLink><br /><searchLink fieldCode="DE" term="%22Parallel+algorithms%22">Parallel algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper presents two enhanced partitioning algorithms in order to improve parallelization of multidimensional loops with flow and anti-dependences Using distance of the first dependence, we show the first general enhanced algorithm of single-loops with both flow and anti-dependences. Using the first algorithm, loop interchanging method, and cycle shrinking method, we present parallelization of nested loops with simple subscripts. Using the second algorithm, we also present parallelization to multi-dimensional loops with both flow and anti-dependences. Our two presented algorithms show enhanced loop parallelization of multi-dimensional loops with both dependences. We will improve our proposed algorithms for multi-dimensional space with multiple dependences. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of IAENG International Journal of Computer Science is the property of International Association of Engineers (IAENG) 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=128228811
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 5
        StartPage: 107
    Subjects:
      – SubjectFull: Loops (Group theory)
        Type: general
      – SubjectFull: Parallelizing compilers
        Type: general
      – SubjectFull: Software engineers
        Type: general
      – SubjectFull: Integers
        Type: general
      – SubjectFull: Parallel algorithms
        Type: general
    Titles:
      – TitleFull: Parallelization for Multi-dimensional Loops with Non-uniform Dependences.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Sam-Jin Jeong
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 02
              Text: Feb2018
              Type: published
              Y: 2018
          Identifiers:
            – Type: issn-print
              Value: 1819656X
          Numbering:
            – Type: volume
              Value: 45
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: IAENG International Journal of Computer Science
              Type: main
ResultId 1