Abstract

Abstract A detailed description of vector/parallel algorithms for the molecular dynamics (MD) simulation of macromolecular systems on multiple processor, shared‐memory computers is presented. The algorithms encompass three computationally intensive portions of typical MD programs: ( 1 ) the evaluation of the potential energies and forces, ( 2 ) the generation of the nonbonded neighbor list, and ( 3 ) the satisfaction of holonomic constraints. We implemented the algorithms into two standard programs; CHARMM and AMBER, and obtained near linear speedups on eight processors of a Cray Y‐MP for cases ( 1 ) and ( 2 ). For case ( 3 ) the SHAKE method demonstrated a speedup of 6.0 on eight processors while the matrix inversion method demonstrated 6.4. For a system of water molecules the performance improvement over the standard scalar SHAKE subroutine in AMBER ranged from a factor of 165 to greater than 2000.

Keywords

SpeedupComputer scienceSubroutineMolecular dynamicsParallel computingAlgorithmShakeInversion (geology)Shared memoryComputational scienceChemistryComputational chemistryPhysics

Affiliated Institutions

Related Publications

Publication Info

Year
1991
Type
article
Volume
12
Issue
10
Pages
1270-1277
Citations
71
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

71
OpenAlex

Cite This

John E. Mertz, Douglas J. Tobias, Charles L. Brooks et al. (1991). Vector and parallel algorithms for the molecular dynamics simulation of macromolecules on shared‐memory computers. Journal of Computational Chemistry , 12 (10) , 1270-1277. https://doi.org/10.1002/jcc.540121016

Identifiers

DOI
10.1002/jcc.540121016