Algorithm improvements for molecular dynamics simulations

Wiley Interdisciplinary Reviews Computational Molecular Science2011Vol. 1(1), pp. 93–108

Citations Over TimeTop 10% of 2011 papers

Abstract

Abstract High‐performance implementations of molecular dynamics (MD) simulations play an important role in the study of macromolecules. Recent advances in both hardware and simulation software have extended the accessible time scales significantly, but the more complex algorithms used in many codes today occasionally make it difficult to understand the program flow and data structures without at least some knowledge about the underlying ideas used to improve performance. In this review, we discuss some of the currently most important areas of algorithm improvement to accelerate MD, including floating‐point maths, techniques to accelerate nonbonded interactions, and methods to allow multiple or extended time steps. There is also a strong trend of increased parallelization on different levels, including both distributed memory domain decomposition, stream processing algorithms running, e.g., on graphics processing units hardware, and last but not least techniques to decouple simulations to enable massive parallelism on next‐generation supercomputers or distributed computing. We describe some of the impacts these algorithms are having in current performance, and also how we believe they can be combined in the future. © 2011 John Wiley & Sons, Ltd. WIREs Comput Mol Sci 2011 1 93–108 DOI: 10.1002/wcms.3 This article is categorized under: Structure and Mechanism > Molecular Structures Computer and Information Science > Computer Algorithms and Programming Molecular and Statistical Mechanics > Molecular Dynamics and Monte-Carlo Methods

Citations Over TimeTop 10% of 2011 papers

Abstract

Related Papers