Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures
DOI10.1137/17M1121378zbMATH Open1391.65119MaRDI QIDQ3174760FDOQ3174760
Kerstin Küpper, Uwe Naumann, Felix Gremse
Publication date: 18 July 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Recommendations
- GPU-accelerated sparse matrix-matrix multiplication by iterative row merging
- Processor-efficient sparse matrix-vector multiplication
- Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
- Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments
- Cache-Oblivious Sparse Matrix–Vector Multiplication by Using Sparse Matrix Partitioning Methods
- Sparse Matrix Computations on Parallel Processor Arrays
algebraic multigridGPU-programmingsparse matrix-matrix multiplicationfluorescence-mediated tomographyGalerkin product
Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Numerical algorithms for specific classes of architectures (65Y10)
Cites Work
- ViennaCL-linear algebra library for multi- and many-core architectures
- The university of Florida sparse matrix collection
- Sparse matrix multiplication package (SMMP)
- GPU-Accelerated Sparse Matrix-Matrix Multiplication by Iterative Row Merging
- Gaussian elimination is not optimal
- Multiplying matrices faster than coppersmith-winograd
- More algorithms for all-pairs shortest paths in weighted graphs
- A Multigrid Tutorial, Second Edition
- Graph Clustering Via a Discrete Uncoupling Process
- Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
- Reducing communication costs for sparse matrix multiplication within algebraic multigrid
- Efficient transitive closure of sparse matrices over closed semirings
- Accumulating Jacobians as chained sparse matrix products
- Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments
- Optimizing sparse matrix-matrix multiplication for the GPU
- Exposing Fine-Grained Parallelism in Algebraic Multigrid Methods
- Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
Cited In (2)
Uses Software
This page was built for publication: Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174760)
