Pairwise verlet lists: Combining cell lists and verlet lists to improve memory locality and parallelism

Verlet lists, which are commonly used in many particle‐based simulations, are not suited for modern, shared‐memory parallel multicore architectures. In this article, we introduce pairwise Verlet lists: local Verlet lists containing only interacting particle pairs between a pair of neighboring computational cells. We show that these pairwise Verlet lists are more efficient and scale much better than the traditional global Verlet list, both on a single processor as well as on multiple shared‐memory cores. The improved performance on a single core makes them an interesting option for distributed‐memory simulations as well. © 2011 Wiley Periodicals, Inc. J Comput Chem, 2011

[1]  Gui-Rong Liu,et al.  Improved neighbor list algorithm in molecular simulations using cell decomposition and data sorting method , 2004, Comput. Phys. Commun..

[2]  H. Berendsen,et al.  Molecular dynamics with coupling to an external bath , 1984 .

[3]  Peter S. Lomdahl,et al.  MOLECULAR DYNAMICS COMES OF AGE: 320 BILLION ATOM SIMULATION ON BlueGene/L , 2006 .

[4]  Laxmikant V. Kalé,et al.  Scalable molecular dynamics with NAMD , 2005, J. Comput. Chem..

[5]  P. Strevens Iii , 1985 .

[6]  T. Straatsma,et al.  THE MISSING TERM IN EFFECTIVE PAIR POTENTIALS , 1987 .

[7]  Carsten Kutzner,et al.  GROMACS 4:  Algorithms for Highly Efficient, Load-Balanced, and Scalable Molecular Simulation. , 2008, Journal of chemical theory and computation.

[8]  Eduard S. Fomin,et al.  Consideration of data load time on modern processors for the Verlet table and linked‐cell algorithms , 2011, J. Comput. Chem..

[9]  Wolfgang J. Paul,et al.  A special purpose parallel computer for molecular dynamics: motivation, design, implementation, and application , 1987 .

[10]  Pedro Gonnet Using piecewise polynomials for faster potential function evaluation , 2010, J. Comput. Phys..

[11]  Pedro Gonnet Efficient Algorithms for Molecular Dynamics Simulations on the Cell Broadband Engine Architecture , 2010 .

[12]  S. Meloni,et al.  Efficient particle labeling in atomistic simulations. , 2007, The Journal of chemical physics.

[13]  L. Verlet Computer "Experiments" on Classical Fluids. I. Thermodynamical Properties of Lennard-Jones Molecules , 1967 .

[14]  Guido Germano,et al.  Efficiency of linked cell algorithms , 2010, Comput. Phys. Commun..

[15]  B. Quentrec,et al.  New method for searching for neighbors in molecular dynamics computations , 1973 .

[16]  C. Brooks Computer simulation of liquids , 1989 .

[17]  William Smith,et al.  THE DL POLY 4 USER MANUAL , 2010 .

[18]  I T Todorov,et al.  DL_POLY_3: the CCP5 national UK code for molecular–dynamics simulations , 2004, Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[19]  Pedro Gonnet,et al.  A simple algorithm to accelerate the computation of non‐bonded interactions in cell‐based molecular dynamics simulations , 2007, J. Comput. Chem..

[20]  Holger Gohlke,et al.  The Amber biomolecular simulation programs , 2005, J. Comput. Chem..

[21]  William D. Mattson,et al.  Near-neighbor calculations using a modified cell-linked list method , 1999 .