Sparse Matrix Multiplication

quickly computing sparse matrix multiplications

For this project we focus on computing sparse matrix multiplications. We focus on shared-memory systems. The approach we take is to provide a new, summary matrix that indicates the sparsity pattern of the full matrix. By first using the summary matrix we provide performance improvements that result in the best known matrix multiplication runtime.