کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
503575 | 863783 | 2006 | 9 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks](/preview/png/503575.png)
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms such as K-ring analysis a challenge. This paper proposes an algorithm to improve the efficiency of ring analysis of large graphs, exploiting properties of K-rings and spatial correlations of vertices in the graph. The algorithm uses dual-tree expansion (DTE) and spatial hash-function tagging (SHAFT) to optimize computation and memory access. Numerical tests show nearly perfect linear scaling of the algorithm. Also a parallel implementation of the DTE + SHAFT algorithm achieves high scalability. The algorithm has been successfully employed to analyze large MD simulations involving up to 500 million atoms.
Journal: Computer Physics Communications - Volume 175, Issue 5, 1 September 2006, Pages 339–347