New Algorithms for Optimal Online Checkpointing

DOI10.1137/080742439zbMath1214.65038OpenAlexW1975435453MaRDI QIDQ3084406

Andrea Walther, Philipp Stumm

Publication date: 16 March 2011

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

Full work available at URL: https://doi.org/10.1137/080742439

zbMATH Keywords

algorithmsnumerical resultsa priori error estimationcalculation of adjointsalmost optimal checkpointingonline checkpointingprogram reversals

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Applications of optimal control and differential games (49N90) Complexity and performance of numerical algorithms (65Y20)

Related Items (9)

Online Checkpointing with Improved Worst-Case Guarantees ⋮ Approximately uniform online checkpointing with bounded memory ⋮ Structure Exploiting Adjoints for Finite Element Discretizations ⋮ Automated Calculation of Higher Order Partial Differential Equation Constrained Derivative Information ⋮ Reducing Memory Requirements in Scientific Computing and Optimal Control ⋮ Algorithmic Differentiation of Numerical Methods ⋮ Randomized Sketching Algorithms for Low-Memory Dynamic Optimization ⋮ PETSc TSAdjoint: A Discrete Adjoint ODE Solver for First-Order and Second-Order Sensitivity Analysis ⋮ Periodicity in optimal hierarchical checkpointing schemes for adjoint computations

Uses Software

• revolve
• CVODES
• CompAD
• NAGWare

This page was built for publication: New Algorithms for Optimal Online Checkpointing