The Data-Flow Equations of Checkpointing in Reverse Automatic Differentiation

DOI10.1007/11758549_78zbMATH Open1157.65334OpenAlexW1526743513MaRDI QIDQ5301489FDOQ5301489

Authors: Benjamin Dauvergne, Laurent Hascoët 

Publication date: 20 January 2009

Published in: Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11758549_78

Recommendations

• Divide-and-conquer checkpointing for arbitrary programs with no user annotation
• Algorithm 799: revolve
• scientific article; zbMATH DE number 2087170
• Multistage approaches for optimal offline checkpointing
• New algorithms for optimal online checkpointing

Mathematics Subject Classification ID

Numerical differentiation (65D25)

Cited In (11)

• H-revolve: a framework for adjoint computation on synchronous hierarchical platforms
• Bilevel Methods for Image Reconstruction
• Optimal memory-aware backpropagation of deep join networks
• A Fortran77 preprocessor for reverse mode automatic differentiation with recursive checkpointing
• Call tree reversal is NP-complete
• Uncertainty quantification in littoral erosion
• Algorithmic differentiation for adjoint sensitivity calculation in plasma edge codes
• Programming language features, usage patterns, and the efficiency of generated adjoint code
• Divide-and-conquer checkpointing for arbitrary programs with no user annotation
• Title not available (Why is that?)
• Storing versus recomputation on multiple DAGs

Uses Software

• Maple
• TAPENADE

This page was built for publication: The Data-Flow Equations of Checkpointing in Reverse Automatic Differentiation

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