Issue No. 02 - February (1996 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.485501
<p><b>Abstract</b>—The problem of compiler optimization of sparse codes is well known and no satisfactory solutions have been found yet. One of the major obstacles is formed by the fact that sparse programs explicitly deal with particular data structures selected for storing sparse matrices. This explicit data structure handling obscures the functionality of a code to such a degree that optimization of the code is prohibited, for instance, by the introduction of indirect addressing. The method presented in this paper delays data structure selection until the compile phase, thereby allowing the compiler to combine code optimization with explicit data structure selection. This method enables the compiler to generate efficient code for sparse computations. Moreover, the task of the programmer is greatly reduced in complexity.</p>
Data structure selection, data structure transformations, restructuring compilers, sparse matrix computations, program transformations.
A. J. Bik and H. A. Wijshoff, "Automatic Data Structure Selection and Transformation for Sparse Matrix Computations," in IEEE Transactions on Parallel & Distributed Systems, vol. 7, no. , pp. 109-126, 1996.