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.
- Research Organization:
- Argonne National Lab. (ANL), Argonne, IL (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR); Agence Nationale de la recherche (ANR)
- DOE Contract Number:
- AC02-06CH11357
- OSTI ID:
- 1339157
- Journal Information:
- SIAM Journal on Scientific Computing, Vol. 38, Issue 3; ISSN 1064-8275
- Publisher:
- SIAM
- Country of Publication:
- United States
- Language:
- English
Similar Records
Progress on Optimizing Wind Farms and Rotor Designs Using Adjoints
Towards efficient backward-in-time adjoint computations using data compression techniques