A Sparsity-Aware Distributed-Memory Algorithm for Sparse-Sparse Matrix Multiplication

Multiplying two sparse matrices (SpGEMM) is a common computational primitive used in many areas including graph algorithms, bioinformatics, algebraic multigrid solvers, and randomized sketching. Distributed-memory parallel algorithms for SpGEMM have mainly focused on sparsity-oblivious approaches th...

Full description

Saved in:

Bibliographic Details
Published in:	SC24: International Conference for High Performance Computing, Networking, Storage and Analysis pp. 1 - 14
Main Authors:	Hong, Yuxi, Buluc, Aydin
Format:	Conference Proceeding
Language:	English
Published:	IEEE 17.11.2024
Subjects:	1D algorithm 1D SpGEMM algorithm Electric breakdown High performance computing Load management Matrices numerical linear algebra Parallel algorithms parallel computing Partitioning algorithms RDMA Software Software algorithms Sparse matrices sparse matrix-matrix multiplication sparsity-aware 1D SpGEMM algorithm SpGEMM Three-dimensional displays
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!