Modeling Dynamic Load Balancing in Molecular Dynamics to Achieve Scalable Parallel Execution

To achieve scalable parallel performance in Molecular Dynamics Simulation, we have modeled and implemented several dynamic spatial domain decomposition algorithms. The modeling is based upon Valiant's Bulk Synchronous Parallel architecture model (BSP), which describes supersteps of computation, communication, and synchronization. We have developed prototypes that estimate the differing costs of several spatial decomposition algorithms using the BSP model. Our parallel MD implementation is not bound to the limitations of the BSP model, allowing us to extend the spatial decomposition algorithm. For an initial decomposition, we use one of the successful decomposition strategies from the BSP study, and then subsequently use performance data to adjust the decomposition, dynamically improving the load balance. We report our results here.

• Type: Conference
• Year: 1998
• Where: IRREGULAR
• Authors: Lars S. Nyland, Jan Prins, Ru Huai Yun, Jan Hermans, Hye-Chung Kum, Lei Wang
• Keywords: BSP Model, Decomposition Algorithm, Distributed And Parallel Computing, IRREGULAR 1998, Spatial Decomposition Algorithm