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..

Preview

Download (123kB) | Preview

Abstract

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.

Item Type:	Conference or Workshop Item (Paper)
Additional Information:	Extended abstract presented at the AD 2016 Conference, Sep 2016, Oxford UK. Cite as: arXiv:1611.03410 [cs.PL]
Keywords:	Binomial Checkpointing; Arbitrary Programs; treeverse; Automatic Differentiation (AD);
Academic Unit:	Faculty of Science and Engineering > Computer Science
Item ID:	8112
Depositing User:	Barak Pearlmutter
Date Deposited:	03 Apr 2017 15:42
Refereed:	Yes
Funders:	Science Foundation Ireland (SFI)
URI:	https://arxiv.org/abs/1611.03410
Use Licence:	This item is available under a Creative Commons Attribution Non Commercial Share Alike Licence (CC BY-NC-SA). Details of this licence are available here

Repository Staff Only(login required)

Item control page

Downloads

Origin of downloads