Recomputation and storing are typically seen as tradeoffs 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 granularity recomputations to reduce the storage requirements and thereby improve the overall adjoint efficiency without the need for manual intervention. © 2012 Springer-Verlag.
CITATION STYLE
Cole-Mullen, H., Lyons, A., & Utke, J. (2012). Storing versus recomputation on multiple DAGs. In Lecture Notes in Computational Science and Engineering (Vol. 87 LNCSE, pp. 197–207). https://doi.org/10.1007/978-3-642-30023-3_18
Mendeley helps you to discover research relevant for your work.