MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Singapore-MIT Alliance (SMA)
  • High Performance Computation for Engineered Systems (HPCES)
  • View Item
  • DSpace@MIT Home
  • Singapore-MIT Alliance (SMA)
  • High Performance Computation for Engineered Systems (HPCES)
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Improved O(N) neighbor list method using domain decomposition and data sorting

Author(s)
Yao, Zhenhua; Wang, Jian-Sheng; Cheng, Min
Thumbnail
DownloadHPCES008.pdf (72.09Kb)
Metadata
Show full item record
Abstract
The conventional Verlet table neighbor list algorithm is improved to reduce the number of unnecessary inter-atomic distance calculations in molecular simulations involving large amount of atoms. Both of the serial and parallelized performance of molecular dynamics simulation are evaluated using the new algorithm and compared with those using the conventional Verlet table and cell-linked list algorithm. Results show that the new algorithm significantly improved the performance of molecular dynamics simulation compared with conventional neighbor list maintaining and utilizing algorithms in serial programs as well as parallelized programs.
Date issued
2004-01
URI
http://hdl.handle.net/1721.1/3884
Series/Report no.
High Performance Computation for Engineered Systems (HPCES);
Keywords
O(N) neighbor list method, domain decomposition, data sorting, Verlet table neighbor list algorithm, molecular dynamics simulation, cell-linked list algorithm

Collections
  • High Performance Computation for Engineered Systems (HPCES)

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.