The distributed data SCF

被引:27
作者
Alexeev, Y
Kendall, RA
Gordon, MS [1 ]
机构
[1] Iowa State Univ, Dept Chem, Ames, IA 50011 USA
[2] Ames Lab, Scalable Comp Lab, Ames, IA 50011 USA
基金
美国能源部;
关键词
quantum chemistry; cluster computing; self consistent field; distributed data interface; nonuniform memory access; dynamic load balancing;
D O I
10.1016/S0010-4655(01)00439-8
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper describes a distributed data parallel SCF algorithm. The distinguishing features of this algorithm are: (a) columns of density and Fock matrices are distributed evenly among processors, (b) pair-wise dynamic load balancing is developed to achieve excellent load balance, (c) network communication time is minimized via careful analysis of data flow in the SCF algorithm. The developed performance models and benchmarking results illustrate good performance of the distributed data SCF algorithm. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:69 / 82
页数:14
相关论文
共 29 条
[1]  
Almlof J., 1994, LECT NOTES QUANTUM C, P1
[2]  
[Anonymous], 1995, Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering
[3]  
BADER DA, 2000, PARALLEL PROGRAMMING
[4]  
Chandra R., 2000, Parallel Programming in OpenMP
[5]  
Cormen TH, 1999, INTRO ALGORITHMS
[6]  
DACHSEL H, 1998, P SC
[7]   Coupling of large-amplitude side chain motions to the excited-state H-atom transfer of perylene quinones: Application of theory and experiment to calphostin C [J].
Datta, A ;
Bandyopadhyay, P ;
Wen, J ;
Petrich, JW ;
Gordon, MS .
JOURNAL OF PHYSICAL CHEMISTRY A, 2001, 105 (06) :1057-1060
[8]   HYPERICIN AND ITS PHOTODYNAMIC-ACTION [J].
DURAN, N ;
SONG, PS .
PHOTOCHEMISTRY AND PHOTOBIOLOGY, 1986, 43 (06) :677-680
[9]   Developments in parallel electronic structure theory [J].
Fletcher, GD ;
Schmidt, MW ;
Gordon, MS .
ADVANCES IN CHEMICAL PHYSICS, VOL 110, 1999, 110 :267-294
[10]   The Distributed Data Interface in GAMESS [J].
Fletcher, GD ;
Schmidt, MW ;
Bode, BM ;
Gordon, MS .
COMPUTER PHYSICS COMMUNICATIONS, 2000, 128 (1-2) :190-200