Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently—those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers--the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and a 1840-node Intel Paragon performs up to 165 faster than a single Cray C9O processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.

Fast parallel algorithms for short-range molecular dynamics

다중혈관 관상동맥 환자에서 y-문합을 이용하여 양쪽 내흉동맥만을 사용한 우회술의 조기 성적

Molecular simulation is an extremely useful, but computationally very expensive tool for studies of chemical and biomolecular systems Here, we present a new implementation of our molecular simulation toolkit GROMACS which now both achieves extremely high performance on single processors from algorithmic optimizations and hand-coded routines and simultaneously scales very well on parallel machines The code encompasses a minimal-communication domain decomposition algorithm, full dynamic load balancing, a state-of-the-art parallel constraint solver, and efficient virtual site algorithms that allow removal of hydrogen atom degrees of freedom to enable integration time steps up to 5 fs for atomistic simulations also in parallel To improve the scaling properties of the common particle mesh Ewald electrostatics algorithms, we have in addition used a Multiple-Program, Multiple-Data approach, with separate node domains responsible for direct and reciprocal space interactions Not only does this combination of a

/pdf/gromacs-4-algorithms-for-highly-efficient-load-balanced-and-16xnd83poh.pdf

GROMACS 4: Algorithms for highly efficient, load-balanced, and scalable molecular simulation

/pdf/scalable-molecular-dynamics-with-namd-3j7xyc70g4.pdf

Scalable Molecular Dynamics with NAMD

http://kth.diva-portal.org/smash/get/diva2:1303357/FULLTEXT01

GROMACS: High performance molecular simulations through multi-level parallelism from laptops to supercomputers

Distributed computation of multiple body interactions in a region uses multiple processing modules, where each of the processing modules is associated with a respective corresponding portion of the region. In some examples, the approach includes establishing multiple coordinate frames of reference, each processing module corresponding to one the coordinate frames of reference. In some examples, efficient techniques are used for selecting elements for computation of interactions according at least in part to a separation-based criterion.

Distributed computation of multiple-body interactions using local-coordinate reference frames

PROBLEM TO BE SOLVED: To reduce overall computation time required for simulation of multiple-body interaction.SOLUTION: A generalized approach to particle interaction may have advantages which are superior to a previously described method related to one or more of communication bandwidth, latency, and memory access characteristics. These generalizations can involve one or more of at least spatial decomposition, import region rounding, and multiple zone communication scheduling. In a parallel implementation, the generalized approach has advantage that the communication bandwidth required by several instances of the approach come close to or achieve an approximate lower limit for the communication bandwidth. In a serial processing implementation, memory latency in processing is substantially reduced by effective cache utilization.

Method for determining calculation unit for calculating multiple-body interaction

A generalized approach to particle interaction can confer advantages over previously described method in terms of one or more of communications bandwidth and latency and memory access characteristics. These generalizations can involve one or more of at least spatial decomposition, import region rounding, and multiple zone communication scheduling. An architecture for computation of particle interactions makes use various forms of parallelism. In one implementation, the parallelism involves using multiple computation nodes arranged according to a geometric partitioning of a simulation volume.

Kevin J. Bowers

Papers

Distributed computation of multiple-body interactions using local-coordinate reference frames

Method for determining calculation unit for calculating multiple-body interaction

WITHDRAWN PATENT AS PER THE LATEST USPTO WITHDRAWN LISTApproaches and architectures for computation of particle interactions

Selection-based criteria for computation of multiple body interactions

Kevin J. Bowers

Papers

Distributed computation of multiple-body interactions using local-coordinate reference frames

Method for determining calculation unit for calculating multiple-body interaction

***WITHDRAWN PATENT AS PER THE LATEST USPTO WITHDRAWN LIST***Approaches and architectures for computation of particle interactions

Selection-based criteria for computation of multiple body interactions

WITHDRAWN PATENT AS PER THE LATEST USPTO WITHDRAWN LISTApproaches and architectures for computation of particle interactions