Skip to Main content Skip to Navigation
Conference papers

Concurrent Number Cruncher : An Efficient Sparse Linear Solver on the GPU

Luc Buatois 1 Guillaume Caumon 2 Bruno Lévy 1
1 ALICE - Geometry and Lighting
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : A wide class of geometry processing and PDE resolution methods needs to solve a linear system, where the non-zero pattern of the matrix is dictated by the connectivity matrix of the mesh. The advent of GPUs with their ever-growing amount of parallel horsepower makes them a tempting resource for such numerical computations. This can be helped by new APIs (CTM from ATI and CUDA from NVIDIA) which give a direct access to the multithreaded computational resources and associated memory bandwidth of GPUs; CUDA even provides a BLAS implementation but only for dense matrices (CuBLAS). However, existing GPU linear solvers are restricted to specific types of matrices, or use non-optimal compressed row storage strategies. By combining recent GPU programming techniques with supercomputing strategies (namely block compressed row storage and register blocking), we implement a sparse generalpurpose linear solver which outperforms leading-edge CPU counterparts (MKL / ACML).
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Nicolas Ray <>
Submitted on : Monday, November 12, 2007 - 3:58:59 PM
Last modification on : Monday, March 15, 2021 - 10:56:03 AM
Long-term archiving on: : Monday, April 12, 2010 - 1:57:26 AM


Files produced by the author(s)




Luc Buatois, Guillaume Caumon, Bruno Lévy. Concurrent Number Cruncher : An Efficient Sparse Linear Solver on the GPU. High Performance Computation Conference - HPCC'07, University of Houston, Sep 2007, Houston, United States. pp.358-371, ⟨10.1007/978-3-540-75444-2_37⟩. ⟨inria-00186833⟩



Record views


Files downloads