.png){kind=icon}
.png){kind=icon}
Return
Conjugate gradient method with graphics processing unit acceleration: CUDA vs OpenCL
.png){kind=icon}
PRE
AI
DOI：10.1016/j.advengsoft.2016.10.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Performance computations depend on the machine architecture, the operating system, the problem studied and obviously on the programming implementation. Solving partial differential equations by numerical methods such as the finite element method requires the solution of large sparse linear systems. Graphics processing unit (GPU) is now commonly used to accelerate numerical simulations and most supercomputers provide large number of GPUs to their users. This paper proposes a comparison of both CUDA and OpenCL GPU languages to take the highest performance of multi-GPUs clusters. We analyse, evaluate and compare their respective performances for computing linear algebra operations and for solving large sparse linear systems with the conjugate gradient iterative method on multi-GPUs clusters. (C) 2017 Elsevier Ltd. All rights reserved.
Keywords:
Conjugate gradient method
Iterative method
Linear algebra
Sparse matrix-vector product
Parallel computing
GPU
CUDA
OpenCL
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.7
Papers:
3.3K
Citations:
1.2W