TY - JOUR
T1 - Novel algorithms for massively parallel, long-term, simulation of molecular dynamics systems
AU - Fijany, Amir
AU - Çagin, Tahir
AU - Jaramillo-Botero, Andres
AU - Goddard, William
N1 - Funding Information:
The research of A.F. was performed at the Jet Propulsion Laboratory, California Institute of Technology (CIT), under contract with the National Aeronautics and Space Administration (NASA). The work of T.Ç. and W.A.G. is supported by NSFGCAG. The research by A.J.-B. was performed at the CIT during appointment as Visiting Associate with partial support from the Pontificia Universidad Javeriana, Cali, Colombia.
PY - 1998
Y1 - 1998
N2 - In this paper, a novel algorithm for solution of the constrained equations of motion with application to simulation of the molecular dynamics systems is presented. The algorithm enables the solution of equations of motion with an internal coordinates model wherein the high-frequency oscillations are frozen by explicit inclusion of hard constraints in the system as well as by clustering of atoms and, thus, allowing a much larger time step in the integration. For a molecular system with N clusters, the algorithm achieves the optimal sequential complexity of O(N). However, the main advantage of this new algorithm is its efficiency for massively parallel computation. In fact, this is the first known algorithm that achieves a both time- and processor-optimal parallel solution for the constrained equations of motion, i.e. an optimal computation time of O(logN) by using an optimal number of O(N) processors. In addition to its theoretical significance, this algorithm is also very efficient for practical implementation on the coarse grain MIMD parallel architectures owing to its highly decoupled computational structure.
AB - In this paper, a novel algorithm for solution of the constrained equations of motion with application to simulation of the molecular dynamics systems is presented. The algorithm enables the solution of equations of motion with an internal coordinates model wherein the high-frequency oscillations are frozen by explicit inclusion of hard constraints in the system as well as by clustering of atoms and, thus, allowing a much larger time step in the integration. For a molecular system with N clusters, the algorithm achieves the optimal sequential complexity of O(N). However, the main advantage of this new algorithm is its efficiency for massively parallel computation. In fact, this is the first known algorithm that achieves a both time- and processor-optimal parallel solution for the constrained equations of motion, i.e. an optimal computation time of O(logN) by using an optimal number of O(N) processors. In addition to its theoretical significance, this algorithm is also very efficient for practical implementation on the coarse grain MIMD parallel architectures owing to its highly decoupled computational structure.
KW - Constrained equations of motion
KW - Massively parallel computation
KW - Molecular dynamics simulation
UR - http://www.scopus.com/inward/record.url?scp=0032041150&partnerID=8YFLogxK
U2 - 10.1016/S0965-9978(98)00053-2
DO - 10.1016/S0965-9978(98)00053-2
M3 - Article
AN - SCOPUS:0032041150
SN - 0965-9978
VL - 29
SP - 441
EP - 450
JO - Advances in Engineering Software
JF - Advances in Engineering Software
IS - 3-6
ER -