Storing Versus Recomputation on Multiple DAGs
|Title||Storing Versus Recomputation on Multiple DAGs|
|Publication Type||Book Chapter|
|Year of Publication||2012|
|Authors||Cole-Mullen, H, Lyons, A, Utke, J|
|Book Title||Recent Advances in Algorithmic Differentiation, Lecture Notes in Computational Science and Engineering|
Recomputation and storing are typically seen as a tradeoff for checkpointing schemes in the context of adjoint computations. At finer granularity during the adjoint sweep, in practice, only the store-all or recompute-all approaches are fully automated. This paper considers a heuristic approach for exploiting finer granular recomputations to reduce the storage requirements and thereby improve the overall adjoint efficiency without the need for manual intervention.