Please use this identifier to cite or link to this item:
|Title:||Improved neighbor list algorithm in molecular simulations using cell decomposition and data sorting method|
|Authors:||Yao, Z. |
|Keywords:||Cell linked list|
|Citation:||Yao, Z., Wang, J.-S., Liu, G.-R., Cheng, M. (2004-08-01). Improved neighbor list algorithm in molecular simulations using cell decomposition and data sorting method. Computer Physics Communications 161 (1-2) : 27-35. ScholarBank@NUS Repository. https://doi.org/10.1016/j.cpc.2004.04.004|
|Abstract:||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∼3 in cases of both small and large number of atoms. © 2004 Elsevier B.V. All rights reserved.|
|Source Title:||Computer Physics Communications|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 17, 2018
WEB OF SCIENCETM
checked on Jun 20, 2018
checked on Feb 25, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.