Improving the Performance of Multithreaded Sparse Matrix-Vector Multiplication Using Index and Value Compression

Abstract—The Sparse Matrix-Vector Multiplication kernel exhibits limited potential for taking advantage of modern shared memory architectures due to its large memory bandwidth requirements. To decrease memory contention and improve the performance of the kernel we propose two compression schemes. The first, called CSR-DU, targets the reduction of the matrix structural data by applying coarse grain delta encoding for the column indices. The second scheme, called CSR-VI, targets the reduction of the numerical values using indirect indexing and can only be applied to matrices which contain a small number of unique values. Evaluation of both methods on a rich matrix set showed that they can significantly improve the performance of the multithreaded version of the kernel and achieve good scalability for large matrices.

• Type: Conference
• Year: 2008
• Where: ICPP
• Authors: Kornilios Kourtis, Georgios I. Goumas, Nectarios Koziris
• Keywords: Distributed And Parallel Computing, ICPP 2008, Large Memory Bandwidth, Matrix-Vector Multiplication Kernel, Modern Shared Memory