Optimization of Large-Scale Sparse Matrix-Vector Multiplication on Multi-GPU Systems
Sparse matrix-vector multiplication (SpMV) is one of the important kernels of many iterative algorithms for solving sparse linear systems. The limited storage and computational resources of individual GPUs restrict both the scale and speed of SpMV computing in problem-solving. As real-world engineer...
Saved in:
| Published in: | ACM transactions on architecture and code optimization 2024-11, Vol.21 (4), p.1-24, Article 69 |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Subjects: | |
| Citations: | Items that this one cites |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|