| Autor: |
Iooss, Guillaume, Alias, Christophe, Rajopadhye, Sanjay |
| Přispěvatelé: |
Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), CASH - Compilation and Analysis, Software and Hardware (CASH), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon), Department of Computer Science [Colorado], Colorado State University [Fort Collins] (CSU), INRIA Grenoble - Rhone-Alpes |
| Jazyk: |
angličtina |
| Rok vydání: |
2018 |
| Předmět: |
|
| Zdroj: |
[Research Report] RR-9233, INRIA Grenoble-Rhone-Alpes. 2018, pp.1-28 |
| Popis: |
Tiling is a crucial program transformation, adjusting the ops-to-bytes balance of codes to improvelocality. Like parallelism, it can be applied at multiple levels. Allowing tile sizes to be symbolicparameters at compile time has many benefits, including ecient autotuning, and run-time adaptability tosystem variations. For polyhedral programs, parametric tiling in its full generality is known to be non-linear,breaking the mathematical closure properties of the polyhedral model. Most compilation tools thereforeeither perform fixed size tiling, or apply parametric tiling in only the final, code generation step. We introducemonoparametric tiling, a restricted parametric tiling transformation. We show that, despite beingparametric, it retains the closure properties of the polyhedral model. We first prove that applying monoparametricpartitioning (i) to a polyhedron yields a union of polyhedra, and (ii) to an ane function produces apiecewise-ane function. We then use these properties to show how to tile an entire polyhedral program.Our monoparametric tiling is general enough to handle tiles with arbitrary tile shapes that can tesselate theiteration space (e.g., hexagonal, trapezoidal, etc). This enables a wide range of polyhedral analyses andtransformations to be applied. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
