.png){kind=icon}
Return
STENCIL-AWARE GPU OPTIMIZATION OF ITERATIVE SOLVERS
.png){kind=icon}
PRE
AI
DOI：10.1137/120883153.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Numerical solutions of nonlinear partial differential equations frequently rely on iterative Newton-Krylov methods, which linearize a finite-difference stencil-based discretization of a problem, producing a sparse matrix with regular structure. Knowledge of this structure can be used to exploit parallelism and locality of reference on modern cache-based multi and manycore architectures, achieving high performance for computations underlying commonly used iterative linear solvers. In this paper we describe our approach to sparse matrix data structure design and our implementation of the kernels underlying iterative linear solvers in PETSc. We also describe autotuning of CUDA implementations based on high-level descriptions of the stencil-based matrix and vector operations.
Keywords:
structured grid
sparse matrix format
iterative solvers
autotuning
GPGPU
PETSc
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSave no more