Suchergebnisse - 1D SpGEMM algorithm
-
1
A Sparsity-Aware Distributed-Memory Algorithm for Sparse-Sparse Matrix Multiplication
Veröffentlicht: IEEE 17.11.2024Veröffentlicht in SC24: International Conference for High Performance Computing, Networking, Storage and Analysis (17.11.2024)“… Here, we present a distributed-memory 1D SpGEMM algorithm and implementation. It uses MPI RDMA operations to mitigate the cost of packing/unpacking submatrices …”
Volltext
Tagungsbericht -
2
Cartesian Partitioning Models for 2D and 3D Parallel SpGEMM Algorithms
ISSN: 1045-9219, 1558-2183Veröffentlicht: New York IEEE 01.12.2020Veröffentlicht in IEEE transactions on parallel and distributed systems (01.12.2020)“… ). Parallel SpGEMM algorithms are classified under one-dimensional (1D), 2D, and 3D categories denoting the number of dimensions by which the 3D sparse workcube representing the iteration space of SpGEMM is partitioned …”
Volltext
Journal Article -
3
Simultaneous Input and Output Matrix Partitioning for Outer-Product--Parallel Sparse Matrix-Matrix Multiplication
ISSN: 1064-8275, 1095-7197Veröffentlicht: 01.01.2014Veröffentlicht in SIAM journal on scientific computing (01.01.2014)“… This partitioning scheme induces a two-phase parallel SpGEMM algorithm, where communication-free local SpGEMM computations constitute the first phase and the multiple single-node-accumulation …”
Volltext
Journal Article -
4
Distributed-Memory Parallel Algorithms for Sparse Matrix and Sparse Tall-and-Skinny Matrix Multiplication
Veröffentlicht: IEEE 17.11.2024Veröffentlicht in SC24: International Conference for High Performance Computing, Networking, Storage and Analysis (17.11.2024)“… Unfortunately, popular distributed algorithms like sparse SUMMA deliver suboptimal performance for TS-SpGEMM …”
Volltext
Tagungsbericht -
5
A sparsity-aware distributed-memory algorithm for sparse-sparse matrix multiplication
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 26.08.2024Veröffentlicht in arXiv.org (26.08.2024)“… Here, we present a distributed-memory 1D SpGEMM algorithm and implementation. It uses MPI RDMA operations to mitigate the cost of packing/unpacking submatrices …”
Volltext
Paper -
6
Distributed-Memory Parallel Algorithms for Sparse Matrix and Sparse Tall-and-Skinny Matrix Multiplication
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 21.08.2024Veröffentlicht in arXiv.org (21.08.2024)“… Unfortunately, popular distributed algorithms like sparse SUMMA deliver suboptimal performance for TS-SpGEMM …”
Volltext
Paper -
7
Hypergraph Partitioning for Sparse Matrix-Matrix Multiplication
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 17.03.2016Veröffentlicht in arXiv.org (17.03.2016)“… We propose a fine-grained hypergraph model for sparse matrix-matrix multiplication (SpGEMM …”
Volltext
Paper