17910

GPU Acceleration of a High-Order Discontinuous Galerkin Incompressible Flow Solver

Ali Karakus, Noel Chalmers, Kasia Swirydowicz, Timothy Warburton
Department of Mathematics, Virginia Tech, 225 Stanger Street, Blacksburg, VA 24061, USA
arXiv:1801.00246 [math.NA], (31 Dec 2017)

@article{karakus2017acceleration,

   title={GPU Acceleration of a High-Order Discontinuous Galerkin Incompressible Flow Solver},

   author={Karakus, Ali and Chalmers, Noel and Swirydowicz, Kasia and Warburton, Timothy},

   year={2017},

   month={dec},

   archivePrefix={"arXiv"},

   primaryClass={math.NA}

}

Download Download (PDF)   View View   Source Source   

688

views

We present a GPU-accelerated version of a high-order discontinuous Galerkin discretization of the unsteady incompressible Navier-Stokes equations. The equations are discretized in time using a semi-implicit scheme with explicit treatment of the nonlinear term and implicit treatment of the split Stokes operators. The pressure system is solved with a conjugate gradient method together with a fully GPU-accelerated multigrid preconditioner which is designed to minimize memory requirements and to increase overall performance. A semi-Lagrangian subcycling advection algorithm is used to shift the computational load per timestep away from the pressure Poisson solve by allowing larger timestep sizes in exchange for an increased number of advection steps. Numerical results confirm we achieve the design order accuracy in time and space. We optimize the performance of the most time-consuming kernels by tuning the fine-grain parallelism, memory utilization, and maximizing bandwidth. To assess overall performance we present an empirically calibrated roofline performance model for a target GPU to explain the achieved efficiency. We demonstrate that, in the most cases, the kernels used in the solver are close to their empirically predicted roofline performance.
Rating: 5.0/5. From 2 votes.
Please wait...

Recent source codes

* * *

* * *

HGPU group © 2010-2018 hgpu.org

All rights belong to the respective authors

Contact us: