
doi: 10.2312/vmv.20191324
Large sparse matrices with compound entries, i.e., complex and quaternionic matrices as well as matrices with dense blocks, are a core component of many algorithms in geometry processing, physically based animation, and other areas of computer graphics. We generalize several matrix layouts and apply joint schedule and layout autotuning to improve the performance of the sparse matrix-vector product on massively parallel graphics processing units. Compared to schedule tuning without layout tuning, we achieve speedups of up to 5.5x. In comparison to cuSPARSE, we achieve speedups of up to 4.7x
CCS Concepts: Computing methodologies --> Massively parallel algorithms; Parallel programming languages; Mathematics of computing --> Computations on matrices
Johannes Sebastian Mueller-Roemer, André Stork, and Dieter W. Fellner
Vision, Modeling and Visualization
GPU
109
116
Parallel programming languages, Massively parallel algorithms, Computations on matrices, Mathematics of computing, Computing methodologies
Parallel programming languages, Massively parallel algorithms, Computations on matrices, Mathematics of computing, Computing methodologies
| 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 |
