GPU-accelerated sparse matrix-matrix multiplication by iterative row merging

DOI10.1137/130948811MaRDI QIDQ3454845zbMATH OpenOpenAlexFDO

Authors Felix Gremse, Andreas Höfter, Lars Ole Schwen, Fabian Kiessling, Uwe Naumann

Publication date 27 November 2015

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/130948811

zbMATH Keywords

algebraic multigridfluorescence-mediated tomographyGPU programmingsparse matrix-matrix multiplication

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures
• Efficient CSR-based sparse matrix-vector multiplication on GPU
• Optimizing sparse matrix-matrix multiplication for the GPU
• New ideas in sparse matrix matrix multiplication
• Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments

Cited in

(8)

• Efficient CSR-based sparse matrix-vector multiplication on GPU
• SpGEMM
• 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
• Memory-Efficient Sparse Matrix-Matrix Multiplication by Row Merging on Many-Core Architectures
• An optimized sparse approximate matrix multiply for matrices with decay

Describes a project that uses

Uses Software

• CUSP
• BoomerAMG
• CUSPARSE
• CUDA
• SparseMatrix

This page was built for publication: GPU-accelerated sparse matrix-matrix multiplication by iterative row merging

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454845)