Space-time trade-off optimization for a class of electronic structure calculations

被引:14
作者
Cociorva, D [1 ]
Baumgartner, G
Lam, CC
Sadayappan, P
Ramanujam, J
Nooijen, M
Bernholdt, DE
Harrison, R
机构
[1] Ohio State Univ, Dept Comp & Informat Sci, Columbus, OH 43210 USA
[2] Louisiana State Univ, Dept Elect & Comp Engn, Baton Rouge, LA 70803 USA
[3] Princeton Univ, Dept Chem, Princeton, NJ 08544 USA
[4] Oak Ridge Natl Lab, Oak Ridge, TN 37831 USA
[5] Pacific NW Natl Lab, Richland, WA 99352 USA
关键词
algorithms; loop fusion; loop transformation; tile size selection;
D O I
10.1145/543552.512551
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The accurate modeling of the electronic structure of atoms and molecules is very computationally intensive. Many models of electronic structure, such as the Coupled Cluster approach, involve collections of tensor contractions. There are usually a large number of alternative ways of implementing the tensor contractions, representing different trade-offs between the space required for temporary intermediates and the total number of arithmetic operations. In this paper, we present an algorithm that starts with an operation-minimal form of the computation and systematically explores the possible space-time trade-offs to identify the form with lowest cost that fits within a specified memory limit. Its utility is demonstrated by applying it to a computation representative of a component in the CCSD(T) formulation in the NWChem quantum chemistry suite from Pacific Northwest National Laboratory.
引用
收藏
页码:177 / 186
页数:10
相关论文
共 25 条
[1]  
Aulbur W. G., 1996, THESIS OHIO STATE U
[2]  
CALLAHAN D, 1990, SIGPLAN C PROGR LANG
[3]  
COCIORVA D, 2001, 15 ACM INT C SUP SOR, P500
[4]  
COCIORVA D, 2001, INT C HIGH PERF COMP
[5]  
DARTE A, 1999, INT C PAR ARCH COMP
[6]  
DING C, 2000, THESIS RICE U
[7]  
FRABOULET A, 1999, 12 INT S SYST SYNTH, P71
[8]  
GAO G, 1992, LANGUAGES COMPILERS
[9]  
GUIBAS LJ, 1978, 5 ANN ACM S PRINC PR, P1
[10]  
*HIGH PERF COMP CH, 1999, NWCHEM COMP CHEM PAC