View in EDS HTML Full Text PDF Full Text

Insight into tiles generated by means of a correction technique.

Saved in:
Bibliographic Details
Title: Insight into tiles generated by means of a correction technique.
Authors: Bielecki, Wlodzimierz1, Skotnicki, Piotr1
Source: Journal of Supercomputing. May2019, Vol. 75 Issue 5, p2665-2690. 26p.
Subjects: Optimizing compilers, Tiling (Mathematics), Correction factors, Dimensional reduction algorithms, Graph algorithms
Abstract: Well-known techniques for tiled code generation are based on the polyhedral model and affine transformations. An alternative approach to generation of tiled code is to correct original rectangular tiles defined for a loop nest by means of the transitive closure of a dependence graph instead of deriving and applying affine transformations. In this paper, we present results of an analysis of basic features of tiles generated due to correction of original rectangular tiles. We introduce procedures which allow us to recognize such features as target tile type (fixed, varied, parametric), dimensionality, size (the number of statement instances within a tile), and loop nest tileability (the percentage of statement instances that can be tiled with rectangular tiles). We consider differences between those features of tiles generated by means of affine transformations and transitive closure. We also discuss results of experiments with PolyBench benchmarks and show how differences in tiles generated with the examined approach and affine transformations affect serial tiled code performance. [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
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 136224029
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Insight into tiles generated by means of a correction technique.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Bielecki%2C+Wlodzimierz%22">Bielecki, Wlodzimierz</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Skotnicki%2C+Piotr%22">Skotnicki, Piotr</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Supercomputing%22">Journal of Supercomputing</searchLink>. May2019, Vol. 75 Issue 5, p2665-2690. 26p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Optimizing+compilers%22">Optimizing compilers</searchLink><br /><searchLink fieldCode="DE" term="%22Tiling+%28Mathematics%29%22">Tiling (Mathematics)</searchLink><br /><searchLink fieldCode="DE" term="%22Correction+factors%22">Correction factors</searchLink><br /><searchLink fieldCode="DE" term="%22Dimensional+reduction+algorithms%22">Dimensional reduction algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+algorithms%22">Graph algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Well-known techniques for tiled code generation are based on the polyhedral model and affine transformations. An alternative approach to generation of tiled code is to correct original rectangular tiles defined for a loop nest by means of the transitive closure of a dependence graph instead of deriving and applying affine transformations. In this paper, we present results of an analysis of basic features of tiles generated due to correction of original rectangular tiles. We introduce procedures which allow us to recognize such features as target tile type (fixed, varied, parametric), dimensionality, size (the number of statement instances within a tile), and loop nest tileability (the percentage of statement instances that can be tiled with rectangular tiles). We consider differences between those features of tiles generated by means of affine transformations and transitive closure. We also discuss results of experiments with PolyBench benchmarks and show how differences in tiles generated with the examined approach and affine transformations affect serial tiled code performance. [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=136224029
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s11227-018-2678-x
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 26
        StartPage: 2665
    Subjects:
      – SubjectFull: Optimizing compilers
        Type: general
      – SubjectFull: Tiling (Mathematics)
        Type: general
      – SubjectFull: Correction factors
        Type: general
      – SubjectFull: Dimensional reduction algorithms
        Type: general
      – SubjectFull: Graph algorithms
        Type: general
    Titles:
      – TitleFull: Insight into tiles generated by means of a correction technique.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Bielecki, Wlodzimierz
      – PersonEntity:
          Name:
            NameFull: Skotnicki, Piotr
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 05
              Text: May2019
              Type: published
              Y: 2019
          Identifiers:
            – Type: issn-print
              Value: 09208542
          Numbering:
            – Type: volume
              Value: 75
            – Type: issue
              Value: 5
          Titles:
            – TitleFull: Journal of Supercomputing
              Type: main
ResultId 1