SHAKE parallelization

被引:94
作者
Elber, R. [1 ]
Ruymgaart, A. P. [1 ]
Hess, B. [2 ]
机构
[1] Univ Texas Austin, Dept Chem & Biochem, Inst Computat Engn & Sci, Austin, TX 78712 USA
[2] Albanova Univ Ctr, KTH Royal Inst Technol, Dept Theoret Phys, S-10691 Stockholm, Sweden
关键词
LINEAR CONSTRAINT SOLVER; MOLECULAR-DYNAMICS; SIMULATIONS; MACROMOLECULES; ALGORITHMS; COMPUTERS; ALKANES; LINCS;
D O I
10.1140/epjst/e2011-01525-9
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
SHAKE is a widely used algorithm to impose general holonomic constraints during molecular simulations. By imposing constraints on stiff degrees of freedom that require integration with small time steps (without the constraints) we are able to calculate trajectories with time steps larger by approximately a factor of two. The larger time step makes it possible to run longer simulations. Another approach to extend the scope of Molecular Dynamics is parallelization. Parallelization speeds up the calculation of the forces between the atoms and makes it possible to compute longer trajectories with better statistics for thermodynamic and kinetic averages. A combination of SHAKE and parallelism is therefore highly desired. Unfortunately, the most widely used SHAKE algorithm (of bond relaxation) is inappropriate for parallelization and alternatives are needed. The alternatives must minimize communication, lead to good load balancing, and offer significantly better performance than the bond relaxation approach. The algorithm should also scale with the number of processors. We describe the theory behind different implementations of constrained dynamics on parallel systems, and their implementation on common architectures.
引用
收藏
页码:211 / 223
页数:13
相关论文
共 20 条
  • [2] [Anonymous], 1999, NUMERICAL OPTIMIZATI, DOI DOI 10.1007/B98874
  • [3] Efficient constraint dynamics using MILC SHAKE
    Bailey, A. G.
    Lowe, C. P.
    Sutton, A. P.
    [J]. JOURNAL OF COMPUTATIONAL PHYSICS, 2008, 227 (20) : 8949 - 8959
  • [4] MILCH SHAKE: An Efficient Method for Constraint Dynamics Applied to Alkanes
    Bailey, A. G.
    Lowe, C. P.
    [J]. JOURNAL OF COMPUTATIONAL CHEMISTRY, 2009, 30 (15) : 2485 - 2493
  • [5] ALGORITHMS FOR CONSTRAINED MOLECULAR-DYNAMICS
    BARTH, E
    KUCZERA, K
    LEIMKUHLER, B
    SKEEL, RD
    [J]. JOURNAL OF COMPUTATIONAL CHEMISTRY, 1995, 16 (10) : 1192 - 1209
  • [6] Bowers K. J., 2006, SCI COMPUTING
  • [7] AMBERCUBE MD, PARALLELIZATION OF AMBERS MOLECULAR-DYNAMICS MODULE FOR DISTRIBUTED-MEMORY HYPERCUBE COMPUTERS
    DEBOLT, SE
    KOLLMAN, PA
    [J]. JOURNAL OF COMPUTATIONAL CHEMISTRY, 1993, 14 (03) : 312 - 329
  • [8] Constant Constraint Matrix Approximation: A Robust, Parallelizable Constraint Method for Molecular Simulations
    Eastman, Peter
    Pander, Vijay S.
    [J]. JOURNAL OF CHEMICAL THEORY AND COMPUTATION, 2010, 6 (02) : 434 - 437
  • [9] MOIL - A PROGRAM FOR SIMULATIONS OF MACROMOLECULES
    ELBER, R
    ROITBERG, A
    SIMMERLING, C
    GOLDSTEIN, R
    LI, HY
    VERKHIVKER, G
    KEASAR, C
    ZHANG, J
    ULITSKY, A
    [J]. COMPUTER PHYSICS COMMUNICATIONS, 1995, 91 (1-3) : 159 - 189
  • [10] Fletcher R., 2000, PRACTICAL METHODS OP, V2nd ed., P436, DOI [10.1002/9781118723203, DOI 10.1002/9781118723203]