Greedy replica exchange algorithm for heterogeneous computing grids
Replica exchange molecular dynamics (REMD) has become a valuable tool in studying complex biomolecular systems. However, its application on distributed computing grids is limited by the heterogeneity of this environment. In this study, we propose a REMD implementation referred to as greedy REMD (gREMD) suitable for computations on heterogeneous grids. To decentralize replica management, gREMD utilizes a precomputed schedule of exchange attempts between temperatures. Our comparison of gREMD against standard REMD suggests four main conclusions. First, gREMD accelerates grid REMD simulations by as much as 40 %. Second, gREMD increases CPU utilization rates in grid REMD by up to 60 %. Third, we argue that gREMD is expected to maintain approximately constant CPU utilization rates and simulation wall-clock times with the increase in the number of replicas. Finally, we show that gREMD correctly implements the REMD algorithm and reproduces the conformational ensemble of a short peptide sampled in our previous standard REMD simulations. We believe that gREMD can find its place in large-scale REMD simulations on heterogeneous computing grids.
KeywordsReplica exchange molecular dynamics Conformational sampling Distributed grid-based simulations Decentralized replica management Aβ peptide
This work was supported by the National Institute on Aging (National Institutes of Health) (grant R41 AG044022). The content is solely the responsibility of the authors and does not necessarily represent the official views of the National Institute on Aging or the National Institutes of Health.
- 27.Han M, Hansmann UHE (2011) Replica exchange molecular dynamics of the thermodynamics of fibril growth of Alzheimer’s Aβ42 peptide. J Chem Phys 135:065101Google Scholar