Premium
Parallelization and scalability of a spectral element channel flow solver for incompressible Navier–Stokes equations
Author(s) -
Hamman C. W.,
Kirby R. M.,
Berzins M.
Publication year - 2007
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.1181
Subject(s) - petascale computing , computer science , massively parallel , computational science , solver , scalability , parallel computing , supercomputer , polygon mesh , turbulence , direct numerical simulation , scaling , flow (mathematics) , navier–stokes equations , reynolds number , algorithm , compressibility , physics , mechanics , geometry , mathematics , computer graphics (images) , database , programming language
Direct numerical simulation (DNS) of turbulent flows is widely recognized to demand fine spatial meshes, small timesteps, and very long runtimes to properly resolve the flow field. To overcome these limitations, most DNS is performed on supercomputing machines. With the rapid development of terascale (and, eventually, petascale) computing on thousands of processors, it has become imperative to consider the development of DNS algorithms and parallelization methods that are capable of fully exploiting these massively parallel machines. A highly parallelizable algorithm for the simulation of turbulent channel flow that allows for efficient scaling on several thousand processors is presented. A model that accurately predicts the performance of the algorithm is developed and compared with experimental data. The results demonstrate that the proposed numerical algorithm is capable of scaling well on petascale computing machines and thus will allow for the development and analysis of high Reynolds number channel flows. Copyright © 2007 John Wiley & Sons, Ltd.