Publication: New Results on Program Reversals
Introduction
Applications
Tools
Research Groups
Workshops
Publications
   List Publications
   Advanced Search
   Info
   Add Publications
My Account
About

New Results on Program Reversals

- incollection -
 

Author(s)
Andrea Walther , Andreas Griewank

Published in
Automatic Differentiation of Algorithms: From Simulation to Optimization

Editor(s)
George Corliss, Christèle Faure, Andreas Griewank, Laurent Hascoët, Uwe Naumann

Year
2002

Publisher
Springer

Abstract
For adjoint calculations, parameter estimation, and similar purposes, one may need to produce all quantities calculated during the execution of a computer program in reverse order. The simplest possible approach is to record a complete execution log and then to read it backwards. This may require massive amounts of storage. Instead one may generate the execution log piecewise by restarting the ``forward″ calculation repeatedly from suitably placed checkpoints. For such program execution reversals we present parallel reversal schedules that are provably optimal with regards to the number of concurrent processes and the total amount of memory required.

Cross-References
Corliss2002ADo

AD Theory and Techniques
Checkpointing

BibTeX
@INCOLLECTION{
         Walther2002NRo,
       author = "Andrea Walther and Andreas Griewank",
       title = "New Results on Program Reversals",
       pages = "237--243",
       chapter = "28",
       crossref = "Corliss2002ADo",
       booktitle = "Automatic Differentiation of Algorithms: From Simulation to Optimization",
       year = "2002",
       editor = "George Corliss and Christ{\`e}le Faure and Andreas Griewank and Laurent
         Hasco{\"e}t and Uwe Naumann",
       series = "Computer and Information Science",
       publisher = "Springer",
       address = "New York, NY",
       abstract = "For adjoint calculations, parameter estimation, and similar purposes, one may need
         to produce all quantities calculated during the execution of a computer program in reverse order.
         The simplest possible approach is to record a complete execution log and then to read it backwards.
         This may require massive amounts of storage. Instead one may generate the execution log piecewise by
         restarting the ``forward'' calculation repeatedly from suitably placed checkpoints. For
         such program execution reversals we present parallel reversal schedules that are provably optimal
         with regards to the number of concurrent processes and the total amount of memory required.",
       referred = "[Klein2002DMf],",
       ad_theotech = "Checkpointing"
}


back
  

Contact:
autodiff.org
Username:
Password:
(lost password)