A Cost Model For Integrated Restructuring Optimizations.
Bharat Chandramouli, Wilson C. Hsieh, John B. Carter, Sally A. McKee · 2003
Compilers must make choices between different optimizations; in this paper we present an analytic cost model that can be used to compare several compile-time optimizations for memory-intensive, matrix-based codes. These optimizations increase the spatial locality of references to improve cache hierarchy performance. Specifically, we consider loop transformations, array restructuring, and address remapping, as well as combinations thereof. Our cost model compares the effectiveness of these optimizations and provides a good basis for deciding which optimization to use.