A new scalable parallel method for molecular dynamics based on cell-block data structure

Authors:
Xiaolin Cao;Zeyao Mo
Affiliations:
High Performance Computing Center, State Key Laboratory of Computational, Physics, Institute of Applied Physics and Computational Mathematics, Bei-Jing, P. R. China;High Performance Computing Center, State Key Laboratory of Computational, Physics, Institute of Applied Physics and Computational Mathematics, Bei-Jing, P. R. China
Venue:
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Year:
2004

Citing 4
Cited 0

Fast parallel algorithms for short-range molecular dynamics

Journal of Computational Physics
Dynamic Partitioning of Non-Uniform Structured Workloads with Spacefilling Curves

IEEE Transactions on Parallel and Distributed Systems
NAMD2: greater scalability for parallel molecular dynamics

Journal of Computational Physics - Special issue on computational molecular biophysics
Efficiency of Dynamic Load Balancing Based on Permanent Cells for Parallel Molecular Dynamics Simulation

IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A scalable parallel algorithm especially for large-scale three dimensional simulations with seriously non-uniform particles distributions is presented. In particular, based on cell-block data structures, this algorithm uses Hilbert space filling curve to convert three-dimensional domain decomposition for load distribution across processors into one-dimensional load balancing problems for which measurement-based multilevel averaging weights(MAW) method can be applied successfully. Against inverse space-filling partitioning(ISP), MAW redistributes blocks by monitoring change of total load in each processor. Numerical experimental results have shown that MAW is superior to ISP in rendering balanced load for large-scale multi-medium MD simulation in high temperature and high pressure physics. Excellent scalability was demonstrated, with a speedup larger than 200 with 240 processors of one MPP. The largest run with 1.1 × 109 particles on 500 processors took 80 seconds per time step.