Algorithmic differentiation of code with multiple context-specific activities
Résumé
Algorithmic differentiation (AD) by source-transformation is an established method for computing derivatives of computational algorithms. Static data-flow analysis is commonly used by AD tools to determine the set of active variables, that is, variables that are influenced by the program input in a differentiable way and have a differentiable influence on the program output. In this work, a context-sensitive static analysis combined with procedure cloning is used to generate specialised versions of differentiated procedures for each call site. This enables better detection and elimination of unused computations and memory storage, resulting in performance improvements of the generated code, in both forward and reverse mode AD. The implications of this multi-activity AD approach on the static analysis of an AD tool is shown using data flow equations. The worst-case cost of multi-activity AD on the differentiation process is analysed and practical remedies to avoid running into this worst-case are presented. The method was implemented in the AD tool Tapenade, and we present its application to a 3D unstructured compressible flow solver, for which we generate an adjoint solver that performs significantly faster when multi-activity AD is used.
Mots clés
CCS Concepts: •Mathematics of computing → Automatic differentiation
•Software and its engineering → Automated static analysis
Source code generation
Additional Key Words and Phrases: Algorithmic differentiation
automatic differentiation
source transformation
Activity analysis
static analysis
reverse mode
adjoint
tangent-linear
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...