We describe an adaptive method for achieving load balance in parallel computations simulating phenomena which are distributed over a spatially extended region, but are local in nature. We have tested the method on standard short-ranged parallel molecular dynamics calculations. The performance gain w
The distributed diagonal force decomposition method for parallelizing molecular dynamics simulations
✍ Scribed by Urban Borštnik; Benjamin T. Miller; Bernard R. Brooks; Dušanka Janežič
- Publisher
- John Wiley and Sons
- Year
- 2011
- Tongue
- English
- Weight
- 547 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0192-8651
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
Parallelization is an effective way to reduce the computational time needed for molecular dynamics simulations. We describe a new parallelization method, the distributed‐diagonal force decomposition method, with which we extend and improve the existing force decomposition methods. Our new method requires less data communication during molecular dynamics simulations than replicated data and current force decomposition methods, increasing the parallel efficiency. It also dynamically load‐balances the processors' computational load throughout the simulation. The method is readily implemented in existing molecular dynamics codes and it has been incorporated into the CHARMM program, allowing its immediate use in conjunction with the many molecular dynamics simulation techniques that are already present in the program. We also present the design of the Force Decomposition Machine, a cluster of personal computers and networks that is tailored to running molecular dynamics simulations using the distributed diagonal force decomposition method. The design is expandable and provides various degrees of fault resilience. This approach is easily adaptable to computers with Graphics Processing Units because it is independent of the processor type being used. © 2011 Wiley Periodicals, Inc. J Comput Chem, 2011
📜 SIMILAR VOLUMES
The parallel solution of large sets of equations derived from finite element or finite difference methods often involves the use of domain decomposition methods. This paper is concerned with the related problem of mapping subdomain partitioning to a processor topology in such a way that the communic
## Abstract We describe two algorithms for the parallel calculation of a CHARMm‐like force field in macromolecules. For a molecule with a given number of atoms, we show that there is an optimal number of processors leading to a minimum computation time. At the optimum, both the number of processors
In this article, we describe a domain decomposition method for the efficient parallel computation of nonbonded forces and energies in condensed-phase molecular systems. This decomposition is based upon the monotonic logical grid (MLG) approach of Boris [J. Boris, 1. Comp. Phys., 66, 1 (1986)l and yi
## 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 ev