Automatic generation of efficient adjoint code for a parallel navier-stokes solver

38Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Abstract. We describe key computational aspects of automatic differentiation applied to the global ocean state estimation problem. The task of minimizing a cost function measuring the ocean simulation vs. observation misfit is achieved through efficient calculation of the cost gradient w.r.t. a set of controls via the adjoint technique. The adjoint code of the parallel MIT general circulation model is generated using TAMC. To achieve a tractable problem in both CPU and memory requirements, despite the control flow reversal, the adjoint code relies heavily on the balancing of storing vs. recomputation via the checkpointing method. Further savings are achieved by exploiting self-adjointedness of part of the computation. To retain scalability of the domain decomposition, handwritten adjoint routines are provided which complement routines of the parallel support package (such as inter-processor communications, global operations, active variable I/O) to perform corresponding operations in reverse mode. The size of the problem is illustrated for the global ocean estimation problem and results are given by way of example. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Heimbach, P., Hill, C., & Giering, R. (2002). Automatic generation of efficient adjoint code for a parallel navier-stokes solver. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2330 LNCS, pp. 1019–1028). Springer Verlag. https://doi.org/10.1007/3-540-46080-2_107

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free