Storing versus recomputation on multiple DAGs

DOI10.1007/978-3-642-30023-3_18zbMATH Open1251.65025OpenAlexW170680544MaRDI QIDQ2913135FDOQ2913135

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

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

zbMATH Keywords

heuristicsnumerical differentiationreverse modeadjoint computationsource transformationderivative computationstorage recomputation tradeoff

Mathematics Subject Classification ID

Numerical differentiation (65D25)

Cited In (6)

• H-revolve: a framework for adjoint computation on synchronous hierarchical platforms
• Optimal multistage algorithm for adjoint computation
• Title not available (Why is that?)
• Divide-and-conquer checkpointing for arbitrary programs with no user annotation
• Deferring Dag Construction by Storing Sums of Floats Speeds-Up Exact Decision Computations Based on Expression Dags
• Title not available (Why is that?)

Uses Software

• revolve
• TAF
• OpenAD/F

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)