Pattern-based sparse matrix representation for memory-efficient SMVM kernels

  • Authors:

  • Mehmet Belgin;Godmar Back;Calvin J. Ribbens

  • Affiliations:

  • Virginia Polytechnic Institute and State University, Blacksburg, VA, USA;Virginia Polytechnic Institute and State University, Blacksburg, VA, USA;Virginia Polytechnic Institute and State University, Blacksburg, VA, USA

  • Venue:
  • Proceedings of the 23rd international conference on Supercomputing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Pattern-based Representation (PBR) is a novel approach to improving the performance of Sparse Matrix-Vector Multiply (SMVM) numerical kernels. Motivated by our observation that many matrices can be divided into blocks that share a small number of distinct patterns, we generate custom multiplication kernels for frequently recurring block patterns. The resulting reduction in index overhead significantly reduces memory bandwidth requirements and improves performance. Unlike existing methods, PBR requires neither detection of dense blocks nor zero filling, making it particularly advantageous for matrices that lack dense nonzero concentrations. SMVM kernels for PBR can benefit from explicit prefetching and vectorization, and are amenable to parallelization. We present sequential and parallel performance results for PBR on two current multicore architectures, which show that PBR outperforms available alternatives for the matrices to which it is applicable.