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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	SC24: International Conference for High Performance Computing, Networking, Storage and Analysis s. 1 - 14
Hlavní autori:	Hong, Yuxi, Buluc, Aydin
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 17.11.2024
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!