When cache blocking of sparse matrix vector multiply works and why

DOI10.1007/s00200-007-0038-9zbMath1122.65043OpenAlexW2162630236MaRDI QIDQ2642897

Rajesh Nishtala, James W. Demmel, Richard Vuduc, Katherine A. Yelick

Publication date: 6 September 2007

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-007-0038-9

zbMATH Keywords

numerical examplesperformance optimizationmatrix-vector multiplicationperformance modelingmemory hierarchiessparse matrix multiplication

Mathematics Subject Classification ID

Related Items (6)

A Cache-Oblivious Sparse Matrix–Vector Multiplication Scheme Based on the Hilbert Curve ⋮ When cache blocking of sparse matrix vector multiply works and why ⋮ Estimating the effect of indices compression in the CSR-like data storage formats for matrix-vector multiplications and solving linear systems ⋮ Cache blocking strategies applied to flux reconstruction ⋮ Communication lower bounds and optimal algorithms for numerical linear algebra ⋮ Parallel symmetric sparse matrix-vector product on scalar multi-core CPUs

Uses Software

• ATLAS
• ITSOL
• PHiPAC
• PAPI
• OSKI
• SPARSKIT

Cites Work

• When cache blocking of sparse matrix vector multiply works and why

This page was built for publication: When cache blocking of sparse matrix vector multiply works and why