Efficiency of linked cell algorithms
arXiv:1006.1239 · doi:10.1016/j.cpc.2010.11.002
Abstract
The linked cell list algorithm is an essential part of molecular simulation software, both molecular dynamics and Monte Carlo. Though it scales linearly with the number of particles, there has been a constant interest in increasing its efficiency, because a large part of CPU time is spent to identify the interacting particles. Several recent publications proposed improvements to the algorithm and investigated their efficiency by applying them to particular setups. In this publication we develop a general method to evaluate the efficiency of these algorithms, which is mostly independent of the parameters of the simulation, and test it for a number of linked cell list algorithms. We also propose a combination of linked cell reordering and interaction sorting that shows a good efficiency for a broad range of simulation setups.
Submitted to Computer Physics Communications on 22 December 2009, still awaiting a referee report
Cited by in corpus (9)
- Heterogeneous Parallelization and Acceleration of Molecular Dynamics Simulations in GROMACS
- A flexible algorithm for calculating pair interactions on SIMD architectures
- Improved random batch Ewald method in molecular dynamics simulations
- Optimizing Event-Driven Simulations
- Efficient -dimensional molecular dynamics simulations for studies of the glass-jamming transition
- Efficient implementation of immersed boundary-lattice Boltzmann method for massive particle-laden flows Part I: Serial computing
- Simulation of cloud drop collisions in ABC flow
- CellListMap.jl: Efficient and customizable cell list implementation for calculation of pairwise particle properties within a cutoff
- Random-batch list algorithm for short-range molecular dynamics simulations