Optimal Multistage Algorithm for Adjoint Computation

Authors:

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...
Funding Information
  • Partner University Fund (NEXTGEN)
  • Agence Nationale de la Recherche (RESCUE)
  • Argonne National Laboratory (DE-AC02-06CH11357)

This publication has 7 references indexed in Scilit: