Two-dimensional cache-oblivious sparse matrix–vector multiplication

► Extended a one-dimensional cache-oblivious sparse matrix–vector multiplication scheme to two dimensions. ► Introduced the doubly separated block diagonal (DSBD) form for sparse matrices. ► Introduced a family of recursive sparse blocking schemes for matrices in DSBD form. ► Obtained speedups in sp...

Full description

Saved in:

Bibliographic Details
Published in:	Parallel computing Vol. 37; no. 12; pp. 806 - 819
Main Authors:	Yzelman, A.N., Bisseling, Rob H.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.12.2011
Subjects:	Blocking Cache-oblivious Computation Data structures Fine-grain Gain Matrix–vector multiplication Multiplication Parallel computing Parallel processing Partitioning Recursive bipartitioning Sparse matrix Two dimensional Sparse matrix Parallel computing Cache-oblivious Recursive bipartitioning Matrix–vector multiplication Fine-grain
ISSN:	0167-8191, 1872-7336
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!