Exploiting the capabilities of modern GPUs for dense matrix computations
- 1 September 2009
- journal article
- research article
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 21 (18) , 2457-2477
Abstract
We present several algorithms to compute the solution of a linear system of equations on a graphics processor (GPU), as well as general techniques to improve their performance, such as padding and hybrid GPU‐CPU computation. We compare single and double precision performance of a modern GPU with unified architecture, and show how iterative refinement with mixed precision can be used to regain full accuracy in the solution of linear systems, exploiting the potential of the processor for single precision arithmetic. Experimental results on a GTX280 using CUBLAS 2.0, the implementation of BLAS for NVIDIA® GPUs with unified architecture, illustrate the performance of the different algorithms and techniques proposed. Copyright © 2009 John Wiley & Sons, Ltd.Keywords
Funding Information
- CICYT (TIN2005-09037-C02-02)
- FEDER
- Fundación Caixa-Castellón/Bancaixa (P1-1B2007-32)
- UJI
This publication has 9 references indexed in Scilit:
- Benchmarking GPUs to tune dense linear algebra2008
- Evaluation and tuning of the Level 3 CUBLAS for graphics processors2008
- Attaining High Performance in General-Purpose Computations on Current Graphics Processors2008
- Solving Dense Linear Systems on Graphics Processors2008
- Mixed Precision Iterative Refinement Techniques for the Solution of Dense Linear SystemsThe International Journal of High Performance Computing Applications, 2007
- LU-GPU: Efficient Algorithms for Solving Dense Linear Systems on Graphics Hardware2005
- The science of deriving dense linear algebra algorithmsACM Transactions on Mathematical Software, 2005
- Fundamentals of Matrix Computations2002
- FLAMEACM Transactions on Mathematical Software, 2001