Numerical recovery strategies for parallel resilient Krylov linear solvers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Numerical Linear Algebra with Applications Year : 2016

Numerical recovery strategies for parallel resilient Krylov linear solvers


As the computational power of high performance computing (HPC) systems continues to increase by using a huge number of cores or specialized processing units, HPC applications are increasingly prone to faults. In this paper, we present a new class of numerical fault tolerance algorithms to cope with node crashes in parallel distributed environments. This new resilient scheme is designed at application level and does not require extra resources, i.e., computational unit or computing time, when no fault occurs. In the framework of iterative methods for the solution of sparse linear systems, we present numerical algorithms to extract relevant information from available data after a fault, assuming a separate mechanism ensures the fault detection. After data extraction, a well chosen part of missing data is regenerated through interpolation strategies to constitute meaningful inputs to restart the iterative scheme. We have developed these methods, referred to as Interpolation-Restart techniques, for Krylov subspace linear solvers. After a fault, lost entries of the current iterate computed by the solver are interpolated to define a new initial guess to restart the Krylov method. A well suited initial guess is computed by using the entries of the faulty iterate available on surviving nodes. We present two interpolation policies that preserve key numerical properties of well-known linear solvers, namely the monotonic decrease of the A-norm of the error of the conjugate gradient or the residual norm decrease of GMRES. The qualitative numerical behavior of the resulting scheme have been validated with sequential simulations, when the number of faults and the amount of data losses are varied. Finally, the computational costs associated with the recovery mechanism have been evaluated through parallel experiments.
Fichier principal
Vignette du fichier
final_nlaa.pdf (770.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01323192 , version 1 (30-05-2016)



Emmanuel Agullo, Luc Giraud, Abdou Guermouche, Jean Roman, Mawussi Zounon. Numerical recovery strategies for parallel resilient Krylov linear solvers. Numerical Linear Algebra with Applications, 2016, 23 (5), pp.888--905. ⟨10.1002/nla.2059⟩. ⟨hal-01323192⟩
365 View
383 Download



Gmail Facebook X LinkedIn More