A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
A linear algebra framework for automatic determination of optimal data layouts
1999
IEEE Transactions on Parallel and Distributed Systems
This paper presents a data layout optimization technique for sequential and parallel programs based on the theory of hyperplanes from linear algebra. Given a program, our framework automatically determines suitable memory layouts that can be expressed by hyperplanes for each array that is referenced. We discuss the cases where data transformations are preferable to loop transformations and show that under certain conditions a loop nest can be optimized for perfect spatial locality by using data
doi:10.1109/71.752779
fatcat:m3pdemgp5banxeyqqzzndmfah4