Show simple item record

dc.contributor.authorYao, Zhenhua
dc.contributor.authorWang, Jian-Sheng
dc.contributor.authorCheng, Min
dc.date.accessioned2003-12-14T22:41:47Z
dc.date.available2003-12-14T22:41:47Z
dc.date.issued2004-01
dc.identifier.urihttp://hdl.handle.net/1721.1/3884
dc.description.abstractThe 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.en
dc.description.sponsorshipSingapore-MIT Alliance (SMA)en
dc.format.extent73830 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesHigh Performance Computation for Engineered Systems (HPCES);
dc.subjectO(N) neighbor list methoden
dc.subjectdomain decompositionen
dc.subjectdata sortingen
dc.subjectVerlet table neighbor list algorithmen
dc.subjectmolecular dynamics simulationen
dc.subjectcell-linked list algorithmen
dc.titleImproved O(N) neighbor list method using domain decomposition and data sortingen
dc.typeArticleen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record