Storing versus recomputation on multiple DAGs

DOI10.1007/978-3-642-30023-3_18MaRDI QIDQ2913135zbMATH OpenOpenAlexFDO

Authors Heather Cole-Mullen, Andrew Lyons, Jean Utke

Publication date 26 September 2012

Published in Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-30023-3_18

zbMATH Keywords

adjoint computationderivative computationheuristicsnumerical differentiationreverse modesource transformationstorage recomputation tradeoff

Mathematics Subject Classification ID

Numerical differentiation (65D25)

Recommendations

• H-revolve: a framework for adjoint computation on synchronous hierarchical platforms
• The Data-Flow Equations of Checkpointing in Reverse Automatic Differentiation
• scientific article; zbMATH DE number 2087168
• Multistage approaches for optimal offline checkpointing
• scientific article; zbMATH DE number 2110758

Cited in

(6)

• Optimal multistage algorithm for adjoint computation
• Divide-and-conquer checkpointing for arbitrary programs with no user annotation
• scientific article; zbMATH DE number 2087168 (Why is no real title available?)
• scientific article; zbMATH DE number 2110758 (Why is no real title available?)
• H-revolve: a framework for adjoint computation on synchronous hierarchical platforms
• Deferring Dag Construction by Storing Sums of Floats Speeds-Up Exact Decision Computations Based on Expression Dags

Describes a project that uses

Uses Software

• OpenAD/F
• revolve
• TAF

This page was built for publication: Storing versus recomputation on multiple DAGs

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