.png){kind=icon}
Return
Improved neighbor list algorithm in molecular simulations using cell decomposition and data sorting method
.png){kind=icon}
OA
AI
DOI：10.1016/j.cpc.2004.04.004.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An improved neighbor list algorithm is proposed to reduce unnecessary interatomic distance calculations in molecular simulations. It combines the advantages of Verlet table and cell linked list algorithms by using cell decomposition approach to accelerate the neighbor list construction speed, and data sorting method to lower the CPU data cache miss rate, as well as partial updating method to minimize the unnecessary reconstruction of the neighbor list. Both serial and parallel performance of molecular dynamics simulation are evaluated using the proposed algorithm and compared with those using conventional Verlet table and cell linked list algorithms. Results show that the new algorithm outperforms the conventional algorithms by a factor of 2 similar to 3 in cases of both small and large number of atoms. (C) 2004 Elsevier B.V. All rights reserved.
Keywords:
molecular dynamics
neighbor list
verlet table
cell linked list
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
1.2W
Citations:
3.7W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveEV Recharge for the Supply of Balancing Services in Italy: Preliminary Techno-Economic Evaluations
PREAI
ShareSaveShareSave
View more