Acceleration of GPU-based Krylov solvers via data transfer reduction. (August 2015)

• Record Type: Journal Article
• Authors: Anzt, Hartwig; Tomov, Stanimire; Luszczek, Piotr; Sawyer, William; Dongarra, Jack
• Is Part Of: International journal of high performance computing applications. Volume 29:Number 3(2015:Autumn)
• Page Start: 366
• Page End: 383
• Publication Date: 2015-08
• Subjects: Krylov subspace methods -- iterative solvers -- sparse linear systems -- graphics processing units -- BiCGSTAB; High performance computing -- Periodicals; Supercomputers -- Periodicals; 004.1105
• DOI: 10.1177/1094342015580139
• Languages: English
• ISSNs: 1094-3420

Abstract

Krylov subspace iterative solvers are often the method of choice when solving large sparse linear systems. At the same time, hardware accelerators such as graphics processing units continue to offer significant floating point performance gains for matrix and vector computations through easy-to-use libraries of computational kernels. However, as these libraries are usually composed of a well optimized but limited set of linear algebra operations, applications that use them often fail to reduce certain data communications, and hence fail to leverage the full potential of the accelerator. In this paper, we target the acceleration of Krylov subspace iterative methods for graphics processing units, and in particular the Biconjugate Gradient Stabilized solver that significant improvement can be achieved by reformulating the method to reduce data-communications through application-specific kernels instead of using the generic BLAS kernels, e.g. as provided by NVIDIA's cuBLAS library, and by designing a graphics processing unit specific sparse matrix-vector product kernel that is able to more efficiently use the graphics processing unit's computing power. Furthermore, we derive a model estimating the performance improvement, and use experimental data to validate the expected runtime savings. Considering that the derived implementation achieves significantly higher performance, we assert that similar optimizations addressing algorithm structure, as well as sparse matrix-vector, are crucial for the subsequent development of high-performance graphics processing units accelerated Krylov subspace iterative methods.