Efficient Implementation of Smoothed Particle Hydrodynamics (SPH) with Plane Sweep Algorithm

Abstract

Neighbour search (NS) is the core of any implementations of smoothed particle hydrodynamics (SPH). In this paper,we present an efficient neighbour search method based on the plane sweep (PW) algorithm with N being the number of SPH particles. The resulting method, dubbed the PWNS method, is totally independent of grids (i.e., purely meshfree) and capable of treating variable smoothing length, arbitrary particle distribution and heterogenous kernels. Several state-of-the-art data structures and algorithms, e.g., the segment tree and the Morton code, are optimized and implemented. By simply allowingmultiple lines to sweep the SPH particles simultaneously from different initial positions, a parallelization of the PWNS method with satisfactory speedup and load-balancing can be easily achieved. That is, the PWNS SPH solver has a great potential for large scale fluid dynamics simulations.

SPH Modeling of Water-Related Natural Hazards

“…The same conclusion was confirmed in [96] for GPU simulations. Quad-tree partitions combined with the Morton space filling curve (SFC) was recommended when using variable resolution in multi-core architectures [97] and GPU devices [98]. The work in [99] proposed another algorithm based on hierarchical cell decomposition for variable resolution in distributed memory architectures using MPI.…”

“…The high computational cost of particle methods can be countered using the programming techniques discussed above. Thus, different implementations of the SPH method using OpenMP can be found [97,101,102], although the same algorithms can be applied to other particle methods. The work of [101] included a performance analysis of SPH in multi-core CPUs and studied how to avoid bottlenecks.…”

Feature-Scale Simulations of Particulate Slurry Flows in Chemical Mechanical Polishing by Smoothed Particle Hydrodynamics

“…Most of these applications are based on the grid-link-list algorithm [53] and the hierarchical tree structured algorithm [54]. Also, we have developed a competitive easy-to-parallelize neighbour search method [33] based on the plane-sweep algorithm, and implemented it in this work. Satisfactory speed-up has been achieved with the help of this new algorithm, which makes large-scale simulations possible.…”

“…Satisfactory speed-up has been achieved with the help of this new algorithm, which makes large-scale simulations possible. More details can be found in [33].…”

“…Thus, a unified treatment for both solid boundaries and fluid-solid interactions is achieved, which significantly reduces the complexity of the SPH solver. Furthermore, to reduce computing cost, a novel efficient neighbour search algorithm [33] recently developed in our group is used.…”