On rounding error resilience, maximal attainable accuracy and parallel performance of the pipelined Conjugate Gradients method for large-scale linear systems in PETSc

Abstract : Pipelined Krylov solvers typically display better strong scaling compared to standard Krylov methods for large linear systems. The synchronization bottleneck is mitigated by overlapping time-consuming global communications with computations. To achieve this hiding of communication, pipelined methods feature additional recurrence relations on auxiliary variables. This paper analyzes why rounding error effects have a significantly larger impact on the accuracy of pipelined algorithms. An algebraic model for the accumulation of rounding errors in the (pipelined) CG algorithm is derived. Furthermore, an automated residual replacement strategy is proposed to reduce the effect of rounding errors on the final solution. MPI parallel performance tests implemented in PETSc on an Intel Xeon X5660 cluster show that the pipelined CG method with automated residual replacement is more resilient to rounding errors while maintaining the efficient parallel performance obtained by pipelining.
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-01734422
Contributor : Luc Giraud <>
Submitted on : Wednesday, March 14, 2018 - 4:39:14 PM
Last modification on : Thursday, May 9, 2019 - 11:58:04 AM
Long-term archiving on: Monday, September 10, 2018 - 5:57:29 PM

File

cools2016.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Siegfried Cools, Wim Vanroose, Emrullah Fatih Yetkin, Emmanuel Agullo, Luc Giraud. On rounding error resilience, maximal attainable accuracy and parallel performance of the pipelined Conjugate Gradients method for large-scale linear systems in PETSc. EASC 2016 - Exascale Applications and Software Conference, Apr 2016, Stockholm, Sweden. pp.1-10, ⟨10.1145/2938615.2938621⟩. ⟨hal-01734422⟩

Share

Metrics

Record views

157

Files downloads

257