A methodology pruning the search space of six compiler transformations by addressing them together as one problem and by exploiting the hardware architecture details (Q1700863)
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: A methodology pruning the search space of six compiler transformations by addressing them together as one problem and by exploiting the hardware architecture details |
scientific article; zbMATH DE number 6841916
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A methodology pruning the search space of six compiler transformations by addressing them together as one problem and by exploiting the hardware architecture details |
scientific article; zbMATH DE number 6841916 |
Statements
A methodology pruning the search space of six compiler transformations by addressing them together as one problem and by exploiting the hardware architecture details (English)
0 references
22 February 2018
0 references
loop unroll
0 references
loop tiling
0 references
scalar replacement
0 references
register allocation
0 references
data reuse
0 references
cache
0 references
loop transformations
0 references
iterative compilation
0 references
0 references
0.7749964594841003
0 references
0.7487401962280273
0 references
0.7437490820884705
0 references
0.7403673529624939
0 references
