BibTeX
@ARTICLE{
         Tadjouddine2008VoA,
       author = "Tadjouddine, E. M.",
       title = "{Vertex-ordering Algorithms for Automatic Differentiation of Computer Codes}",
       journal = "The Computer Journal",
       volume = "51",
       number = "6",
       pages = "688--699",
       doi = "10.1093/comjnl/bxm115",
       year = "2008",
       abstract = "In the context of Automatic Differentiation (AD) of functions represented by
         computer code via the vertex elimination approach first advocated by Griewank and Reese (On the
         Calculation of Jacobian Matrices by the Markowitz Rule. In Griewank, A. and Corliss, G.F. (eds),
         Automatic Differentiation of Algorithms: Theory, Implementation and Application, pp. 126-135. SIAM,
         1991, Philadelphia, PA.), we present two approximate algorithms based on the linearized
         computational graph of the input code. The first is a statement-reordering algorithm aiming to tune
         the AD-generated code so as to maximize its performance for modern superscalar processors. The
         second is aimed at detecting interface contractions introduced by Bischof and Haghighat
         (Hierarchical Approaches to Automatic Differentiation. In Berz, M., Bischof, C., Corliss, G. and
         Griewank, A. (eds), Computational Differentiation: Techniques, Applications, and Tools, pp. 83-94.
         SIAM, 1996, Philadelphia, PA) in order to enable exploitation of the structure of the input code in
         the differentiation process. Performance data are also presented.",
       url = "http://comjnl.oxfordjournals.org/cgi/content/abstract/51/6/688",
       eprint = "http://comjnl.oxfordjournals.org/cgi/reprint/51/6/688.pdf",
       ad_theotech = "Hierarchical Approach"
}