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
.
An efficient code generation technique for tiled iteration spaces
2003
IEEE Transactions on Parallel and Distributed Systems
This paper presents a novel approach for the problem of generating tiled code for nested for-loops, transformed by a tiling transformation. Tiling or supernode transformation has been widely used to improve locality in multi-level memory hierarchies, as well as to efficiently execute loops onto parallel architectures. However, automatic code generation for tiled loops can be a very complex compiler work, especially when non-rectangular tile shapes and iteration space bounds are concerned. Our
doi:10.1109/tpds.2003.1239870
fatcat:f27dpcjqhfgqpefnb4kd5w3x3e