Efficiency of linked cell algorithms

DOI10.1016/J.CPC.2010.11.002zbMATH Open1215.82002arXiv1006.1239OpenAlexW2083641704MaRDI QIDQ538540FDOQ538540

Authors: Ulrich Welling, Guido Germano 

Publication date: 25 May 2011

Published in: Computer Physics Communications (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1006.1239

Recommendations

• Efficiency of Equivalence Algorithms
• scientific article; zbMATH DE number 4106255
• The cell probe complexity of succinct data structures
• scientific article; zbMATH DE number 2038721
• Comparison research on the neighbor list algorithms: Verlet table and linked-cell
• On the efficiency of algorithms of analysis
• Publication:3496170
• A lattice model for cellular (systolic) algorithms
• scientific article; zbMATH DE number 1302785

zbMATH Keywords

Monte Carlomolecular dynamicsmolecular simulationinteraction sortinglinked cell listlinked cell reorderingneighbour list

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Interacting particle systems in time-dependent statistical mechanics (82C22)

Cites Work

• Fast parallel algorithms for short-range molecular dynamics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• General purpose molecular dynamics simulations fully implemented on graphics processing units
• Parallel atomistic simulations
• Faster neighbour list generation using a novel lattice vector representation
• Algorithm optimization in molecular dynamics simulation

Cited In (10)

• Comparison research on the neighbor list algorithms: Verlet table and linked-cell
• A multilevel-skin neighbor list algorithm for molecular dynamics simulation
• Spectral accuracy in fast Ewald-based methods for particle simulations
• An efficient linked list for molecular simulations on a spherical surface
• Body fitted link-cell algorithm for particulate flow simulation in curved pipeline domain
• Cell List algorithms for nonequilibrium molecular dynamics
• The linked neighbour list (LNL) method for fast off-lattice Monte Carlo simulations of fluids
• Fast neighbor lists for adaptive-resolution particle simulations
• Efficiency of classical molecular dynamics algorithms on supercomputing hardware
• Approximating the dynamical evolution of systems of strongly interacting overdamped particles

This page was built for publication: Efficiency of linked cell algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q538540)