Efficient sparse matrix multiple-vector multiplication using a bitmapped format

Kannan, Ramaseshan (2012) Efficient sparse matrix multiple-vector multiplication using a bitmapped format. [MIMS Preprint]

PDF rkannan_spmm.pdf Download (458kB)

Abstract

The problem of obtaining high computational throughput from sparse matrix multiple--vector multiplication routines is considered. Current sparse matrix formats and algorithms have high bandwidth requirements and poor reuse of cache and register loaded entries, which restrict their performance. We propose the mapped blocked row format: a bitmapped sparse matrix format that stores entries as blocks without a fill overhead, thereby offering blocking without additional storage and bandwidth overheads. An efficient algorithm decodes bitmaps using de Bruijn sequences and minimizes the number of conditionals evaluated. Performance is compared with that of popular formats, including vendor implementations of sparse BLAS. Our sparse matrix multiple-vector multiplication algorithm achieves high throughput on all platforms and is implemented using platform neutral optimizations.

Item Type:	MIMS Preprint
Uncontrolled Keywords:	Sparse matrix vector mutiplication, de Bruijn sequence, communication reduction, blocked sparse formats
Subjects:	MSC 2010, the AMS's Mathematics Subject Classification > 15 Linear and multilinear algebra; matrix theory MSC 2010, the AMS's Mathematics Subject Classification > 65 Numerical analysis
Depositing User:	Ramaseshan Kannan
Date Deposited:	21 Sep 2012
Last Modified:	08 Nov 2017 18:18
URI:	https://eprints.maths.manchester.ac.uk/id/eprint/1872

Actions (login required)

View Item