𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A massively parallel molecular dynamics algorithm for the MasPar supercomputer

✍ Scribed by S. Pickering; I.K. Snook

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
749 KB
Volume
108
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

✦ Synopsis

Massively parallel computers are emerging as a valuable tool for supercomputer applications. Their processing speed and memory size makes them ideal for solving large applications. An implementation of a molecular dynamics simulation using a neighbour list type algorithm is presented. By efficient use and understanding of the architecture, an extremely efficient neighbour list algorithm (without the need to store the list) has been developed. The large number of processors has allowed us to model large samples (up to one million atoms), reducing the artefacts which may be caused by having a small sample size. This implementation has provided performance results that surpass those of standard machines. The improvements are by factors of hundreds in terms of speed of calculation, and the sizes of the systems that carl be modelled. @

πŸ“œ SIMILAR VOLUMES

Molecular dynamics for very large system
Molecular dynamics for very large systems on massively parallel computers: The MPSim program
✍ Lim, Kian-Tat; Brunett, Sharon; Iotov, Mihail; McClurg, Richard B.; Vaidehi, Nag πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 377 KB πŸ‘ 1 views

We describe the implementation of the cell multipole method CMM in a Ε½ . Ε½ . complete molecular dynamics MD simulation program MPSim for massively parallel supercomputers. Tests are made of how the program scales with size Ε½ . Ε½ . linearly and with number of CPUs nearly linearly in applications invo

Protein calculations on parallel process
Protein calculations on parallel processors. II. Parallel algorithm for the forces and molecular dynamics
✍ J.F. Janak; P.C. Pattnaik πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 456 KB

## 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

Accelerated molecular dynamics simulatio
Accelerated molecular dynamics simulation with the parallel fast multipole algorithm
✍ John A. Board Jr.; Jeffrey W. Causey; James F. Leathrum Jr.; Andreas Windemuth; πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 421 KB

We have implemented the fast multipole algorithm (FMA) of Greengard and Rokhlin and incorporated it into the molecular dynamics program MD of Windemuth and Schulten, allowing rapid computation of the non-bonded forces acting in dynamical protein systems without truncation or other corruption of the