SIMPLE AND EFFICIENT ALGORITHM FOR LARGE SCALE MOLECULAR DYNAMICS SIMULATION IN HARD DISK SYSTEM

@article{Isobe1999SIMPLEAE,
  title={SIMPLE AND EFFICIENT ALGORITHM FOR LARGE SCALE MOLECULAR DYNAMICS SIMULATION IN HARD DISK SYSTEM},
  author={Masaharu Isobe},
  journal={International Journal of Modern Physics C},
  year={1999},
  volume={10},
  pages={1281-1293}
}
  • M. Isobe
  • Published 17 July 1999
  • Computer Science
  • International Journal of Modern Physics C
A simple and efficient algorithm of the molecular-dynamics simulation of the hard disk system based on the Event-Driven method is developed. From the analysis of algorithm, the complexity is ${\mathcal O} (\log N)$ per 1 event, and the constant coefficient of the complexity is smaller than conventional efficient algorithm based on the concept of Cell-Crossing Event. The maximum performance of more than 460 millions of collisions per CPU-hour on the Alpha600 compatible in a 2500 particle system… 

Figures and Tables from this paper

Speculative and distributed simulation of many-particle collision systems

To overcome the strong event dependency nature in particle collision simulations, a speculative execution scheme is proposed to exploit parallelism to solve the scalability problem by taking advantage of the availability of commodity computers.

A GENERALIZED CELL METHOD FOR HARD DISK MOLECULAR DYNAMICS SIMULATION OF POLYDISPERSE SYSTEMS

Hard Disk Molecular Dynamics (HDMD) techniques often exhibit significant loss in calculation speed when applied to the simulation of highly polydisperse particle systems. The collision rate of the

Event-chain Monte Carlo algorithms for hard-sphere systems.

Numerical simulations show that event-chain algorithms clearly outperform the conventional Metropolis method, and reversible versions of the algorithms, which violate detailed balance, improve the speed of the method even further.

Hard sphere simulation in statistical physics — methodologies and applications

The hard disk/sphere systems are one of the most important models to investigate fundamental problems in the field of statistical physics. From the numerical point of view, simulation results on the

Efficient equilibration of hard spheres with Newtonian event chains.

The core concepts of molecular dynamics and event chains are combined into a new algorithm involving Newtonian event chains that outperform other algorithms in the simulation of hard spheres and other hard particles.

Sampling from a polytope and hard-disk Monte Carlo

The hard-disk problem, the statics and the dynamics of equal two-dimensional hard spheres in a periodic box, has had a profound influence on statistical and computational physics. Markov-chain Monte

Synchronization on Speculative Parallelization of Many-Particle Collision Simulation ∗

A new synchronization scheme is proposed that aims at improving the simulation efficiency by relaxing the requirements for locks when executing events by multiple threads by reducing overheads of common shared resources and data.

Accelerated Simulation of a Heavy Particle in a Gas of Elastic Spheres

A new, accelerated algorithm for a system of elastic hard spheres in which one of the particles is significantly heavier than the others is presented, and it is shown that these coefficients can be calculated on the fly using short-time event-driven simulations, thereby allowing to simulate the stochastic differential equation for the colloid.

References

SHOWING 1-10 OF 34 REFERENCES

Efficient algorithms for many-body hard particle molecular dynamics

This paper proposes a strategy--for the simulation of hard particle systems--that is efficient, memory saving, and easy to understand and to program, and it is seen that the proposed algorithm is efficient for a wide density range.

The event scheduling problem in molecular dynamic simulation

A Vectorized Algorithm for Molecular Dynamics of Short Range Interacting Particles

A lattice based algorithm, completely vectorized for molecular dynamics simulations, that works very effectively when the particles have short range interaction, but it is applicable to each kind of interaction.

VECTORIZED AND PARALLELIZED ALGORITHMS FOR MULTI-MILLION PARTICLE MD-SIMULATION

Results for the Cray YMP, JAERI/NEC MONTE-4 vector computers and the Intel Paragon XP/S and Thinking Machine CM-5 parallel computers are presented, making the simulation of million particle systems possible.

Analysis of an efficient algorithm for the hard-sphere problem

Both an empirical and analytic analysis of HAD's performance are presented which show that HAD scales well and the design differences of these algorithms are compared to RAP, LUB and HYBRID.

Studies in Molecular Dynamics. I. General Method

A method is outlined by which it is possible to calculate exactly the behavior of several hundred interacting classical particles so that the solution of many problems in both equilibrium and nonequilibrium statistical mechanics is discussed.

Studies in Molecular Dynamics. II. Behavior of a Small Number of Elastic Spheres

The equation of state and the collision rate for systems ranging in size from four to 500 particles are described. The dependence of the results on the number of particles is qualitatively discussed

The Art of Molecular Dynamics Simulation

From the Publisher: This book describes the extremely powerful technique of molecular dynamics simulation, which involves solving the classical many-body problem in contexts relevant to the study of