.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
molecular dynamics
neighbor list
verlet table
cell linked list
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
1.2W
被引数:
3.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏EV Recharge for the Supply of Balancing Services in Italy: Preliminary Techno-Economic Evaluations
PREAI
分享收藏
查看更多内容