Skip to main content
Parallel Implementation of the Treecode Ewald Method
Parallel and Distributed Processing Symposium, 2004. Proceedings. 18th International
  • Dongqing Liu, University of Akron
  • Zhong-Hui Duan, University of Akron
  • Robert Krasny, University of Michigan
  • Jianping Zhu, Cleveland State University
Document Type
Conference Proceeding
Publication Date
Summary form only given. Here, we discuss an efficient parallel implementation of the treecode Ewald method for fast evaluation of long-range Coulomb interactions in a periodic system for molecular dynamics simulations. The parallelization is based on an adaptive decomposition scheme using the Morton order of the particles. This decomposition scheme takes advantage of the data locality and involves minimum changes to the original sequential code. The message passing interface (MPI) is used for interprocessor communications, making the code portable to a variety of parallel computing platforms. We also discuss communication and performance models for our parallel algorithm. The predicted communication time and parallel performance from these models match the measured results well. Timing results obtained using a system of water molecules on the IA32 Cluster at the Ohio Supercomputer Center demonstrate high speedup and efficiency of the parallel treecode Ewald method.
Citation Information
13. Liu, D., Duan, Z., Krasny, R., and Zhu, J. (2004), Parallel implementation of the treecode Ewald method, in Proceedings of the 2004 International Parallel & Distributed Processing Symposium, Santa Fe, New Mexico, April 26 - 30, 2004.