Optimizing sparse matrix-matrix multiplication for the GPU
DOI10.1145/2699470zbMATH Open1347.65085OpenAlexW1980282429WikidataQ113310260 ScholiaQ113310260MaRDI QIDQ2828151FDOQ2828151
Steven Dalton, Luke Olson, Nathan Bell
Publication date: 24 October 2016
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2699470
Recommendations
- Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures
- A novel multi-GPU parallel optimization model for the sparse matrix-vector multiplication
- Sparse matrix-vector multiplication on GPGPUs
- Sparse matrix-vector multiplication on NVIDIA GPU
- GPU-accelerated sparse matrix-matrix multiplication by iterative row merging
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)
Cites Work
- The university of Florida sparse matrix collection
- Title not available (Why is that?)
- Sparse matrix multiplication package (SMMP)
- An overview of the Trilinos project
- Using Mixed Precision for Sparse Matrix Computations to Enhance the Performance while Achieving 64-bit Accuracy
- Maximum matchings in general graphs through randomization
- Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
- Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments
- Exposing Fine-Grained Parallelism in Algebraic Multigrid Methods
Cited In (14)
- On optimizing multiplications of sparse matrices
- Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs
- Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
- Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures
- A two-scale approach for efficient on-the-fly operator assembly in massively parallel high performance multigrid codes
- Randomized GPU Algorithms for the Construction of Hierarchical Matrices from Matrix-Vector Operations
- Efficient CSR-based sparse matrix-vector multiplication on GPU
- GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU
- Title not available (Why is that?)
- A Communication Optimization Scheme for Basis Computation of Krylov Subspace Methods on Multi-GPUs
- Reducing communication costs for sparse matrix multiplication within algebraic multigrid
- Redesigning triangular dense matrix computations on GPUs
- Achieving Native GPU Performance for Out-of-Card Large Dense Matrix Multiplication
- A New Class of AMG Interpolation Methods Based on Matrix-Matrix Multiplications
Uses Software
This page was built for publication: Optimizing sparse matrix-matrix multiplication for the GPU
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2828151)
