An efficient multi-algorithms sparse linear solver for GPUs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Book Sections Year : 2010

An efficient multi-algorithms sparse linear solver for GPUs

Abstract

We present a new sparse linear solver for GPUs. It is designed to work with structured sparse matrices where all the non-zeros are on a few diagonals. Several iterative algorithms are implemented, both on CPU and GPU. The GPU code is designed to be fast yet simple to read and understand. It aims to be as accurate as possible, even on chips that do not support double-precision floating-point arithmetic. Several benchmarks show that GPU algorithms are much faster than their CPU counterpart while their accuracy is satisfying.
No file

Dates and versions

hal-00485963 , version 1 (24-05-2010)

Identifiers

Cite

Thomas Jost, Sylvain Contassot-Vivier, Stéphane Vialle. An efficient multi-algorithms sparse linear solver for GPUs. B. Chapman, F. Desprez, G.R. Joubert, A. Lichnewsky, F. Peters and T. Priol. Parallel Computing: From Multicores and GPU's to Petascale (Volume 19), 19, IOS Press, pp.546-553, 2010, Advances in Parallel Computing, ⟨10.3233/978-1-60750-530-3-546⟩. ⟨hal-00485963⟩
144 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More