New ideas in sparse matrix matrix multiplication

zbMATH Open1238.65035MaRDI QIDQ3108698FDOQ3108698

Authors: Aydin Buluç, J. R. Gilbert 

Publication date: 5 January 2012

Recommendations

• Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments
• Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
• Sparse Matrix-Matrix Products Executed Through Coloring
• Fast sparse matrix multiplication
• Algorithms – ESA 2004

zbMATH Keywords

multigridparallel algorithmsperformance graph algorithmssparse matrix matrix multiplication

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)

Cited In (10)

• On optimizing multiplications of sparse matrices
• Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
• Simultaneous input and output matrix partitioning for outer-product -- parallel sparse matrix-matrix multiplication
• A geometric framework for sparse matrix problems
• High performance rearrangement and multiplication routines for sparse tensor arithmetic
• Solvers for \(\mathcal{O}(N)\) electronic structure in the strong scaling limit
• On parallelizing matrix multiplication by the column-row method
• Parallel mapping of sparse computations
• GPU-accelerated sparse matrix-matrix multiplication by iterative row merging
• Algorithm 1000: SuiteSparse:GraphBLAS: graph algorithms in the language of sparse linear algebra

Uses Software

• SUMMA

This page was built for publication: New ideas in sparse matrix matrix multiplication

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