This study demonstrates a multi-GPU extension of the nsparse algorithm for sparse matrix multiplication, suggesting improved scalability.
The paper focuses on the improvement of the existing nsparse Nagasaka et al. algorithm and its extension to the multi‐GPU setting for the application of real engineering problems. In this work, we propose a distributed multi‐GPU framework for SpGEMM that is designed specifically for the nsparse like algorithms. The results show ∼2 times speed‐up for nsparse and close to ideal scalability of the multi‐GPU extension with the number of GPUs. Finally, we test the proposed algorithm in the AMG setting by computing the double SpGEMM product.
No takes yet. Share an insight, caveat, or question.
Mavliutov et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: