Is the multigrid method fault tolerant? The multilevel case

DOI10.1137/16M1097274MaRDI QIDQ4594169zbMATH OpenOpenAlexFDO

Authors Christian Glusa, Mark Ainsworth

Publication date 17 November 2017

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1607.08502

zbMATH Keywords

algorithmconvergencefault tolerancefault-free methodmultigridoptimal choice of parametersrandom matricesresilience

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55)

Abstract: Computing at the exascale level is expected to be affected by a significantly higher rate of faults, due to increased component counts as well as power considerations. Therefore, current day numerical algorithms need to be reexamined as to determine if they are fault resilient, and which critical operations need to be safeguarded in order to obtain performance that is close to the ideal fault-free method. In a previous paper, a framework for the analysis of random stationary linear iterations was presented and applied to the two grid method. The present work is concerned with the multigrid algorithm for the solution of linear systems of equations, which is widely used on high performance computing systems. It is shown that the Fault-Prone Multigrid Method is not resilient, unless the prolongation operation is protected. Strategies for fault detection and mitigation as well as protection of the prolongation operation are presented and tested, and a guideline for an optimal choice of parameters is devised.

Recommendations

• Is the multigrid method fault tolerant? the two-grid case
• Multigrid at Scale?
• The resiliency of multilevel methods on next-generation computing platforms: probabilistic model and its analysis
• Resilience for massively parallel multigrid solvers
• Robust solutions to PDEs with multiple grids

Cites work

• A Convergent Adaptive Algorithm for Poisson’s Equation
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• Fault-tolerance techniques for high-performance computing
• Finite Elements
• scientific article; zbMATH DE number 3913325 (Why is no real title available?)
• scientific article; zbMATH DE number 3958638 (Why is no real title available?)
• scientific article; zbMATH DE number 1561761 (Why is no real title available?)
• Is the multigrid method fault tolerant? the two-grid case
• Iterative solution of large sparse systems of equations. Transl. from the German
• Products of random matrices in statistical physics
• Stability of the 8-tetrahedra shortest-interior-edge partitioning method
• Theory and practice of finite elements.

Cited in

(9)

• Finite element approximation for the fractional eigenvalue problem
• FT-GCR: a fault-tolerant generalized conjugate residual elliptic solver
• Numerical algorithms and fault tolerance of hyperexascale computer systems
• Numerical analysis of fixed point algorithms in the presence of hardware faults
• The resiliency of multilevel methods on next-generation computing platforms: probabilistic model and its analysis
• Stochastic subspace correction methods and fault tolerance
• Fault tolerant computation with the sparse grid combination technique
• Is the multigrid method fault tolerant? the two-grid case
• Fault-tolerant parallel multigrid method on unstructured adaptive mesh

This page was built for publication: Is the multigrid method fault tolerant? The multilevel case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4594169)