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

@inproceedings{Hartono2006IdentifyingCC, 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}, year={2006} }

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

Effective Utilization of Tensor Symmetry in Operation Optimization of Tensor Contraction Expressions

- Computer Science
- 2012

A framework for load balancing of Tensor Contraction expressions via dynamic task partitioning

- Computer Science
- 2013 SC - International Conference for High Performance Computing, Networking, Storage and Analysis (SC)
- 2013

Generating Efficient Tensor Contractions for GPUs

- Computer Science
- 2015 44th International Conference on Parallel Processing
- 2015

Fast Search of the Optimal Contraction Sequence in Tensor Networks

- Computer Science
- IEEE Journal of Selected Topics in Signal Processing
- 2021

TSFC: a structure-preserving form compiler

- Mathematics, Computer Science
- SIAM J. Sci. Comput.
- 2018

A fully simultaneously optimizing genetic approach to the highly excited coupled-cluster factorization problem.

- Computer Science, Medicine
- The Journal of chemical physics
- 2011

GLORE: generalized loop redundancy elimination upon LER-notation

- Computer Science
- Proc. ACM Program. Lang.
- 2017

#### References

SHOWING 1-10 OF 35 REFERENCES

Automated Operation Minimization of Tensor Contraction Expressions in Electronic Structure Calculations

- Computer Science
- International Conference on Computational Science
- 2005

Automatic code generation for many-body electronic structure methods: the tensor contraction engine

- Computer Science
- 2006

A direct product decomposition approach for symmetry exploitation in many-body methods. I. Energy calculations

- Chemistry
- 1991

On Optimizing a Class of Multi-Dimensional Loops with Reductions for Parallel Execution

- Mathematics, Computer Science
- Parallel Process. Lett.
- 1997

Synthesis of High-Performance Parallel Programs for a Class of ab Initio Quantum Chemistry Models

- Computer Science
- Proceedings of the IEEE
- 2005

Precise call graph construction in the presence of function pointers

- Computer Science
- Proceedings. Second IEEE International Workshop on Source Code Analysis and Manipulation
- 2002

A direct atomic orbital driven implementation of the coupled cluster singles and doubles (CCSD) model

- Chemistry
- 1994

Precise identification of side-effect-free methods in Java

- Computer Science
- 20th IEEE International Conference on Software Maintenance, 2004. Proceedings.
- 2004