Efficient sparse matrix-vector multiplication on cache-based GPUs
Sparse matrix-vector multiplication is an integral part of many scientific algorithms. Several studies have shown that it is a bandwidth-limited operation on current hardware. On cache-based architectures the main factors that influence performance are spatial locality in accessing the matrix, and t...
| Main Authors: | |
|---|---|
| Format: | Book part |
| Published: |
IEEE Communications Society
Piscataway (NJ)
2012
|
| Series: | Innovative Parallel Computing (InPar), 2012
|
| Subjects: | |
| mtmt: | 2724105 |
| Online Access: | https://publikacio.ppke.hu/1901 |