Abstract
The simulation of long-range electrostatic interactions in huge particle ensembles is a vital issue in current scientific research. The Fast Multipole Method (FMM) is able to compute those Coulomb interactions with extraordinary speed and controlled precision. A key part of this method are its shifting operators, which usually exhibit O( p 4) complexity. Some special rotation-based operators with O( p 3) complexity can be used instead. However, they are still computationally expensive. Here we report on the parallelization of those operators that have been implemented for a GPU cluster to speed up the FMM calculations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Appel, A.W.: An efficient program for many-body simulation. SIAM J. Sci. Stat. Comput. 6 (1), 85–103 (1985)
Barnes, J., Hut, P.: A hierarchical O (N log N) force-calculation algorithm. Nature 324, 446–449 (1986)
Brandt, A.: Multi-level adaptive solutions to boundary-value problems. Math. Comput. 31 (138), 333–390 (1977)
Dachsel, H.: An error-controlled fast multipole method. J. Chem. Phys. 132 (11), 244102 (2009)
Darden, T., York, D., Pedersen, L.: Particle mesh Ewald: an N log(N) method for Ewald sums in large systems. J. Chem. Phys. 98 (12), 10089–10092 (1993)
Donnini, S., Ullmann, R.T., Groenhof, G., Grubmüller, H.: Charge-neutral constant ph molecular dynamics simulations using a parsimonious proton buffer. J. Chem. Theory Comput. 12 (3), 1040–1051 (2016)
Eastwood, J.W., Hockney, R.W., Lawrence, D.N.: P3M3DP-the three-dimensional periodic particle-particle/particle-mesh program. Comput. Phys. Commun. 19 (2), 215–261 (1980)
Greengard, L., Rokhlin, V.: A fast algorithm for particle simulations. J. Comput. Phys. 73 (2), 325–348 (1987)
Gumerov, N.A., Duraiswami, R.: Recursive computation of spherical harmonic rotation coefficients of large degree. CoRR abs/1403.7698 (2014)
Harris, M.: CUDA Pro Tip: Write Flexible Kernels with Grid-Stride Loops. http://devblogs.nvidia.com/parallelforall/cuda-pro-tip-write-flexible-kernels-grid-stride-loops/
Kabadshow, I.: Periodic boundary conditions and the error-controlled fast multipole method, vol. 11. Forschungszentrum Jülich (2012)
Kohnke, B., Kabadshow, I.: FMM goes GPU: a smooth trip or a bumpy ride? (2015), GPU Technology Conference
Lashuk, I., Chandramowlishwaran, A., Langston, H., Nguyen, T.A., Sampath, R., Shringarpure, A., Vuduc, R., Ying, L., Zorin, D., Biros, G.: A massively parallel adaptive fast multipole method on heterogeneous architectures. Commun. ACM 55 (5), 101–109 (2012)
Merrill, D.: CUB – collective software primitives (2013), GPU Technology Conference
White, C.A., Head-Gordon, M.: Rotating around the quartic angular momentum barrier in fast multipole method calculations. J. Chem. Phys. 105 (12), 5061–5067 (1996)
Yokota, R., Barba, L.: Treecode and fast multipole method for N-body simulation with CUDA. ArXiv e-prints (2010)
Acknowledgements
This work is supported by the German Research Foundation (DFG) under the priority programme 1648 “Software for Exascale Computing—SPPEXA”, project “GROMEX”.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Garcia, A.G., Beckmann, A., Kabadshow, I. (2016). Accelerating an FMM-Based Coulomb Solver with GPUs. In: Bungartz, HJ., Neumann, P., Nagel, W. (eds) Software for Exascale Computing - SPPEXA 2013-2015. Lecture Notes in Computational Science and Engineering, vol 113. Springer, Cham. https://doi.org/10.1007/978-3-319-40528-5_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-40528-5_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-40526-1
Online ISBN: 978-3-319-40528-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)