Optimal Time and Minimum Space-Time Product for Reversing a Certain Class of Programs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1996

Optimal Time and Minimum Space-Time Product for Reversing a Certain Class of Programs

Loïc Pottier
Nicole Rostaing-Schmidt
  • Function : Author

Abstract

This report concerns time/space trade-offs for the reverse mode of automatic differentiation on the straight-line programs with nested loops class of programs. In the first part we consider the problem of reversing a finite sequence given by $u_{n+1}=3Df(u_n)$, which can mode lize a certain class of finite loops. We show an optimal time strategy for this problem, the number of available registers being fixed, and a lower bound on the time-space product equal to $\frac{p (\ln p)^2}{(\ln 4)^2}$. We then present an optimal strategy on nested loops with the objective of taking care of the program structure. Finally we consider an application of this storage/recomputation strategy to compute in reverse mode the derivatives of a function represented as a {\sc fortran} program.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2794.pdf (328.68 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00073896 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073896 , version 1

Cite

José Grimm, Loïc Pottier, Nicole Rostaing-Schmidt. Optimal Time and Minimum Space-Time Product for Reversing a Certain Class of Programs. RR-2794, INRIA. 1996. ⟨inria-00073896⟩
201 View
426 Download

Share

Gmail Facebook X LinkedIn More