Institutions | About Us | Help | Gaeilge
rian logo


Mark
Go Back
Binomial Checkpointing for Arbitrary Programs with No User Annotation
Siskind, Jeffrey Mark; Pearlmutter, Barak A.
Heretofore, automatic checkpointing at procedure-call boundaries, to reduce the space complexity of reverse mode, has been provided by systems like Tapenade. However, binomial checkpointing, or treeverse, has only been provided in Automatic Differentiation (AD) systems in special cases, e.g., through user-provided pragmas on DO loops in Tapenade, or as the nested taping mechanism in adol-c for time integration processes, which requires that user code be refactored. We present a framework for applying binomial checkpointing to arbitrary code with no special annotation or refactoring required. This is accomplished by applying binomial checkpointing directly to a program trace. This trace is produced by a general-purpose checkpointing mechanism that is orthogonal to AD.
Keyword(s): Binomial Checkpointing; Arbitrary Programs; treeverse; Automatic Differentiation (AD)
Publication Date:
2016
Type: Conference item
Peer-Reviewed: Yes
Institution: Maynooth University
Citation(s): Siskind, Jeffrey Mark and Pearlmutter, Barak A. (2016) Binomial Checkpointing for Arbitrary Programs with No User Annotation. In: AD 2016 Conference: 7th International Conference on Algorithmic Differentiation, September 12-15, 2016, Oxford, U.K..
File Format(s): other
Related Link(s): http://mural.maynoothuniversity.ie/8112/1/BP-Binomial.pdf
First Indexed: 2020-04-02 06:32:30 Last Updated: 2020-04-02 06:32:30