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.
Type de document :
Article dans une revue
SIAM Journal on Scientific Computing, Society for Industrial and Applied Mathematics, 2016, 38 (3), pp.C232-C255. 〈10.1137/15M1019222〉
Liste complète des métadonnées

Littérature citée [13 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01354902
Contributeur : Equipe Roma <>
Soumis le : vendredi 19 août 2016 - 23:42:37
Dernière modification le : samedi 21 avril 2018 - 01:27:08
Document(s) archivé(s) le : dimanche 20 novembre 2016 - 10:45:26

Fichier

siam_revised.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Guillaume Aupy, Julien Herrmann, Paul Hovland, Yves Robert. Optimal Multistage Algorithm for Adjoint Computation. SIAM Journal on Scientific Computing, Society for Industrial and Applied Mathematics, 2016, 38 (3), pp.C232-C255. 〈10.1137/15M1019222〉. 〈hal-01354902〉

Partager

Métriques

Consultations de la notice

271

Téléchargements de fichiers

66