A GPU-accelerated smoothed particle hydrodynamics (SPH) model for the shallow water equations. (January 2016)

• Record Type: Journal Article
• Authors: Xia, Xilin; Liang, Qiuhua
• Is Part Of: Environmental modelling & software. Volume 75(2016:Jan.)
• Page Start: 28
• Page End: 43
• Publication Date: 2016-01
• Subjects: SPH -- GPU -- Shallow water equations -- Quad-tree neighbour searching -- Dam break; Environmental monitoring -- Computer programs -- Periodicals; Ecology -- Computer simulation -- Periodicals; Digital computer simulation -- Periodicals; Computer software -- Periodicals; Environmental Monitoring -- Periodicals; Computer Simulation -- Periodicals; Environnement -- Surveillance -- Logiciels -- Périodiques; Écologie -- Simulation, Méthodes de -- Périodiques; Simulation par ordinateur -- Périodiques; Logiciels -- Périodiques; Computer software; Digital computer simulation; Ecology -- Computer simulation; Environmental monitoring -- Computer programs; Periodicals; Electronic journals; 363.70015118
• DOI: 10.1016/j.envsoft.2015.10.002
• Languages: English
• ISSNs: 1364-8152

Abstract

Abstract: Smoothed particle hydrodynamics (SPH) is a fully Lagrangian meshless computational method for solving the fluid dynamics equations. In recent years, it has also been employed to solve the shallow water equations (SWEs) and promising results have been obtained. However, SPH models are computationally very demanding and the SPH-SWE models considered in this work have no exception. In this paper, the Graphic Processing Units (GPUs) are explored to accelerate an SPH-SWE model for wider applications. Unlike Central Processing Units (CPUs), GPUs are highly parallelized, which makes it suitable for accelerating scientific computing algorithms like SPH. The aim is to design a GPU-based SPH model for solving the two-dimensional SWEs with variable smoothing lengths. Furthermore, a quad-tree neighbour searching method is implemented to further optimize the model performance. An idealized benchmark test and two real-world dam-break cases have been simulated to demonstrate the superior performance of the current GPU-accelerated high-performance SPH-SWE model. Highlights: A well-balanced SPH-SWE model with variable smoothing length is implemented on GPUs to improve computational efficiency. Two different neighbour searching algorithms are implemented and compared. GPU implementation with quad-tree neighbour searching may further improve model performance. Simulation time is analysed and compared in detail for different model components.