When cache blocking of sparse matrix vector multiply works and why
From MaRDI portal
Publication:2642897
Recommendations
- Parallel Processing and Applied Mathematics
- Modeling and improving locality for the sparse-matrix–vector product on cache memories
- Cache-Oblivious Sparse Matrix–Vector Multiplication by Using Sparse Matrix Partitioning Methods
- Hypergraph partitioning based models and methods for exploiting cache locality in sparse matrix-vector multiplication
- Numerical Analysis and Its Applications
Cited in
(11)- Parallel Processing and Applied Mathematics
- Cache blocking strategies applied to flux reconstruction
- Cache optimization and performance modeling of batched, small, and rectangular matrix multiplication on Intel, AMD, and Fujitsu processors
- A Cache-Oblivious Sparse Matrix–Vector Multiplication Scheme Based on the Hilbert Curve
- Communication lower bounds and optimal algorithms for numerical linear algebra
- 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
- Parallel Processing and Applied Mathematics
- Modeling and improving locality for the sparse-matrix–vector product on cache memories
- Numerical Analysis and Its Applications
- Parallel symmetric sparse matrix-vector product on scalar multi-core CPUs
This page was built for publication: When cache blocking of sparse matrix vector multiply works and why
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642897)