Optimal Multistage Algorithm for Adjoint Computation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles SIAM Journal on Scientific Computing Year : 2016

Optimal Multistage Algorithm for Adjoint Computation


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.
Fichier principal
Vignette du fichier
siam_revised.pdf (697.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01354902 , version 1 (19-08-2016)



Guillaume Aupy, Julien Herrmann, Paul Hovland, Yves Robert. Optimal Multistage Algorithm for Adjoint Computation. SIAM Journal on Scientific Computing, 2016, 38 (3), pp.C232-C255. ⟨10.1137/15M1019222⟩. ⟨hal-01354902⟩
344 View
162 Download



Gmail Facebook X LinkedIn More