首页> 外文会议>International Conference on Computational Science(ICCS 2006) pt.1; 20060528-31; Reading(GB) >Identifying Cost-Effective Common Subexpressions to Reduce Operation Count in Tensor Contraction Evaluations
【24h】

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

机译:确定具有成本效益的常用子表达式以减少张量收缩评估中的运算次数

获取原文
获取原文并翻译 | 示例

摘要

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-level tensor contraction expressions into efficient programs. The identification of common subexpressions among a set of tensor contraction expressions can result in a reduction of the total number of operations required to evaluate the tensor contractions. In this paper, we develop an effective algorithm for common subexpression identification and demonstrate its effectiveness on tensor contraction expressions for coupled cluster equations.
机译:复杂的张量收缩表达式出现在量子化学的精确电子结构模型中,例如耦合簇方法。使用可交换性和关联性的代数性质进行的变换可用于显着减少评估这些表达式所需的算术运算次数。最小化操作是Tensor Contracting Engine的重要优化步骤,Tensor Contracting Engine是为将高级张量收缩表达式自动转换为有效程序而开发的工具。一组张量收缩表达式中的公共子表达式的标识可以导致评估张量收缩所需的操作总数减少。在本文中,我们开发了一种有效的用于常见子表达式识别的算法,并证明了其在耦合簇方程的张量收缩表达式中的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号