Dense-Sparse Matrix Multiplication : Algorithms and Performance Evaluation

@inproceedings{Ezouaoui2014DenseSparseMM,
title={Dense-Sparse Matrix Multiplication : Algorithms and Performance Evaluation},
author={Sana Ezouaoui and Olfa Hamdi-Larbi and Z. Mahjoub},
year={2014}
}

. In this paper, we address the dense-sparse matrix product (DSMP) problem i.e. where the first matrix is dense and the second is sparse. We first present initial versions of loop nest structured algorithms corresponding to the most used sparse matrix storing formats i.e. DNS, CSR, CSC and COO. Afterwards, we derive several versions obtained by applying loop interchange techniques, loop invariant motion and loop unrolling on the previous loop nest algorithms. Theoretical multifold comparisons… CONTINUE READING

Mendili & S. Selmi, “Performance evaluation of algorithms for sparse-dense matrix product”, Proceedings of the International MultiConference of Engineers and Computer Scientists 2013, pp. 257-262, Kowloon, Hong Kong • 2013

View 8 Excerpts

Z

F. Ben Charrada, S. Ezouaoui

Mahjoub, “Greedy algorithms for optimal computing of matrix chain products involving square dense and triangular matrices”, RAIRO - OR, vol. 45, N. 1, 1-16 • 2011