Reduced-Bandwidth Multithreaded Algorithms for Sparse Matrix-Vector Multiplication
Authors:
- Aydin BuluçABAydin Buluç
- Samuel WilliamsSWSamuel Williams
- Leonid OlikerLOLeonid Oliker
- James DemmelJDJames Demmel
- 1 May 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 721-733
Abstract
No abstract availableThis publication has 24 references indexed in Scilit:
- On BLAS Operations with Recursively Stored Sparse Matrices2010
- Parallel symmetric sparse matrix–vector product on scalar multi-core CPUsParallel Computing, 2010
- Memory-efficient optimization of Gyrokinetic particle-to-grid interpolation for multicore processors2009
- RooflineCommunications of the ACM, 2009
- Optimization of sparse matrix–vector multiplication on emerging multicore platformsParallel Computing, 2009
- Cache-Oblivious Sparse Matrix–Vector Multiplication by Using Sparse Matrix Partitioning MethodsSIAM Journal on Scientific Computing, 2009
- Accelerating sparse matrix computations via data compression2006
- Sparsity: Optimization Framework for Sparse Matrix KernelsThe International Journal of High Performance Computing Applications, 2004
- Performance models for evaluation and automatic tuning of symmetric sparse matrix-vector multiply2004
- Towards a fast parallel sparse symmetric matrix–vector multiplicationParallel Computing, 2001