A scalable, numerically stable, high-performance tridiagonal solver using GPUs
Citations Over TimeTop 10% of 2012 papers
Abstract
In this paper, we present a scalable, numerically stable, high-performance tridiagonal solver. The solver is based on the SPIKE algorithm for partitioning a large matrix into small independent matrices, which can be solved in parallel. For each small matrix, our solver applies a general 1-by-1 or 2-by-2 diagonal pivoting algorithm, which is also known to be numerically stable. Our paper makes two major contributions. First, our solver is the first numerically stable tridiagonal solver for GPUs. Our solver provides comparable quality of stable solutions to Intel MKL and Matlab, at speed comparable to the GPU tridiagonal solvers in existing packages like CUSPARSE. It is also scalable to multiple GPUs and CPUs. Second, we present and analyze two key optimization strategies for our solver: a high-throughput data layout transformation for memory efficiency, and a dynamic tiling approach for reducing the memory access footprint caused by branch divergence.
Related Papers
- → $LU$-Decompositions of Tridiagonal Irreducible H-Matrices(1986)4 cited
- → The recursive tri-reduction method for tridiagonal linear systems(1991)1 cited
- → A comparison of sequential and parallel elimination methods for tridiagonal matrices(1989)
- A New Algorithm for Computing the Inverse of Tridiagonal and Periodic Tridiagonal Matrices(2010)
- → Appendix: Tridiagonal Matrix Algorithm(2022)