Name
Abstract | ||
|---|---|---|
This paper applies unimodular transformations and tiling to improve the data locality of a loop nest. Due to data dependences and reuse information, not all loops will and can be tiled. Therefore, the approach proposed in this paper attempts to capture as much data reuse in the cache as possible while tiling as few loops as possible. By using cones to represent the data dependences and vector spaces to represent the reuse information in the program, a reuse-driven approach is presented to improve the data locality of the program. In the special case of a singly fully permutable loop nest, the data locality problem is formulated as an optimisation problem and solved optimally. In the general case, an algorithm is presented that attempts to construct the tiled loop nest in such a way that as much reuse as possible is carried in the innermost tiled loops. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1007/BFb0032681 | LCPC |
Keywords | Field | DocType |
reuse-driven tiling,data locality,vector space | Data structure,Loop nest optimization,Locality,Locality of reference,Cache,Computer science,Reuse,Parallel computing,Theoretical computer science,Optimizing compiler,Loop tiling | Conference |
ISBN | Citations | PageRank |
3-540-64472-5 | 18 | 1.08 |
References | Authors | |
18 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jingling Xue | 1 | 1627 | 124.20 |
| Chua-huang Huang | 2 | 281 | 35.34 |