Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures
From MaRDI portal
Publication:3174760
DOI10.1137/17M1121378zbMath1391.65119MaRDI QIDQ3174760
Kerstin Küpper, Uwe Naumann, Felix Gremse
Publication date: 18 July 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
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)
Related Items (2)
Uses Software
Cites Work
- Accumulating Jacobians as chained sparse matrix products
- Sparse matrix multiplication package (SMMP)
- Efficient transitive closure of sparse matrices over closed semirings
- Gaussian elimination is not optimal
- Reducing Communication Costs for Sparse Matrix Multiplication within Algebraic Multigrid
- Optimizing Sparse Matrix—Matrix Multiplication for the GPU
- ViennaCL---Linear Algebra Library for Multi- and Many-Core Architectures
- Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication
- The university of Florida sparse matrix collection
- Exposing Fine-Grained Parallelism in Algebraic Multigrid Methods
- Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments
- GPU-Accelerated Sparse Matrix-Matrix Multiplication by Iterative Row Merging
- More algorithms for all-pairs shortest paths in weighted graphs
- Graph Clustering Via a Discrete Uncoupling Process
- Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
- A Multigrid Tutorial, Second Edition
- Multiplying matrices faster than coppersmith-winograd
This page was built for publication: Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures
