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 :
Rapport
[Research Report] RR-8721, LIP - ENS Lyon; Argonne National Laboratory; INRIA; Vanderbilt University. 2014
Liste complète des métadonnées

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

https://hal.inria.fr/hal-01147155
Contributeur : Equipe Roma <>
Soumis le : dimanche 20 mars 2016 - 17:22:37
Dernière modification le : vendredi 20 avril 2018 - 15:44:26

Fichier

RR-8721.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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〉

Partager

Métriques

Consultations de la notice

297

Téléchargements de fichiers

72