To achieve scalable parallel performance in molecular dynamics simulations, we have modeled and implemented several dynamic spatial domain decomposition algorithms. The modeling is based upon the bulk synchronous parallel architecture model (BSP), which describes supersteps of computation, communica
Dynamic-domain-decomposition parallel molecular dynamics
✍ Scribed by S.G. Srinivasan; I. Ashok; Hannes Jônsson; Gretchen Kalonji; John Zahorjan
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 1003 KB
- Volume
- 102
- Category
- Article
- ISSN
- 0010-4655
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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 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 n
Molecular dynamics simulation is a class of applications that require reducing the execution time of fixed-size problems. This reduction in execution time is important to drug design and protein interaction studies. Many implementations of parallel molecular dynamics have been developed, but very li