Manycore algorithms for batch scalar and block tridiagonal solvers

Journal article

Engineering, scientific, and financial applications often require the simultaneous solution of a large number of independent tridiagonal systems of equations with varying coefficients. Since the number of systems is large enough to offer considerable parallelism on manycore systems, the choice between different tridiagonal solution algorithms, such as Thomas, Cyclic Reduction (CR) or Parallel Cyclic Reduction (PCR) needs to be reexamined. This work investigates the optimal choice of tridiagonal algorithm for CPU, Intel MIC, and NVIDIA GPU with a focus on minimizing the amount of data transfer to and from the main memory using novel algorithms and the register-blocking mechanism, and maximizing the achieved bandwidth. It also considers block tridiagonal solutions, which are sometimes required in Computational Fluid Dynamic (CFD) applications. A novel work-sharing and register blocking--based Thomas solver is also presented.

Authors: László, E; Giles, M; Appleyard, J

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: Association for Computing Machinery
• Journal: ACM Transactions on Mathematical Software
• Volume: 42
• Issue: 4
• Article number: 31
• Publication date: 2016-06-30
• Acceptance date: 2015-09-01
• DOI: 10.1145/2956571
• EISSN: 1557-7295
• ISSN: 0098-3500
• Keywords: GPU; block tridiagonal solver; scalar tridiagonal solver; Xeon Phi; MIC; CPU; CUDA; vectorization