Implementation and measurements of an efficient Fixed Point Adjoint - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Implementation and measurements of an efficient Fixed Point Adjoint

Abstract

Efficient Algorithmic Differentiation of Fixed-Point loops requires a specific strategy to avoid explosion of memory requirements. Among the strategies documented in literature, we have selected the one introduced by B. Christianson. This method features original mechanisms such as repeated access to the trajectory stack or duplicated differentiation of the loop body with respect to different independent variables. We describe in this paper how the method must be further specified to take into account the particularities of real codes, and how data flow information can be used to automate detection of relevant sets of variables. We describe the way we implement this method inside an AD tool. Experiments on a medium-size application demonstrate a minor, but non negligible improvement of the accuracy of the result, and more importantly a major reduction of the memory needed to store the trajectories.
Fichier principal
Vignette du fichier
FixedPointImplementationPaper.pdf (223 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01244298 , version 1 (15-12-2015)

Identifiers

  • HAL Id : hal-01244298 , version 1

Cite

Ala Taftaf, Laurent Hascoët, Valérie Pascual. Implementation and measurements of an efficient Fixed Point Adjoint. EUROGEN 2015, ECCOMAS, Sep 2015, GLASGOW, United Kingdom. ⟨hal-01244298⟩
122 View
97 Download

Share

Gmail Mastodon Facebook X LinkedIn More