A GPU-Accelerated Fast Summation Method Based on Barycentric Lagrange Interpolation and Dual Tree Traversal
arXiv:2012.06925 · doi:10.1016/j.cpc.2021.108017
Abstract
We present the barycentric Lagrange dual tree traversal (BLDTT) fast summation method for particle interactions. The scheme replaces well-separated particle-particle interactions by adaptively chosen particle-cluster, cluster-particle, and cluster-cluster approximations given by barycentric Lagrange interpolation at proxy particles on a Chebyshev grid in each cluster. The BLDTT is kernel-independent and the approximations can be efficiently mapped onto GPUs, where target particles provide an outer level of parallelism and source particles provide an inner level of parallelism. We present an OpenACC GPU implementation of the BLDTT with MPI remote memory access for distributed memory parallelization. The performance of the GPU-accelerated BLDTT is demonstrated for calculations with different problem sizes, particle distributions, geometric domains, and interaction kernels, as well as for unequal target and source particles. Comparison with our earlier particle-cluster barycentric Lagrange treecode (BLTC) demonstrates the superior performance of the BLDTT. In particular, on a single GPU for problem sizes ranging from =1E5 to 1E8, the BLTC has scaling, while the BLDTT has scaling. In addition, MPI strong scaling results are presented for the BLTC and BLDTT using =64E6 particles on up to 32 GPUs.
arXiv comment31 pages, 36 figures
References in corpus (13)
- A Hierarchical O(N) Force Calculation Algorithm
- A sparse octree gravitational N-body code that runs entirely on the GPU processor
- Yet another fast multipole method without multipoles --- Pseudo-particle multipole method
- Biomolecular electrostatics using a fast multipole BEM on up to 512 GPUs and a billion unknowns
- 24.77 Pflops on a Gravitational Tree-Code to Simulate the Milky Way Galaxy with 18600 GPUs
- Hierarchical N-body simulations with auto-tuning for heterogeneous systems
- A kernel-independent treecode based on barycentric Lagrange interpolation
- A GPU-accelerated Direct-sum Boundary Integral Poisson-Boltzmann Solver
- The Fast Multipole Method and Point Dipole Moment Polarizable Force Fields
- A GPU accelerated Barnes-Hut Tree Code for FLASH4
- Fast Low-Rank Kernel Matrix Factorization through Skeletonized Interpolation
- Treecode-accelerated Green Iteration for Kohn-Sham Density Functional Theory
- Hierarchical Matrix Operations on GPUs: Matrix-Vector Multiplication and Compression