2012.84: Efficient sparse matrix multiple-vector multiplication using a bitmapped format
2012.84: Ramaseshan Kannan (2012) Efficient sparse matrix multiple-vector multiplication using a bitmapped format.
Full text available as:
|PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader|
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 2000 > 15 Linear and multilinear algebra; matrix theory|
MSC 2000 > 65 Numerical analysis
|Deposited By:||Ramaseshan Kannan|
|Deposited On:||21 September 2012|