Fast electrostatic force calculation on parallel computer clusters

Citations

WEB OF SCIENCE

11
Citations

SCOPUS

11

초록

The fast multipole method (FMM) and smooth particle mesh Ewald (SPME) are well known fast algorithms to evaluate long range electrostatic interactions in molecular dynamics and other fields. FMM is a multi-scale method which reduces the computation cost by approximating the potential due to a group of particles at a large distance using few multipole functions. This algorithm scales like O(N) for N particles. SPME algorithm is an O(N In N) method which is based on an interpolation of the Fourier space part of the Ewald sum and evaluating the resulting convolutions using fast Fourier transform (FFT). Those algorithms suffer from relatively poor efficiency on large parallel machines especially for mid-size problems around hundreds of thousands of atoms. A variation of the FMM, called PWA, based on plane wave expansions is presented in this paper. A new parallelization strategy for PWA, which takes advantage of the specific form of this expansion, is described. Its parallel efficiency is compared with SPME through detail time measurements on two different computer clusters. (C) 2008 Elsevier Inc. All rights reserved.

키워드

fast multipole methodparticle mesh Ewaldplane waveparallel algorithmFAST MULTIPOLE METHODPARTICLE MESH EWALDALGORITHMIMPLEMENTATIONVERSIONSUMS
제목
Fast electrostatic force calculation on parallel computer clusters
저자
Kia, AmiraliKim, DaejoongDarve, Eric
DOI
10.1016/j.jcp.2008.06.016
발행일
2008-10-01
유형
Article
저널명
Journal of Computational Physics
227
19
페이지
8551 ~ 8567