Issue No. 08 - August (2001 vol. 50)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.947000
<p><b>Abstract</b>—We present an abstraction, called data relation vectors, to improve the data access characteristics and memory layouts in regular computations. The key idea is to define a relation between the data elements accessed by close-by iterations and use this relation to guide to a number of optimizations for array-based computations. The specific optimizations studied in this paper include enhancing group-spatial and self-spatial reuses and improving intratile and intertile data reuses. In addition, this abstraction works well with other known abstractions such as data reuse vectors. We also present a unified scheme for optimizing the memory performance of programs using this new abstraction in conjunction with reuse vectors. The data relation vector abstraction has been implemented in the SUIF compilation framework and has been tested using a set of 12 benchmarks from image processing and scientific computation domains. Preliminary results on a superscalar processor show that it is successful in reducing compilation time and outperforms two previously proposed techniques, one that uses only loop transformations and one that uses both loop and data transformations. Our experiments also show that the proposed abstraction helps one to select good data tile shapes which can subsequently be used to determine iteration space tiles.</p>
Data reuse, cache locality, compiler optimizations for memory hierarchy, reuse vectors, data relation vectors, loop transformations, memory layouts.
J. Ramanujam and M. Kandemir, "Data Relation Vectors: A New Abstraction for Data Optimizations," in IEEE Transactions on Computers, vol. 50, no. , pp. 798-810, 2001.