Powered by OpenAIRE graph
Found an issue? Give us feedback
downloadFull-Text
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ IRIS Cnrarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
IRIS Cnr
Article . 2025
License: CC BY
Full-Text: https://iris.cnr.it/bitstream/20.500.14243/562541/1/Concurrency%20and%20Computation%20-%202025%20-%20Mavliutov%20-%20Multi%20GPU%20Sparse%20Matrix%20by%20Sparse%20Matrix%20Multiplication.pdf
Data sources: IRIS Cnr
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Concurrency and Computation Practice and Experience
Article . 2025 . Peer-reviewed
License: CC BY
Data sources: Crossref
 View all 2 versions
Claim

Multi GPU Sparse Matrix by Sparse Matrix Multiplication

descriptionPublicationkeyboard_double_arrow_right Article 30 Sep 2025 Italy English Publisher:WileyJournal:Concurrency and Computation: Practice and Experience, volume 37 (issn: 1532-0626, eissn: 1532-0634, Copyright policy )
Authors: Mavliutov A.; Isotton G.; Janna C.; Celestini A.; Bernaschi M.;

doi: 10.1002/cpe.70313

handle: 20.500.14243/562541

Multi GPU Sparse Matrix by Sparse Matrix Multiplication

Abstract

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.

Country
Italy
Related Organizations
Keywords

GPUs, CUDA, MPI, large matrices

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 0
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    		 Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    		 Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
0
Average
Average
Average
hybrid