Abstract
We present a relational algebra based framework for compiling efficient sparse matrix code from dense DO-ANY loops and a specification of the representation of the sparse matrix. We present experimental data that demonstrates that the code generated by our compiler achieves performance competitive with that of hand-written codes for important computational kernels.
Cite
CITATION STYLE
Kotlyax, V., Pingali, K., & Stodghill, P. (1997). A relational approach to the compilation of sparse matrix programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1300 LNCS, pp. 318–327). https://doi.org/10.1007/bfb0002751
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
