Vertex-ordering algorithms for automatic differentiation of computer codes

Computer Journal

Volumn 51, Issue 6, 2008, Pages 688-699

  Tadjouddine, E M ^a  

^a UNIVERSITY OF ABERDEEN   (United Kingdom)

Author keywords

Automatic Differentiation; Code reordering; Graph partitioning; Interface contraction; Vertex elimination

Indexed keywords

EID: 55449098880     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxm115     Document Type: Article

References (43)

1. Rall, L.B. (1981) Automatic Differentiation: Techniques and Applications, Lecture Notes in Computer Science, Vol. 120. Springer, Berlin.
2. Griewank, A. (2000) Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation, Frontiers in Applied Mathematics, Vol. 19. SIAM, Philadelphia, PA.
3. Tadjouddine, M., Forth, S.A. and Qin, N. (2005) Elimination AD applied to Jacobian assembly for an implicit compressible CFD solver. Int. J. Numer. Methods Fluids, 47, 1315-1321.
4. Bischof, C.H., Bücker, H.M., Lang, B. and Rasch, A. (2003) Solving large-scale optimization problems with EFCOSS. Adv. Eng. Softw., 34, 633-639.
5. Hascoët, L., Vázquez, M. and Dervieux, A. (2003) Automatic Differentiation for Optimum Design, Applied to Sonic Boom Reduction. Proc. ICCSA'2003, Montreal, Canada, May 18-21. Lecture Notes in Computer Science, Vol. 2668. Springer, Berlin.
6. Forth, S.A., Tadjouddine, M., Pryce, J.D. and Reid, J.K. (2004) Jacobian code generated by source transformation and vertex elimination can be as efficient as hand-coding. ACM Trans. Math. Softw., 30, 266-299.
7. Griewank, A. and Reese, S. (1991) 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, Philadelphia, PA.
8. Bischof, C.H. and Haghighat, MR. (1996) 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, Philadelphia, PA.
9. Tadjouddine, M., Bodman, F., Pryce, J.D. and Forth, S.A. (2005) Improving the Performance of the Vertex Elimination Algorithm for Derivative Calculation. In Bücker, M., Corliss, G., Hovland, P., Naumann, U. and Norris, B. (eds), Automatic Differentiation: Applications, Theory, and Implementations, Lecture Notes in Computational Science and Engineering, Vol. 50, 111-120. Springer, Berlin, Germany.
10. TR 0300 (2004) TAPENADE 2.1 User's Guide. INRIA Sophia Antipolis, Route des Lucioles, 09902 Sophia Antipolis, France.
11. Naumann, U. (1999) Efficient calculation of Jacobian matrices by optimized application of the chain rule to computational graphs. PhD Thesis, Technical University of Dresden.
12. Naumann, U. (2004) Optimal accumulation of Jacobian matrices by elimination methods on the dual computational graph. Math. Program. 99, 399-421.
13. Yannakakis, M. (1981) Computing the minimum fill-in is NP-complete. SIAM J. Alg. Disc. Meth., 2, 77-79.
14. Bornstein, C.F., Maggs, B.M. and Miller, G.L. (1999) Tradeoffs Between Parallelism and fill in Nested Dissection. SPAA'99: Proc. 11th Annual ACM Symp. on Parallel Algorithms and Architectures, Saint Malo, France, June 27-30, pp. 191-200. ACM Press, New York.
15. George, J. and Liu, J. (1978) An Automatic nested Dissection Algorithm for Irregular Finite Element Problems. SIAM J. Numer. Anal., 15 345-363.
16. Markowitz, H. (1957) The elimination form of the inverse and its application. Manage. Sci., 3, 257-269.
17. Amestoy, P., Davis, T. and Duff, I. (1996) An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl., 17, 886-905.
18. Goedecker, S. and Hoisie, A. (2001) Performance Optimization of Numerically Intensive Codes. SIAM, Philadelphia.
19. Tadjouddine, M., Forth, S.A., Pryce, J.D. and Reid, J.K. (2002) Performance Issues for Vertex Elimination Methods in Computing Jacobians Using Automatic Differentiation. Proc. 2nd Int. Conf. Computational Science, Amsterdam, The Netherlands, April 21-24, LNCS, Vol. 2330, 1077-1086. Springer, Berlin.
20. Gupta, A. (1997) Fast and effective algorithms for graph partitioning and sparse-matrix ordering. IBM J. Res. Dev., 41, 171-183.
21. Chapman, B. and Zima, H. (1991) Supercompilers for Parallel and Vector Computers. Addison-Wesley Publishing Company, Boston, USA.
22. TR 698 (1995) Combining Register Allocation and Instruction Scheduling: (Technical Summary). Courant Institute, New York University, New York, US.
23. GIT-CC-01-15 (2001) Cache Sensitive Instruction Scheduling. Center for Research in Embedded Systems and Technologies, Georgia Institute of Technology, Atlanta, Georgia.
24. Hennessy, J. and Gross, T. (1983) Postpass code optimization of pipeline constraints. ACM TOPLAS, 5, 422-448.
25. Palem, K. and Simons, B. (1993) Scheduling time-critical instructions on RISC machines. ACM TOPIAS, 15, 632-658.
26. Leung, A., Palem, K.V. and Ungureanu, C. (1997) Run-time versus compile-time instruction scheduling in superscalar (RISC) processors: Performance and trade-off. J. Parallel Dist. Comput., 45, 13-28.
27. AUCS/TR0702 (2007) Fast AD Jacobians by compact LU factorization. University of Aberdeen, Computing Sciences Departement, Aberdeen, AB243UE, UK.
28. Muchnick, S.S. (1997) Advanced Compiler Design and Implementation. Morgan Kaufmann Publishers, San Francisco, USA.
29. Bernstein, D. and Gertner, I. (1989) Scheduling expressions on a pipelined processor with a maximum delay of one cycle. ACM TOPLAS, 11, 57-66.
30. Colman, E. and Graham, R. (1972) Optimal scheduling for two-processor systems. Acta Informatica, 1, 200-213.
31. Gabow, H.N. and Tatjan, R.E. (1983) A Linear-Time Algorithm for a Special Case of Disjoint Set Union. ACM Symposium on Theory of Computing (STOC '83), Boston, MA, May 25-27, pp. 246-251. ACM Press, Baltimore, USA.
32. Iri, M. (1991) History of Automatic Differentiation and Rounding Estimation. In Griewank, A. and Corliss, G.F. (eds), Automatic Differentiation of Algorithms: Theory, Implementation, and Application 1- 16. SIAM, Philadelphia, PA.
33. Bücker, H.M. (2005) Looking for narrow interfaces in automatic differentiation using graph drawing. Future Gener. Comput. Syst., 21, 1418-1425.
34. Tadjouddine, M., Forth, S.A. and Pryce, J.D. (2003) Hierarchical Automatic Differentiation by Vertex Elimination and Source Transformation. Proc. ICCSA 2003, Montreal, Canada, May 18-21, Lecture Notes in Computer Science, Vol. 2668, pp. 115-124. Springer, Berlin.
35. Hendrickson, B. and Leland, R. (1995) A Multilevel Algorithm for Partitioning Graphs. Supercomputing'95 Proc. 1995 ACM/IEEE Supercomputing Conf, San Diego, CA, December 3-8. ACM Press, New York.
36. RR-1264-01 (2001) SCOTCH 3.4 User's Guide. LaBRI, Université de Bordeaux, 351 Cours de la Libération, 33405 Talence, France.
37. Karypis, G. and Kumar, V. (1998) Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Dist. Comput., 48, 96-129.
38. UC-405 (1999) CHACO: Algorithms and Software for Partitioning Meshes Computation, Computers, and Math Center, Sandia National Laboratories, Albuquerque, NM, US.
39. Liu, J.W.H. (1989) A graph partitioning algorithm by node separators. ACM Trans. Math. Softw., 15, 198-219.
40. Knuth, D.E. (1997) The Art of Computer Programming, Volume 1: Fundamental Algorithms. Addison-Wesley, Reading, MA.
41. Karypis, G. and Kumar, V. (1998) Multilevel Algorithms for Multi-constraint Graph Partitioning. Supercomputing '98 Proc. 1998 ACM/IEEE conf. Supercomputing, San Jose, CA, November 7-13, pp. 1-13. IEEE Computer Society, Washington, DC.
42. Simon, H.D. and Teng, S.-H. (1997) How good is recursive bisection? SIAM J. Sci. Comput., 18, 1436-1445.
43. Tadjouddine, M., Forth, S. and Qin, N. (2005) Automatic Differentiation of a Time-Dependent CFD Solver for Optimisation of a Synthetic Jet. Proc. Int. Conf. Numerical Analysis and Applied Maths, Rhodes, Greece, September 16-20, 514-517. Wiley-VCH, Berlin.