Analysis of an efficient algorithm for the hard-sphere problem

Authors:
Alan T. Krantz
Affiliations:
Univ. of Colorado, Boulder
Venue:
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Year:
1996

Citing 6
Cited 6

Molecular dynamics simulation of flow past a plaste

Journal of Scientific Computing
Exploiting Physical Parallelism Using Supercomputers: Two Examples from Chemical Physics

Computer
Computer simulation of liquids

Computer simulation of liquids
Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem

Communications of the ACM
Efficient algorithms for many-body hard particle molecular dynamics

Journal of Computational Physics
An efficient algorithm for the hard-sphere problem

An efficient algorithm for the hard-sphere problem

Optimization Techniques in an Event-Driven Simulation of a Shaker Ball Mill

ICCS '02 Proceedings of the International Conference on Computational Science-Part III
Empirical Studies of Optimization Techniques in the Event-Driven Simulation of Mechanically Alloyed Materials

The Journal of Supercomputing
Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles. I. Algorithmic details

Journal of Computational Physics
A Complexity O(1) priority queue for event driven molecular dynamics simulations

Journal of Computational Physics
Parallel discrete molecular dynamics simulation with speculation and in-order commitment

Journal of Computational Physics
Reversible simulations of elastic collisions

ACM Transactions on Modeling and Computer Simulation (TOMACS)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Many similar algorithms for performing simulations of hard-sphere have been presented. Among these algorithms are those designed by Rapaport (RAP), Lubachevsky (LUB), Krantz (HAD), and Marin (HYBRID). These algorithms exhibit a similar design in that they each use an O(logn) event queue which becomes the overwhelming bottleneck when simulating large systems. In this paper the design of HAD is presented and contrasted to RAP, LUB and HYBRID. Next, both an empirical and analytic analysis of HAD's performance are presented which show that HAD scales well. Finally, using the design differences of these algorithms, the performance of HAD is compared to RAP, LUB and HYBRID.