Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs (Q511402)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs |
scientific article; zbMATH DE number 6684777
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs |
scientific article; zbMATH DE number 6684777 |
Statements
Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs (English)
0 references
15 February 2017
0 references
tiling
0 references
transitive closure
0 references
source-to-source compiler
0 references
polyhedral model
0 references
iteration space slicing
0 references
0 references
0 references
0 references
0.8467787
0 references
0.84232676
0 references
0 references
0 references
0 references
0 references
