Optimization of sparse matrix–vector multiplication using reordering techniques on GPUs
- 1 March 2012
- journal article
- Published by Elsevier in Microprocessors and Microsystems
- Vol. 36 (2) , 65-77
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Model-driven autotuning of sparse matrix-vector multiply on GPUs2010
- Implementing sparse matrix-vector multiplication on throughput-oriented processors2009
- Pattern-based sparse matrix representation for memory-efficient SMVM kernels2009
- A Comparative Study of Blocking Storage Methods for Sparse Matrices on Multicore Architectures2009
- Performance Optimization and Modeling of Blocked Sparse KernelsThe International Journal of High Performance Computing Applications, 2007
- Performance comparison of data-reordering algorithms for sparse matrix–vector multiplication in edge-based unstructured grid computationsInternational Journal for Numerical Methods in Engineering, 2006
- Sparse matrix solvers on the GPU2005
- Sparsity: Optimization Framework for Sparse Matrix KernelsThe International Journal of High Performance Computing Applications, 2004
- MEMORY HIERARCHY PERFORMANCE PREDICTION FOR BLOCKED SPARSE ALGORITHMSParallel Processing Letters, 1999
- An Approximate Minimum Degree Ordering AlgorithmSIAM Journal on Matrix Analysis and Applications, 1996