Optimal Multistage Algorithm for Adjoint ComputationReport as inadecuate

Optimal Multistage Algorithm for Adjoint Computation - Download this document for free, or read online. Document in PDF available to download.

1 Vanderbilt University Nashville 2 LIP - Laboratoire de l-Informatique du Parallélisme 3 ROMA - Optimisation des ressources : modèles, algorithmes et ordonnancement Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l-Informatique du Parallélisme 4 MCS - Mathematics and Computer Science Division ANL 5 Department of Computer Science. University of Tennessee

Abstract : We reexamine the work of Stumm and Walther on multistage algorithms for adjointcomputation. We provide an optimal algorithm for this problem when there are twolevels of checkpoints, in memory and on disk. Previously, optimal algorithms foradjoint computations were known only for a single level of checkpoints with nowriting and reading costs; a well-known example is the binomial checkpointingalgorithm of Griewank and Walther. Stumm and Walther extended that binomialcheckpointing algorithm to the case of two levels of checkpoints, but they didnot provide any optimality results. We bridge the gap by designing the firstoptimal algorithm in this context. We experimentally compare our optimalalgorithm with that of Stumm and Walther to assess the difference inperformance.

Author: Guillaume Aupy - Julien Herrmann - Paul Hovland - Yves Robert -

Source: https://hal.archives-ouvertes.fr/


Related documents