Abstract
For computational purposes such as debugging, derivative computations using the reverse mode of automatic differentiation, or optimal control by Newton’s method, one may need to reverse the execution of a program. The simplest option is to record a complete execution log and then to read it backwards. As a result, massive amounts of storage are normally required. This paper proposes a new approach to reversing program executions. The presented technique runs the forward simulation and the reversal process at the same speed. For that purpose, one only employs a fixed and usually small amount of memory pads called checkpoints to store intermediate states and a certain number of processors. The execution log is generated piecewise by restarting the evaluation repeatedly and concurrently from suitably placed checkpoints. The paper illustrates the principle structure of time-minimal parallel reversal schedules and quotes the required resources. Furthermore, some specific aspects of adjoint calculations are discussed. Initial results for the steering of a Formula 1 car are shown.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35699-0_19
Chapter PDF
Similar content being viewed by others
References
J. Allen. Computer optimisation of cornering line. Master’s thesis, School of Mechanical Engineering, Cranfield University, 1997.
E. Bakker, H. Pacejka, and L. Lidner. A new tire model with an application in vehicle dynamics studies. SAE-Paper, 890087, 1989.
Y. Evtushenko. Automatic differentiation viewed from optimal control. In G. F. Corliss and A. Griewank, editors, Computational Differentiation: Techniques, Implementations, and Application, Philadelphia, 1991. SIAM.
M. Garey and D. Johnson. Computers and intractability: Aguide to the theory of NP-completeness. Freeman and Company, New York, 1980.
A. Griewank. Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. Frontiers in Applied Mathematics. SIAM, Philadelphia, 1999.
A. Griewank and A. Walther. Revolve: An implementation of checkpointing for the reverse or adjoint mode of computational differentiation. ACM Trans. Math. Software, 26, 2000.
J. Grimm, L. Pottier, and N. Rostaing-Schmidt. Optimal time and minimum space-time product for reversing a certain class of programs. In M. Berz, C. Bischof, G. Corliss, and A. Griewank, editors, Computational Differentiation: Techniques, Applications, and Tools, Philadelphia, 1996. SIAM.
W. Hager. Runge-kutta methods in optimal control and the transformed adjoint system. Numer. Math., 87: 247–282, 2000.
P. Hilton and J. Petersen. A fresh look at old favourites: The fibonacci and lucas sequences revisited. Australian Mathematical Society Gazette, 25: 146–160, 1998.
U. Lehmann and A. Walther. The implementation and testing of time-minimal and resource-optimal parallel reversal schedules. Technical Report ZHR-IR0109, Tech. Univ. Dresden, Center for High Perf. Comp., 2001.
O. Talagrand. The use of adjoint equations in numerical modeling of the atmospheric circulation. In G. F. Corliss and A. Griewank, editors, Computational Differentiation: Techniques, Implementations, and Application, Philadelphia, 1991. SIAM.
J. van de Snepscheut. What computing is all about. Texts and Monographs in Computer Science. Springer, Berlin, 1993.
A. Walther. Program Reversal Schedules for Single-and Multi-processor Machines. PhD thesis, Tech. Univ. Dresden, Inst. for Sci. Comp., 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 IFIP International Federation for Information Processing
About this paper
Cite this paper
Walther, A., Lehmann, U. (2003). Adjoint Calculation Using Time-Minimal Program Reversals for Multi-Processor Machines. In: Sachs, E.W., Tichatschke, R. (eds) System Modeling and Optimization XX. CSMO 2001. IFIP — The International Federation for Information Processing, vol 130. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35699-0_18
Download citation
DOI: https://doi.org/10.1007/978-0-387-35699-0_18
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6669-1
Online ISBN: 978-0-387-35699-0
eBook Packages: Springer Book Archive