1 | <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"> |
---|
2 | <html><head> |
---|
3 | <meta content="text/html; charset=windows-1252" http-equiv="CONTENT-TYPE"><title>PALM chapter 2.0</title> <meta content="StarOffice 7 (Win32)" name="GENERATOR"> <meta content="Marcus Oliver Letzel" name="AUTHOR"> <meta content="20040719;14534028" name="CREATED"> <meta content="20041117;10385730" name="CHANGED"> <meta content="parallel LES model" name="KEYWORDS"> <style> |
---|
4 | <!-- |
---|
5 | @page { size: 21cm 29.7cm } |
---|
6 | --> |
---|
7 | </style></head> |
---|
8 | |
---|
9 | <body style="direction: ltr;" lang="en-US"><h2 style="line-height: 100%;"><font size="4">2.0 |
---|
10 | Basic techniques of |
---|
11 | the LES model and its parallelization </font> |
---|
12 | </h2><p style="line-height: 100%;">LES models |
---|
13 | generally permit the |
---|
14 | simulation of turbulent flows, whereby those eddies, that carry the |
---|
15 | main energy are resolved by the numerical grid. Only the |
---|
16 | effect of such turbulence elements with diameter equal to or smaller |
---|
17 | than the grid spacing are parameterized in the model and |
---|
18 | by so-called subgrid-scale (SGS) transport. Larger structures are |
---|
19 | simulated directly (they are explicitly resolved) and their effects are |
---|
20 | represented by the advection terms. </p> |
---|
21 | <p style="font-style: normal; line-height: 100%;">PALM is |
---|
22 | based on the |
---|
23 | non-hydrostatic incompressible Boussinesq equations. It contains a |
---|
24 | water cycle with cloud formation and takes into account infrared |
---|
25 | radiative cooling in cloudy conditions. The model has six prognostic |
---|
26 | quantities in total – u,v,w, liquid water potential |
---|
27 | temperature |
---|
28 | <font face="Thorndale, serif">Θ</font><sub>l |
---|
29 | </sub>(BETTS, |
---|
30 | 1973), total water content q and subgrid-scale turbulent kinetic energy |
---|
31 | e. The |
---|
32 | subgrid-scale turbulence is modeled according to DEARDOFF (1980) and |
---|
33 | requires the solution of an additional prognostic equation for the |
---|
34 | turbulent kinetic energy e. The long wave radiation scheme is based |
---|
35 | on the parametrization of cloud effective emissivity (e.g. Cox, 1976) |
---|
36 | and condensation is considered by a simple '0%-or-100%'-scheme, which |
---|
37 | assumes that within each grid box the air is either entirely |
---|
38 | unsaturated or entirely saturated ( see e.g., CUIJPERS and DUYNKERKE, |
---|
39 | 1993). The water cycle is closed by using a simplified version of |
---|
40 | KESSLERs scheme (KESSLER, 1965; 1969) to parameterize precipitation |
---|
41 | processes (MÜLLER and CHLOND, 1996). Incompressibility is |
---|
42 | applied by means of a Poisson equation for pressure, which is solved |
---|
43 | with a direct method (SCHUMANN and SWEET, 1988). The Poisson equation |
---|
44 | is Fourier transformed in both horizontal directions and the |
---|
45 | resulting tridiagonal matrix is solved for the transformed pressure |
---|
46 | which is then transformed back. Alternatively, a multigrid method can |
---|
47 | also be used. Lateral boundary conditions of the model are cyclic and |
---|
48 | MONIN-OBUKHOV similarity is assumed between the surface and the first |
---|
49 | computational grid level above. Alternatively, noncyclic boundary |
---|
50 | conditions |
---|
51 | (Dirichlet/Neumann) can be used along one of the |
---|
52 | horizontal directions. At the lower surface, either temperature/ |
---|
53 | humidity or their respective fluxes can be prescribed. </p> |
---|
54 | <p style="font-style: normal; line-height: 100%;">The |
---|
55 | advection terms |
---|
56 | are treated by the scheme proposed by PIACSEK and WILLIAMS (1970), |
---|
57 | which conserves the integral of linear and quadratic quantities up to |
---|
58 | very small errors. The advection of scalar quantities can optionally |
---|
59 | be performed by the monotone, locally modified version of Botts |
---|
60 | advection scheme (CHLOND, 1994). The time integration is performed |
---|
61 | with the third-order Runge-Kutta scheme. A second-order Runge-Kutta |
---|
62 | scheme, a leapfrog scheme and an Euler scheme are also implemented.</p> |
---|
63 | <p style="line-height: 100%;">By default, the time step is |
---|
64 | computed |
---|
65 | with respect to the different criteria (CFL, diffusion) and adapted |
---|
66 | automatically. In case of a non-zero geostrophic |
---|
67 | wind the coordinate system can be moved along with the mean wind in |
---|
68 | order to maximize the time step (Galilei-Transformation). </p> |
---|
69 | <p style="font-style: normal; line-height: 100%;">In |
---|
70 | principle a model |
---|
71 | run is carried out in the following way: After reading the control |
---|
72 | parameters given by the user, all prognostic variables are |
---|
73 | initialized. Initial values can be e.g. vertical profiles of the |
---|
74 | horizontal wind, calculated using a 1D subset of the 3D prognostic |
---|
75 | equation and are set in the 3D-Model as horizontally homogeneous |
---|
76 | initial values. Temperature profiles can only be prescribed linear |
---|
77 | (with constant gradients, which may change for different vertical |
---|
78 | height intervals) and they are assumed in the 1D-Model as stationary. |
---|
79 | After the initialization phase during which also different kinds of |
---|
80 | disturbances may be imposed to the prognostic fields, the time |
---|
81 | integration begins. Here for each individual time step the prognostic |
---|
82 | equations are successively solved for the velocity components u, v and |
---|
83 | w |
---|
84 | as well as for the potential temperature and possibly for the TKE. |
---|
85 | After the calculation of the boundary values in accordance with the |
---|
86 | given boundary conditions the provisional velocity fields are |
---|
87 | corrected with the help of the pressure solver. Following this, all |
---|
88 | diagnostic turbulence quantities including possible |
---|
89 | Prandtl-layer–quantities are computed. At the end of a time |
---|
90 | step the data output requested by the user is made |
---|
91 | (e.g. statistic of analyses for control purposes or profiles and/or |
---|
92 | graphics data). If the given end-time was reached, binary data maybe |
---|
93 | be saved for restart. </p> |
---|
94 | <p style="font-style: normal; line-height: 100%;">The |
---|
95 | model is based |
---|
96 | on the originally non-parallel LES model which has been operated at the |
---|
97 | institute since 1989 |
---|
98 | and which was parallelized for massively parallel computers with |
---|
99 | distributed memory using the Message-Passing-Standard MPI. It is |
---|
100 | still applicable on a single processor and also well optimized for |
---|
101 | vector machines. The parallelization takes place via a so-called domain |
---|
102 | decomposition, which divides the entire model |
---|
103 | domain into individual, vertically standing cubes, which extend from |
---|
104 | the bottom to the top of the model domain. One processor (processing |
---|
105 | element, PE) is assigned to each cube, which |
---|
106 | accomplishes the computations on all grid points of the subdomain. |
---|
107 | Users can choose between a two- and a one-dimensional domain |
---|
108 | decomposition. A 1D-decomposition is preferred on machines with a |
---|
109 | slow network interconnection. In case of a 1D-decomposition, |
---|
110 | the |
---|
111 | grid points along x direction are |
---|
112 | distributed among the individual processors, but in y- and z-direction |
---|
113 | all respective grid points belong to the same PE. </p> |
---|
114 | <p style="line-height: 100%;">The calculation of central |
---|
115 | differences or |
---|
116 | non-local arithmetic operations (e.g. global |
---|
117 | sums, FFT) demands communication and an appropriate data exchange |
---|
118 | between the PEs. As a substantial innovation in relation to |
---|
119 | the non-parallel model version the individual subdomains are |
---|
120 | surrounded by so-called ghost points, which contain the grid point |
---|
121 | information of the neighbor processors. The appropriate grid point |
---|
122 | values must be exchanged after each change (i.e. in particular after |
---|
123 | each time step). For this purpose MPI routines (<tt>MPI_SENDRCV</tt>) |
---|
124 | are used. For the solution of the FFT conventional (non-parallelized) |
---|
125 | procedures are used. Given that the FFTs are used in x and/or |
---|
126 | y-direction, the data which lie distributed on the individual central |
---|
127 | processing elements, have to be collected and/or relocated before. |
---|
128 | This happens by means of the routine <tt>MPI_ALLTOALLV</tt>. |
---|
129 | Certain |
---|
130 | global operations like e.g. the search for absolute maxima or minima |
---|
131 | within the 3D-arrays likewise require the employment of special MPI |
---|
132 | routines (<tt>MPI_ALLREDUCE</tt>). </p> |
---|
133 | <p style="line-height: 100%;">Further details of the |
---|
134 | internal model |
---|
135 | structure are described in the <a href="../tec/index.html">technical/numerical |
---|
136 | documentation</a>. <br> |
---|
137 | </p> |
---|
138 | <hr><font color="#000080"><font color="#000080"><br><a href="chapter_1.0.html"><font color="#000080"><img name="Grafik1" src="left.gif" align="bottom" border="2" height="32" width="32"></font></a><a href="index.html"><font color="#000080"><img name="Grafik2" src="up.gif" align="bottom" border="2" height="32" width="32"></font></a><a href="chapter_3.0.html"><font color="#000080"><img name="Grafik3" src="right.gif" align="bottom" border="2" height="32" width="32"></font></a><br> |
---|
139 | </font></font><br><p style="line-height: 100%;"><span style="font-style: italic;">Last |
---|
140 | change: </span>$Id: chapter_2.0.html 62 2007-03-13 02:52:40Z raasch $<font color="#000080"><font color="#000080"><br> |
---|
141 | </font></font></p></body></html> |
---|