Compilation Techniques for Sparse Matrix Computations


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 deal explicitly with the particular data structures selected for storing sparse matrices. This explicit data structure handling obscures the functionality of a code to… (More)
DOI: 10.1145/165939.166023


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.


Citations per Year

53 Citations

Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics