BibTeX
@INCOLLECTION{
         Cole-Mullen2012SVR,
       title = "Storing Versus Recomputation on Multiple {DAG}s",
       doi = "10.1007/978-3-642-30023-3_18",
       author = "Heather Cole-Mullen and Andrew Lyons and Jean Utke",
       abstract = "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.",
       pages = "197--207",
       crossref = "Forth2012RAi",
       booktitle = "Recent Advances in Algorithmic Differentiation",
       series = "Lecture Notes in Computational Science and Engineering",
       publisher = "Springer",
       address = "Berlin",
       volume = "87",
       editor = "Shaun Forth and Paul Hovland and Eric Phipps and Jean Utke and Andrea Walther",
       isbn = "978-3-540-68935-5",
       issn = "1439-7358",
       year = "2012",
       ad_tools = "OpenAD"
}