A linear algebra framework for automatic determination of optimal data layouts

A study was conducted to analyze a data layout optimization method for sequential and parallel computer programs based on the concept of hyperplanes from linear algebra. The technique automatically obtains appropriate memory layouts that can be determined by hyperplanes for referenced arrays. The premise that data transformations can maximize spatial locality for some arrays was also examined.