Publication: Flattening Basic Blocks
Introduction
Applications
Tools
Research Groups
Workshops
Publications
   List Publications
   Advanced Search
   Info
   Add Publications
My Account
About

Flattening Basic Blocks

- incollection -
 

Author(s)
Jean Utke

Published in
Automatic Differentiation: Applications, Theory, and Implementations

Editor(s)
H. M. Bücker, G. Corliss, P. Hovland, U. Naumann, B. Norris

Year
2005

Publisher
Springer

Abstract
Preaccumulation of Jacobians of low-level code sections is beneficial in certain automatic differentiation application scenarios. Cross-country vertex, edge, or face elimination can produce highly efficient Jacobian preaccumulation code but requires the code section's computational graph to be known. Such graphs can easily be derived for straight-line codes with scalar variables. Practical codes in languages such as Fortran, C, and C++ with array indexing, pointers, and references introduce ambiguities. Constructing unambiguous computational graphs is necessary to realize the full potential of cross-country elimination. We give a practical solution and investigate theoretical options for graph construction.

Cross-References
Bucker2005ADA

AD Tools
OpenAD

AD Theory and Techniques
Computational Graph

BibTeX
@INCOLLECTION{
         Utke2005FBB,
       author = "Jean Utke",
       title = "Flattening Basic Blocks",
       editor = "H. M. B{\"u}cker and G. Corliss and P. Hovland and U. Naumann and B.
         Norris",
       booktitle = "Automatic Differentiation: {A}pplications, Theory, and Implementations",
       series = "Lecture Notes in Computational Science and Engineering",
       volume = "50",
       publisher = "Springer",
       year = "2005",
       abstract = "Preaccumulation of Jacobians of low-level code sections is beneficial in certain
         automatic differentiation application scenarios. Cross-country vertex, edge, or face elimination can
         produce highly efficient Jacobian preaccumulation code but requires the code section's
         computational graph to be known. Such graphs can easily be derived for straight-line codes with
         scalar variables. Practical codes in languages such as Fortran, C, and C++ with array indexing,
         pointers, and references introduce ambiguities. Constructing unambiguous computational graphs is
         necessary to realize the full potential of cross-country elimination. We give a practical solution
         and investigate theoretical options for graph construction.",
       crossref = "Bucker2005ADA",
       ad_tools = "OpenAD",
       ad_theotech = "Computational Graph",
       pages = "121--133",
       doi = "10.1007/3-540-28438-9_11"
}


back
  

Contact:
Username:
Password:
(lost password)