Skip to Main content Skip to Navigation
Reports

Optimal Multistage Algorithm for Adjoint Computation

Abstract : We reexamine the work of Stumm and Walther on multistage algorithms for adjoint computation. We provide an optimal algorithm for this problem when there are two levels of checkpoints, in memory and on disk. Previously, optimal algorithms for adjoint computations were known only for a single level of checkpoints with no writing and reading costs; a well-known example is the binomial checkpointing algorithm of Griewank and Walther. Stumm and Walther extended that binomial checkpointing algorithm to the case of two levels of checkpoints, but they did not provide any optimality results. We bridge the gap by designing the first optimal algorithm in this context. We experimentally compare our optimal algorithm with that of Stumm and Walther to assess the difference in performance.
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-01147155
Contributor : Equipe Roma <>
Submitted on : Sunday, March 20, 2016 - 5:22:37 PM
Last modification on : Wednesday, November 20, 2019 - 3:18:41 AM

File

RR-8721.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01147155, version 2

Collections

Citation

Guillaume Aupy, Julien Herrmann, Paul Hovland, Yves Robert. Optimal Multistage Algorithm for Adjoint Computation. [Research Report] RR-8721, LIP - ENS Lyon; Argonne National Laboratory; INRIA; Vanderbilt University. 2014. ⟨hal-01147155v2⟩

Share

Metrics

Record views

391

Files downloads

787