Efficient sparse matrixvector multiplication using cache oblivious extension quadtree storage format
A cache oblivious extension quadtree storage structure (COEQT C O E Q T ) is proposed. Present the converting algorithm from CSR C S R storage format to the COEQT C O E Q T storage format. Implement the sparse matrixvector multiplication algorithm based on the COEQT C O E Q T . Optimize the performance of the implemented algorithm through manual vectorization. Implement the parallel sparse matrixvector multiplication in distributed system.
sparse matrixvector multiplication cache oblivious extension quadtree sparse matrix storage data locality distributed parallelism