| LCPC 2006 | START Conference Manager |
We propose a new iterative compilation approach for the generation of high performance codes with compilers. This approach is not application-dependant, compared to ATLAS. The idea is to separate the memory optimization phase from the computation optimization phase. The first step automatically finds all possible decompositions of the code into kernels. With datasets that fit into the cache and simplified memory accesses, these kernels are easier to optimize, either with the compiler, at source level, or with a dedicated code generator. The best decomposition is then found by a model-guided approach, performing on the source code the required memory optimizations.
Exploration of optimization sequences and their parameters is achieved with a meta-compilation language, X language. The first results on linear algebra codes show that the performance obtained reduce the gap with those of highly optimized hand-tuned codes.
| START Conference Manager (V2.53.1) |
| Maintainer: rrgerber@softconf.com |