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.
Multi GPU Sparse Matrix by Sparse Matrix Multiplication
Artem Mavliutov
;Giovanni Isotton;Carlo Janna;
2025
Abstract
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
