Cart (Loading....) | Create Account
Close category search window
 

GPU optimized computation of the artificial compressibility method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Itu, L.M. ; Transilvania Univ. of Brasov, Brasov, Romania ; Suciu, C. ; Moldoveanu, F. ; Postelnicu, A.

The paper introduces an optimized GPU based implementation of the artificial compressibility method, which is used to solve the incompressible Navier-Stoked equations. A finite difference approach has been chosen for the numerical solution of the continuity and momentum equations. The simulations have been performed on a two dimensional backward facing step problem discretized on a Marker and Cell grid, which is used in order to improve the stability of the solution. The computationally intensive parts of the algorithm are performed on the GPU, i.e. the computation of the velocities and of the pressure values at the grid nodes. Due to the lack of communication between the blocks of the GPU grid, the computations have been included in two separate kernels, and the outer loop which iterates through the time steps, has been kept on the CPU. Several optimization strategies have been applied for the two kernels and have lead to an incremental increase in performance. The opposite nature of the two kernels has lead to different optimum versions. The final versions of the kernels have been then used to perform a comparison between the CPU and the GPU version of the algorithms on three different grained grids. The results indicate a speed-up which varies from just under one order of magnitude for the coarsest grid up to two orders of magnitude for the finest grid.

Published in:

System Theory, Control, and Computing (ICSTCC), 2011 15th International Conference on

Date of Conference:

14-16 Oct. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.