View in EDS PDF Full Text

Generation of Efficient Nested Loops from Polyhedra.

Saved in:
Bibliographic Details
Title: Generation of Efficient Nested Loops from Polyhedra.
Authors: Quilleré, Fabien1, Rajopadhye, Sanjay1, Wilde, Doran2
Source: International Journal of Parallel Programming. Oct2000, Vol. 28 Issue 5, p469-498. 30p.
Subjects: Polyhedra models, Geometric modeling, Code generators, Coding theory, Program generators (Computer programs), Parallel programming, Computer programming, Algorithms
Abstract: Automatic parallelization in the polyhedral model is based on affine transformations from an original computation domain (iteration space) to a target space-time domain, often with a different transformation for each variable. Code generation is an often ignored step in this process that has a significant impact on the quality of the final code. It involves making a trade-off between code size and control code simplification/optimization. Previous methods of doing code generation are based on loop splitting, however they have nonoptimal behavior when working on parameterized programs. We present a general parameterized method for code generation based on dual representation of polyhedra. Our algorithm uses a simple recursion on the dimensions of the domains, and enables fine control over the tradeoff between code size and control overhead. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Parallel Programming 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: 17143262
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Generation of Efficient Nested Loops from Polyhedra.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Quilleré%2C+Fabien%22">Quilleré, Fabien</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Rajopadhye%2C+Sanjay%22">Rajopadhye, Sanjay</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Wilde%2C+Doran%22">Wilde, Doran</searchLink><relatesTo>2</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Parallel+Programming%22">International Journal of Parallel Programming</searchLink>. Oct2000, Vol. 28 Issue 5, p469-498. 30p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Polyhedra+models%22">Polyhedra models</searchLink><br /><searchLink fieldCode="DE" term="%22Geometric+modeling%22">Geometric modeling</searchLink><br /><searchLink fieldCode="DE" term="%22Code+generators%22">Code generators</searchLink><br /><searchLink fieldCode="DE" term="%22Coding+theory%22">Coding theory</searchLink><br /><searchLink fieldCode="DE" term="%22Program+generators+%28Computer+programs%29%22">Program generators (Computer programs)</searchLink><br /><searchLink fieldCode="DE" term="%22Parallel+programming%22">Parallel programming</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programming%22">Computer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Automatic parallelization in the polyhedral model is based on affine transformations from an original computation domain (iteration space) to a target space-time domain, often with a different transformation for each variable. Code generation is an often ignored step in this process that has a significant impact on the quality of the final code. It involves making a trade-off between code size and control code simplification/optimization. Previous methods of doing code generation are based on loop splitting, however they have nonoptimal behavior when working on parameterized programs. We present a general parameterized method for code generation based on dual representation of polyhedra. Our algorithm uses a simple recursion on the dimensions of the domains, and enables fine control over the tradeoff between code size and control overhead. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of International Journal of Parallel Programming 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=17143262
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1023/a:1007554627716
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 30
        StartPage: 469
    Subjects:
      – SubjectFull: Polyhedra models
        Type: general
      – SubjectFull: Geometric modeling
        Type: general
      – SubjectFull: Code generators
        Type: general
      – SubjectFull: Coding theory
        Type: general
      – SubjectFull: Program generators (Computer programs)
        Type: general
      – SubjectFull: Parallel programming
        Type: general
      – SubjectFull: Computer programming
        Type: general
      – SubjectFull: Algorithms
        Type: general
    Titles:
      – TitleFull: Generation of Efficient Nested Loops from Polyhedra.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Quilleré, Fabien
      – PersonEntity:
          Name:
            NameFull: Rajopadhye, Sanjay
      – PersonEntity:
          Name:
            NameFull: Wilde, Doran
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 10
              Text: Oct2000
              Type: published
              Y: 2000
          Identifiers:
            – Type: issn-print
              Value: 08857458
          Numbering:
            – Type: volume
              Value: 28
            – Type: issue
              Value: 5
          Titles:
            – TitleFull: International Journal of Parallel Programming
              Type: main
ResultId 1