On syntax-directed adjoint fortran code

  • Naumann U
  • Riehme J
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Gradients of high-dimensional functions can be computed efficiently and with machine accuracy by so-called adjoint codes. We present an L-attributed grammar for the single-pass generation of intraprocedural adjoint code for a subset of Fortran. Our aim is to integrate the syntax directed approach into the front-end of the NAGWare Fortran compiler. Research prototypes of this compiler that build adjoint code based on an abstract intermediate representation have been developed for several years. We consider the syntax-directed generation of adjoint code as a low development cost alternative to more sophisticated algorithms. The price to pay comes in form of a very limited set of code optimizations that can be performed in a single-pass setting.nema

Cite

CITATION STYLE

APA

Naumann, U., & Riehme, J. (2007). On syntax-directed adjoint fortran code. Computer Science and Information Systems, 4(2), 47–64. https://doi.org/10.2298/csis0702047n

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