Register-Aware Optimizations for Parallel Sparse Matrix–Matrix Multiplication
- 1 January 2019
- journal article
- research article
- Published by Springer Nature in International Journal of Parallel Programming
- Vol. 47 (3) , 403-417
Abstract
No abstract availableKeywords
Funding Information
- National Key Research and Development Program of China (2016YFB0201305, 2016YFB0200803)
- National Key Research and Development Program of China (2016YFB0200300)
- National Natural Science Foundation of China (61521092, 91430218)
- National Natural Science Foundation of China (31327901, 61472395)
- National Natural Science Foundation of China (61432018)
- European Union’s Horizon 2020 Research and Innovation Programme (752321)
- National Key Research and Development Program of China (2017YFB0202105)
This publication has 41 references indexed in Scilit:
- Speculative segmented sum for sparse matrix-vector multiplication on heterogeneous processorsParallel Computing, 2015
- CSR52015
- GPU-Accelerated Sparse Matrix-Matrix Multiplication by Iterative Row MergingSIAM Journal on Scientific Computing, 2015
- Kokkos: Enabling manycore performance portability through polymorphic memory access patternsJournal of Parallel and Distributed Computing, 2014
- Exposing Fine-Grained Parallelism in Algebraic Multigrid MethodsSIAM Journal on Scientific Computing, 2012
- Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and ExperimentsSIAM Journal on Scientific Computing, 2012
- R-Kleene: A High-Performance Divide-and-Conquer Algorithm for the All-Pair Shortest Path for Densely Connected NetworksAlgorithmica, 2007
- Fast sparse matrix multiplicationACM Transactions on Algorithms, 2005
- Sparse Matrices in MATLAB: Design and ImplementationSIAM Journal on Matrix Analysis and Applications, 1992
- Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted TranspositionACM Transactions on Mathematical Software, 1978