Identifying Cost-Effective Common Subexpressions to Reduce Operation Count in Tensor Contraction Evaluations

  title={Identifying Cost-Effective Common Subexpressions to Reduce Operation Count in Tensor Contraction Evaluations},
  author={Albert Hartono and Qingda Lu and X. Gao and S. Krishnamoorthy and M. Nooijen and G. Baumgartner and D. Bernholdt and Venkatesh Choppella and R. Pitzer and J. Ramanujam and A. Rountev and P. Sadayappan},
  booktitle={International Conference on Computational Science},
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. Operation minimization is an important optimization step for the Tensor Contraction Engine, a tool being developed for the automatic transformation of high… Expand
15 Citations
A framework for load balancing of Tensor Contraction expressions via dynamic task partitioning
Generating Efficient Tensor Contractions for GPUs
Fast Search of the Optimal Contraction Sequence in Tensor Networks
TSFC: a structure-preserving form compiler
GLORE: generalized loop redundancy elimination upon LER-notation


Automated Operation Minimization of Tensor Contraction Expressions in Electronic Structure Calculations
Automatic code generation for many-body electronic structure methods: the tensor contraction engine
On Optimizing a Class of Multi-Dimensional Loops with Reductions for Parallel Execution
Synthesis of High-Performance Parallel Programs for a Class of ab Initio Quantum Chemistry Models
Precise call graph construction in the presence of function pointers
Precise identification of side-effect-free methods in Java
  • A. Rountev
  • Computer Science
  • 20th IEEE International Conference on Software Maintenance, 2004. Proceedings.
  • 2004