A new technique for a parallel dealiased pseudospectral Navier-Stokes code

A novel aspect of a parallel procedure for the numerical simulation of the solution of the Navier–Stokes equations through the Fourier–Galerkin pseudospectral method is presented. It consists of a dealiased (“3 /2” rule) transposition of the data that organizes the computations in the distributed direction insuch a way that whenever a Fast Fourier Transform must be calculated, the algorithm will employ data stored solely on the proper memory of the processor which is computing it. This provide for the employment of standard routines for the computations of the Fourier transform. The aliasing removal procedure has been directly inserted into the transposition algorithm. The code is written for distributed memory computers, but not specifically for a peculiar architecture. The use on a variety of machines is allowed by the adoption of the Message Passing Interface library. The portability of the code is demonstrated by the similar performances, in particular the high efficiency, that all the machines tested show up to a number of parallel processors equal to 1 /2 the truncation parameter N/ 2. Explicit time integration is used. The present code organization is relevant to physical and mathematical problems which require a three dimensional spectral treatment. © 2001 Elsevier Science B.V. All rights reserved.

[1]  K. Dang Evaluation of Simple Subgrid-Scale Models for the Numerical Simulation of Homogeneous Turbulence , 1985 .

[2]  S. Monismith,et al.  Entrainment in a shear-free turbulent mixing layer , 1996, Journal of Fluid Mechanics.

[3]  Claudio Giberti,et al.  Parallelism in a Highly Accurate Algorithm for Turbulence Simulation , 1989 .

[4]  P. Fischer,et al.  PARALLEL SIMULATION OF VISCOUS INCOMPRESSIBLE FLOWS , 1994 .

[5]  C. Meneveau,et al.  Scale-Invariance and Turbulence Models for Large-Eddy Simulation , 2000 .

[6]  Astrophysical Jets: Open Problems , 1998 .

[7]  A. Jameson,et al.  Numerical solution of the Euler equations by finite volume methods using Runge Kutta time stepping schemes , 1981 .

[8]  M. Lesieur,et al.  New Trends in Large-Eddy Simulations of Turbulence , 1996 .

[9]  Nagi N. Mansour,et al.  Decay of Isotropic Turbulence at Low Reynolds Number , 1994 .

[10]  Message P Forum,et al.  MPI: A Message-Passing Interface Standard , 1994 .

[11]  Marco Briscolini,et al.  A Parallel Implementation of a 3-D Pseudospectral Based Code on the IBM 9076 Scalable POWERParallel System , 1995, Parallel Comput..

[12]  Javier Jiménez,et al.  The structure of intense vorticity in isotropic turbulence , 1993, Journal of Fluid Mechanics.

[13]  Amit Basu,et al.  A Parallel Algorithm for Spectral Solution of the Three-Dimensional Navier-Stokes Equations , 1994, Parallel Comput..

[14]  N. Touheed,et al.  An Introduction to MPI for Computational Mechanics , 1999 .

[15]  JacksonEric,et al.  A case study in parallel computing. I , 1991 .

[16]  R. Pelz The parallel Fourier pseudospectral method , 1991 .

[17]  C. Canuto Spectral methods in fluid dynamics , 1991 .

[18]  Steven A. Orszag,et al.  A case study in parallel computing: I. Homogeneous turbulence on a hypercube , 1991 .

[19]  S. Corrsin,et al.  Simple Eulerian time correlation of full-and narrow-band velocity signals in grid-generated, ‘isotropic’ turbulence , 1971, Journal of Fluid Mechanics.

[20]  R. S. Rogallo,et al.  An ILLIAC program for the numerical simulation of homogeneous incompressible turbulence , 1977 .

[21]  R. Rogallo Numerical experiments in homogeneous turbulence , 1981 .

[22]  Nagi N. Mansour,et al.  Energy transfer in rotating turbulence , 1997, Journal of Fluid Mechanics.

[23]  S. Orszag Numerical Simulation of Incompressible Flows Within Simple Boundaries. I. Galerkin (Spectral) Representations , 1971 .

[24]  Shiyi Chen,et al.  High‐resolution turbulent simulations using the Connection Machine‐2 , 1992 .