A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Semi-Automatic Composition of Loop Transformations for Deep Parallelism and Memory Hierarchies
2006
International journal of parallel programming
Modern compilers are responsible for translating the idealistic operational semantics of the source program into a form that makes efficient use of a highly complex heterogeneous machine. Since optimization problems are associated with huge and unstructured search spaces, this combinational task is poorly achieved in general, resulting in weak scalability and disappointing sustained performance. We address this challenge by working on the program representation itself, using a semi-automatic
doi:10.1007/s10766-006-0012-3
fatcat:czrbuhejuzht5htht4idcisewe