Parallel Tiled Code Generation with Loop Permutation within Tiles
Keywords:Optimizing compilers, tiling, loop permutation, transitive closure, dependence graph, code locality, automatic parallelization
AbstractAn approach of generation of tiled code with an arbitrary order of loops within tiles is presented. It is based on the transitive closure of the program dependence graph and derived via a combination of the Polyhedral and Iteration Space Slicing frameworks. The approach is explained by means of a working example. Details of an implementation of the approach in the TRACO compiler are outlined. Increasing tiled program performance due to loop permutation within tiles is illustrated on real-life programs from the NAS Parallel Benchmark suite. An analysis of speed-up and scalability of parallel tiled code with loop permutation is presented.
Download data is not yet available.
How to Cite
Palkowski, M., & Bielecki, W. (2018). Parallel Tiled Code Generation with Loop Permutation within Tiles. COMPUTING AND INFORMATICS, 36(6), 1261–1282. Retrieved from http://www.cai.sk/ojs/index.php/cai/article/view/2017_6_1261