Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY

@inproceedings{Im2001OptimizingSM,
title={Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY},
author={Eun-Jin Im and Katherine A. Yelick},
booktitle={International Conference on Computational Science},
year={2001}
}

Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory operations to arithmetic operations. Optimizing this algorithm is difficult, both because of the complexity of memory systems and because the performance is highly dependent on the nonzero structure of the matrix. The Sparsity system is designed to address these problem by allowing users to automatically build sparse matrix… CONTINUE READING