Inviscid axisymmetrization of an elliptical vortex
Journal of Computational Physics
PPM: a highly efficient parallel particle-mesh library for the simulation of continuum systems
Journal of Computational Physics
Fast Hydraulic Erosion Simulation and Visualization on GPU
PG '07 Proceedings of the 15th Pacific Conference on Computer Graphics and Applications
Vortex methods for incompressible flow simulations on the GPU
The Visual Computer: International Journal of Computer Graphics
Fast parallel Particle-To-Grid interpolation for plasma PIC simulations on the GPU
Journal of Parallel and Distributed Computing
GPU accelerated simulations of bluff body flows using vortex particle methods
Journal of Computational Physics
Programming Massively Parallel Processors: A Hands-on Approach
Programming Massively Parallel Processors: A Hands-on Approach
Efficient High-Quality Volume Rendering of SPH Data
IEEE Transactions on Visualization and Computer Graphics
Interactive SPH simulation and rendering on the GPU
Proceedings of the 2010 ACM SIGGRAPH/Eurographics Symposium on Computer Animation
GPU and APU computations of Finite Time Lyapunov Exponent fields
Journal of Computational Physics
Abstractions and Middleware for Petascale Computing and Beyond
International Journal of Distributed Systems and Technologies
Hi-index | 0.00 |
Hybrid particle-mesh methods provide a versatile framework for simulating discrete and continuous systems. A key component is the forward and backward interpolation of particle data to mesh nodes. These interpolations typically account for a significant portion of the computational cost of a simulation. Due to its regular compute structure, interpolation admits SIMD parallelism, and several GPU-accelerated implementations have been presented in the literature. We build on these works to develop a streaming-parallel algorithm for interpolation in hybrid particle-mesh methods that works in both 2D and 3D and is free of assumptions about the particle density, the number of particle properties to be interpolated, and the particle indexing scheme. We provide a portable OpenCL implementation of the algorithm and benchmark its accuracy and performance. We show that with such a generic algorithm speedups of up to 15x over an 8-core multi-thread CPU implementation are possible if the data are already available on the GPU. The maximum speedup reduces to about 7x if the data first have to be transferred to the GPU. The benchmarks also expose several limitations of GPU acceleration, in particular for low-order and 2D interpolation schemes. The present algorithm is integrated and available in the open-source Parallel Particle Mesh (PPM) library as a hybrid MPI-OpenCL implementation.