ICCS 2005: Computational Science – ICCS 2005 pp 155-164 | Cite as
Automated Operation Minimization of Tensor Contraction Expressions in Electronic Structure Calculations
Abstract
Complex tensor contraction expressions arise in accurate electronic structure models in quantum chemistry, such as the Coupled Cluster method. Transformations using algebraic properties of commutativity and associativity can be used to significantly decrease the number of arithmetic operations required for evaluation of these expressions, but the optimization problem is NP-hard. Operation minimization is an important optimization step for the Tensor Contraction Engine, a tool being developed for the automatic transformation of high-level tensor contraction expressions into efficient programs. In this paper, we develop an effective heuristic approach to the operation minimization problem, and demonstrate its effectiveness on tensor contraction expressions for coupled cluster equations.
References
- 1.Baumgartner, G., Auer, A., Bernholdt, D., Bibireata, A., Choppella, V., Cociorva, D., Gao, X., Harrison, R., Hirata, S., Krishnamoorthy, S., Krishnan, S., Lam, C., Lu, Q., Nooijen, M., Pitzer, R., Ramanujam, J., Sadayappan, P., Sibiryakov, A.: Synthesis of high-performance parallel programs for a class of ab initio quantum chemistry models. Proceedings of the IEEE 93(2), 276–292 (2005)CrossRefGoogle Scholar
- 2.Baumgartner, G., Bernholdt, D.E., Cociorva, D., Harrison, R., Hirata, S., Lam, C., Nooijen, M., Pitzer, R., Ramanujam, J., Sadayappan, P.: A high-level approach to synthesis of high-performance codes for quantum chemistry. In: Proc. of Supercomputing 2002 (November 2002)Google Scholar
- 3.Buchberger, B., Collins, G., Loos, R. (eds.): Computer Algebra: Symbolic and Algebraic Computation. Springer, New York (1983)Google Scholar
- 4.Fischer, C.N., LeBlanc Jr., R.J.: Crafting a Compiler. Benjamin/Cummings, New York (1991)Google Scholar
- 5.Hartono, A., Sibiryakov, A., Nooijen, M., Baumgartner, G., Bernholdt, D., Hirata, S., Lam, C., Pitzer, R., Ramanujam, J., Sadayappan, P.: Automated operation minimization of tensor contraction expressions in electronic structure calculations. Technical Report OSU-CISRC-2/05-TR10, Computer Science and Engineering Department, The Ohio State University (2005)Google Scholar
- 6.Kschischang, F., Frey, B., Loeliger, H.: Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory 47(2), 498–519 (2001)MATHCrossRefMathSciNetGoogle Scholar
- 7.Lam, C.: Performance Optimization of a Class of Loops Implementing Multi-Dimensional Integrals. PhD thesis, The Ohio State University, Columbus, OH (August 1999)Google Scholar
- 8.Lam, C., Sadayappan, P., Wenger, R.: On optimizing a class of multi-dimensional loops with reductions for parallel execution. Parallel Processing Letters 7(2), 157–168 (1997)CrossRefMathSciNetGoogle Scholar
- 9.Miller, E.K.: Solving bigger problems by decreasing the operation count and increasing computation bandwidth. Proceedings of the IEEE 79(10), 1493–1504 (1991)CrossRefGoogle Scholar
- 10.Scuseria, G.E., Janssen, C.L., Schaefer III, H.F.: An efficient reformulation of the closed-shell coupled cluster single and double excitation (CCSD) equations. The Journal of Chemical Physics 89(12), 7382–7387 (1988)CrossRefGoogle Scholar
- 11.Sibiryakov, A.: Operation Optimization of Tensor Contraction Expression. Master’s thesis, The Ohio State University, Columbus, OH (August 2004)Google Scholar
- 12.Stanton, J.F., Gauss, J., Watts, J.D., Bartlett, R.J.: A direct product decomposition approach for symmetry exploitation in many-body methods. I. Energy calculations. The Journal of Chemical Physics 94(6), 4334–4345 (1991)CrossRefGoogle Scholar
- 13.Winograd, S.: Arithmetic Complexity of Computations. Society for Industrial and Applied Mathematics, Philadelphia (1980)Google Scholar