Abstract
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.
This work has been supported in part by the National Institutes of Health's National Center for Research Resources (grant RRO8102 to the UNC/Duke/NYU Computational Structural Biology Resource).
Preview
Unable to display preview. Download preview PDF.
References
R. H. Bisseling and W. F. McColl. Scientific computing on bulk synchronous parallel architectures. Technical report, Department of Mathematics, Utrecht University, April 27 1994.
John A. Board, Jr., Ziyad S. Hakura, William D. Elliott, and William T. Rankin. Scalable variants of multipole-accelerated algorithms for molecular dynamics applications. Technical Report TR94-006, Electrical Engineering, Duke University, 1994.
David A. Case, Jerry P. Greenberg, Wayne Pfeiffer, and Jack Rogers. AMBER-molecular dynamics. Technical report, Scripps Research Institute, see [9] for additional information, 1995.
Terry W. Clark, Reinhard v. Hanxleden, J. Andrew McCammon, and L. Ridgway Scott. Parallelizing molecular dynamics using spatial decomposition. In Proceedings of the Scalable High Performance Computing Conference, Knoxville, TN, May 1994. Also available from ftp://softlib.rice.edu/pub/CRPC-TRs%reports/CRPC-TR93356-S.
Tom Darden, Darrin York, and Lee Pedersen. Particle mesh ewald: An n log (n) method for ewald sums in large systems. J. Chem. Phys., 98(12):10089–10092, June 1993.
Yuan-Shin Hwang, Raja Das, Joel H. Saltz, Milan Hodoscek, and Bernard Brooks. Parallelizing molecular dynamics programs for distributed memory machines: An application of the chaos runtime support library. In Proceedings of the Meeting of the American Chemical Society, August 21-22 1994.
Jonathan Leech, Jan F. Prins, and Jan Hermans. SMD: Visual steering of molecular dynamics for protein design. IEEE Compuational Science & Engineering, 3(4):38–45, Winter 1996.
Mark Nelson, William Humphrey, Attila Gursoy, Andrew Dalke, Laxmikant Kale, Robert D. Skeel, and Klaus Schulten. NAMD-a parallel, object-oriented molecular dynamics program. Journal of Supercomputing Applications and High Performance Computing, In press.
D.A. Pearlman, D.A. Case, J.W. Caldwell, W.R. Ross, T.E. Cheatham III, S. DeBolt, D. Ferguson, G. Seibel, and P. Kollman. AMBER, a computer program for applying molecular mechanics, normal mode analysis, molecular dynamics and free energy calculations to elucidate the structures and energies of molecules. Computer Physics Communications, 91:l–41, 1995.
L. F. Valiant. A bridging model for parallel computation. CACM, 33:103–111, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nyland, L., Prins, J., Yun, R.H., Hermans, J., Kum, HC., Wang, L. (1998). Modeling dynamic load balancing in molecular dynamics to achieve scalable parallel execution. In: Ferreira, A., Rolim, J., Simon, H., Teng, SH. (eds) Solving Irregularly Structured Problems in Parallel. IRREGULAR 1998. Lecture Notes in Computer Science, vol 1457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018552
Download citation
DOI: https://doi.org/10.1007/BFb0018552
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64809-3
Online ISBN: 978-3-540-68533-3
eBook Packages: Springer Book Archive