/[MITgcm]/manual/s_software/text/sarch.tex
ViewVC logotype

Diff of /manual/s_software/text/sarch.tex

Parent Directory Parent Directory | Revision Log Revision Log | View Revision Graph Revision Graph | View Patch Patch

revision 1.1 by cnh, Tue Oct 9 10:33:17 2001 UTC revision 1.11 by afe, Wed Jan 28 19:33:04 2004 UTC
# Line 1  Line 1 
1    % $Header$
2    
3  In this chapter we describe the software architecture and  This chapter focuses on describing the {\bf WRAPPER} environment within which
4  implementation strategy for the MITgcm code. The first part of this  both the core numerics and the pluggable packages operate. The description
5  chapter discusses the MITgcm architecture at an abstract level. In the second  presented here is intended to be a detailed exposition and contains significant
6  part of the chapter we described practical details of the MITgcm implementation  background material, as well as advanced details on working with the WRAPPER.
7  and of current tools and operating system features that are employed.  The tutorial sections of this manual (see sections
8    \ref{sect:tutorials}  and \ref{sect:tutorialIII})
9    contain more succinct, step-by-step instructions on running basic numerical
10    experiments, of varous types, both sequentially and in parallel. For many
11    projects simply starting from an example code and adapting it to suit a
12    particular situation
13    will be all that is required.
14    The first part of this chapter discusses the MITgcm architecture at an
15    abstract level. In the second part of the chapter we described practical
16    details of the MITgcm implementation and of current tools and operating system
17    features that are employed.
18    
19  \section{Overall architectural goals}  \section{Overall architectural goals}
20    
# Line 11  Broadly, the goals of the software archi Line 22  Broadly, the goals of the software archi
22  three-fold  three-fold
23    
24  \begin{itemize}  \begin{itemize}
   
25  \item We wish to be able to study a very broad range  \item We wish to be able to study a very broad range
26  of interesting and challenging rotating fluids problems.  of interesting and challenging rotating fluids problems.
   
27  \item We wish the model code to be readily targeted to  \item We wish the model code to be readily targeted to
28  a wide range of platforms  a wide range of platforms
   
29  \item On any given platform we would like to be  \item On any given platform we would like to be
30  able to achieve performance comparable to an implementation  able to achieve performance comparable to an implementation
31  developed and specialized specifically for that platform.  developed and specialized specifically for that platform.
   
32  \end{itemize}  \end{itemize}
33    
34  These points are summarized in figure \ref{fig:mitgcm_architecture_goals}  These points are summarized in figure \ref{fig:mitgcm_architecture_goals}
# Line 30  a software architecture which at the hig Line 37  a software architecture which at the hig
37  of  of
38    
39  \begin{enumerate}  \begin{enumerate}
   
40  \item A core set of numerical and support code. This is discussed in detail in  \item A core set of numerical and support code. This is discussed in detail in
41  section \ref{sec:partII}.  section \ref{sect:partII}.
   
42  \item A scheme for supporting optional "pluggable" {\bf packages} (containing  \item A scheme for supporting optional "pluggable" {\bf packages} (containing
43  for example mixed-layer schemes, biogeochemical schemes, atmospheric physics).  for example mixed-layer schemes, biogeochemical schemes, atmospheric physics).
44  These packages are used both to overlay alternate dynamics and to introduce  These packages are used both to overlay alternate dynamics and to introduce
45  specialized physical content onto the core numerical code. An overview of  specialized physical content onto the core numerical code. An overview of
46  the {\bf package} scheme is given at the start of part \ref{part:packages}.  the {\bf package} scheme is given at the start of part \ref{part:packages}.
   
   
47  \item A support framework called {\bf WRAPPER} (Wrappable Application Parallel  \item A support framework called {\bf WRAPPER} (Wrappable Application Parallel
48  Programming Environment Resource), within which the core numerics and pluggable  Programming Environment Resource), within which the core numerics and pluggable
49  packages operate.  packages operate.
   
50  \end{enumerate}  \end{enumerate}
51    
52  This chapter focuses on describing the {\bf WRAPPER} environment under which  This chapter focuses on describing the {\bf WRAPPER} environment under which
53  both the core numerics and the pluggable packages function. The description  both the core numerics and the pluggable packages function. The description
54  presented here is intended to be a detailed exposistion and contains significant  presented here is intended to be a detailed exposition and contains significant
55  background material, as well as advanced details on working with the WRAPPER.  background material, as well as advanced details on working with the WRAPPER.
56  The examples section of this manual (part \ref{part:example}) contains more  The examples section of this manual (part \ref{part:example}) contains more
57  succinct, step-by-step instructions on running basic numerical  succinct, step-by-step instructions on running basic numerical
# Line 57  experiments both sequentially and in par Line 59  experiments both sequentially and in par
59  starting from an example code and adapting it to suit a particular situation  starting from an example code and adapting it to suit a particular situation
60  will be all that is required.  will be all that is required.
61    
62    
63  \begin{figure}  \begin{figure}
64  \begin{center}  \begin{center}
65   \resizebox{!}{2.5in}{  \resizebox{!}{2.5in}{\includegraphics{part4/mitgcm_goals.eps}}
   \includegraphics*[1.5in,2.4in][9.5in,6.3in]{part4/mitgcm_goals.eps}  
  }  
66  \end{center}  \end{center}
67  \caption{The MITgcm architecture is designed to allow simulation of a wide  \caption{
68    The MITgcm architecture is designed to allow simulation of a wide
69  range of physical problems on a wide range of hardware. The computational  range of physical problems on a wide range of hardware. The computational
70  resource requirements of the applications targeted range from around  resource requirements of the applications targeted range from around
71  $10^7$ bytes ( $\approx 10$ megabytes ) of memory to $10^{11}$ bytes  $10^7$ bytes ( $\approx 10$ megabytes ) of memory to $10^{11}$ bytes
72  ( $\approx 100$ gigabytes). Arithmetic operation counts for the applications of  ( $\approx 100$ gigabytes). Arithmetic operation counts for the applications of
73  interest range from $10^{9}$ floating point operations to more than $10^{17}$  interest range from $10^{9}$ floating point operations to more than $10^{17}$
74  floating point operations.} \label{fig:mitgcm_architecture_goals}  floating point operations.}
75    \label{fig:mitgcm_architecture_goals}
76  \end{figure}  \end{figure}
77    
78  \section{WRAPPER}  \section{WRAPPER}
# Line 81  Environment Resource). All numerical and Line 84  Environment Resource). All numerical and
84  to ``fit'' within the WRAPPER infrastructure. Writing code to ``fit'' within  to ``fit'' within the WRAPPER infrastructure. Writing code to ``fit'' within
85  the WRAPPER means that coding has to follow certain, relatively  the WRAPPER means that coding has to follow certain, relatively
86  straightforward, rules and conventions ( these are discussed further in  straightforward, rules and conventions ( these are discussed further in
87  section \ref{sec:specifying_a_decomposition} ).  section \ref{sect:specifying_a_decomposition} ).
88    
89  The approach taken by the WRAPPER is illustrated in figure  The approach taken by the WRAPPER is illustrated in figure
90  \ref{fig:fit_in_wrapper} which shows how the WRAPPER serves to insulate code  \ref{fig:fit_in_wrapper} which shows how the WRAPPER serves to insulate code
91  that fits within it from architectural differences between hardware platforms  that fits within it from architectural differences between hardware platforms
92  and operating systems. This allows numerical code to be easily retargetted.  and operating systems. This allows numerical code to be easily retargetted.
93    
94    
95  \begin{figure}  \begin{figure}
96  \begin{center}  \begin{center}
97   \resizebox{6in}{4.5in}{  \resizebox{!}{4.5in}{\includegraphics{part4/fit_in_wrapper.eps}}
   \includegraphics*[0.6in,0.7in][9.0in,8.5in]{part4/fit_in_wrapper.eps}  
  }  
98  \end{center}  \end{center}
99  \caption{ Numerical code is written too fit within a software support  \caption{
100    Numerical code is written to fit within a software support
101  infrastructure called WRAPPER. The WRAPPER is portable and  infrastructure called WRAPPER. The WRAPPER is portable and
102  can be sepcialized for a wide range of specific target hardware and  can be specialized for a wide range of specific target hardware and
103  programming environments, without impacting numerical code that fits  programming environments, without impacting numerical code that fits
104  within the WRAPPER. Codes that fit within the WRAPPER can generally be  within the WRAPPER. Codes that fit within the WRAPPER can generally be
105  made to run as fast on a particular platform as codes specially  made to run as fast on a particular platform as codes specially
106  optimized for that platform.  optimized for that platform.}
107  } \label{fig:fit_in_wrapper}  \label{fig:fit_in_wrapper}
108  \end{figure}  \end{figure}
109    
110  \subsection{Target hardware}  \subsection{Target hardware}
111  \label{sec:target_hardware}  \label{sect:target_hardware}
112    
113  The WRAPPER is designed to target as broad as possible a range of computer  The WRAPPER is designed to target as broad as possible a range of computer
114  systems. The original development of the WRAPPER took place on a  systems. The original development of the WRAPPER took place on a
# Line 116  uniprocessor and multi-processor Sun sys Line 120  uniprocessor and multi-processor Sun sys
120  (UMA) and non-uniform memory access (NUMA) designs. Significant work has also  (UMA) and non-uniform memory access (NUMA) designs. Significant work has also
121  been undertaken on x86 cluster systems, Alpha processor based clustered SMP  been undertaken on x86 cluster systems, Alpha processor based clustered SMP
122  systems, and on cache-coherent NUMA (CC-NUMA) systems from Silicon Graphics.  systems, and on cache-coherent NUMA (CC-NUMA) systems from Silicon Graphics.
123  The MITgcm code, operating within the WRAPPER, is also used routinely used on  The MITgcm code, operating within the WRAPPER, is also routinely used on
124  large scale MPP systems (for example T3E systems and IBM SP systems). In all  large scale MPP systems (for example T3E systems and IBM SP systems). In all
125  cases numerical code, operating within the WRAPPER, performs and scales very  cases numerical code, operating within the WRAPPER, performs and scales very
126  competitively with equivalent numerical code that has been modified to contain  competitively with equivalent numerical code that has been modified to contain
# Line 124  native optimizations for a particular sy Line 128  native optimizations for a particular sy
128    
129  \subsection{Supporting hardware neutrality}  \subsection{Supporting hardware neutrality}
130    
131  The different systems listed in section \ref{sec:target_hardware} can be  The different systems listed in section \ref{sect:target_hardware} can be
132  categorized in many different ways. For example, one common distinction is  categorized in many different ways. For example, one common distinction is
133  between shared-memory parallel systems (SMP's, PVP's) and distributed memory  between shared-memory parallel systems (SMP's, PVP's) and distributed memory
134  parallel systems (for example x86 clusters and large MPP systems). This is one  parallel systems (for example x86 clusters and large MPP systems). This is one
# Line 142  particular machine (for example an IBM S Line 146  particular machine (for example an IBM S
146  class of machines (for example Parallel Vector Processor Systems). Instead the  class of machines (for example Parallel Vector Processor Systems). Instead the
147  WRAPPER provides applications with an  WRAPPER provides applications with an
148  abstract {\it machine model}. The machine model is very general, however, it can  abstract {\it machine model}. The machine model is very general, however, it can
149  easily be specialized to fit, in a computationally effificent manner, any  easily be specialized to fit, in a computationally efficient manner, any
150  computer architecture currently available to the scientific computing community.  computer architecture currently available to the scientific computing community.
151    
152  \subsection{Machine model parallelism}  \subsection{Machine model parallelism}
153    
154   Codes operating under the WRAPPER target an abstract machine that is assumed to   Codes operating under the WRAPPER target an abstract machine that is assumed to
155  consist of one or more logical processors that can compute concurrently.    consist of one or more logical processors that can compute concurrently.  
156  Computational work is divided amongst the logical  Computational work is divided among the logical
157  processors by allocating ``ownership'' to  processors by allocating ``ownership'' to
158  each processor of a certain set (or sets) of calculations. Each set of  each processor of a certain set (or sets) of calculations. Each set of
159  calculations owned by a particular processor is associated with a specific  calculations owned by a particular processor is associated with a specific
# Line 172  Computationally, associated with each re Line 176  Computationally, associated with each re
176  space allocated to a particular logical processor, there will be data  space allocated to a particular logical processor, there will be data
177  structures (arrays, scalar variables etc...) that hold the simulated state of  structures (arrays, scalar variables etc...) that hold the simulated state of
178  that region. We refer to these data structures as being {\bf owned} by the  that region. We refer to these data structures as being {\bf owned} by the
179  pprocessor to which their  processor to which their
180  associated region of physical space has been allocated. Individual  associated region of physical space has been allocated. Individual
181  regions that are allocated to processors are called {\bf tiles}. A  regions that are allocated to processors are called {\bf tiles}. A
182  processor can own more  processor can own more
# Line 186  independently of the other tiles, in a s Line 190  independently of the other tiles, in a s
190    
191  \begin{figure}  \begin{figure}
192  \begin{center}  \begin{center}
193   \resizebox{7in}{3in}{   \resizebox{5in}{!}{
194    \includegraphics*[0.5in,2.7in][12.5in,6.4in]{part4/domain_decomp.eps}    \includegraphics{part4/domain_decomp.eps}
195   }   }
196  \end{center}  \end{center}
197  \caption{ The WRAPPER provides support for one and two dimensional  \caption{ The WRAPPER provides support for one and two dimensional
# Line 217  computational phases a processor will re Line 221  computational phases a processor will re
221  whenever it requires values that outside the domain it owns. Periodically  whenever it requires values that outside the domain it owns. Periodically
222  processors will make calls to WRAPPER functions to communicate data between  processors will make calls to WRAPPER functions to communicate data between
223  tiles, in order to keep the overlap regions up to date (see section  tiles, in order to keep the overlap regions up to date (see section
224  \ref{sec:communication_primitives}). The WRAPPER functions can use a  \ref{sect:communication_primitives}). The WRAPPER functions can use a
225  variety of different mechanisms to communicate data between tiles.  variety of different mechanisms to communicate data between tiles.
226    
227  \begin{figure}  \begin{figure}
228  \begin{center}  \begin{center}
229   \resizebox{7in}{3in}{   \resizebox{5in}{!}{
230    \includegraphics*[4.5in,3.7in][12.5in,6.7in]{part4/tiled-world.eps}    \includegraphics{part4/tiled-world.eps}
231   }   }
232  \end{center}  \end{center}
233  \caption{ A global grid subdivided into tiles.  \caption{ A global grid subdivided into tiles.
# Line 304  value to be communicated between CPU's. Line 308  value to be communicated between CPU's.
308  \end{figure}  \end{figure}
309    
310  \subsection{Shared memory communication}  \subsection{Shared memory communication}
311  \label{sec:shared_memory_communication}  \label{sect:shared_memory_communication}
312    
313  Under shared communication independent CPU's are operating  Under shared communication independent CPU's are operating
314  on the exact same global address space at the application level.  on the exact same global address space at the application level.
# Line 330  the systems main-memory interconnect. Th Line 334  the systems main-memory interconnect. Th
334  communication very efficient provided it is used appropriately.  communication very efficient provided it is used appropriately.
335    
336  \subsubsection{Memory consistency}  \subsubsection{Memory consistency}
337  \label{sec:memory_consistency}  \label{sect:memory_consistency}
338    
339  When using shared memory communication between  When using shared memory communication between
340  multiple processors the WRAPPER level shields user applications from  multiple processors the WRAPPER level shields user applications from
# Line 354  memory, the WRAPPER provides a place to Line 358  memory, the WRAPPER provides a place to
358  ensure memory consistency for a particular platform.  ensure memory consistency for a particular platform.
359    
360  \subsubsection{Cache effects and false sharing}  \subsubsection{Cache effects and false sharing}
361  \label{sec:cache_effects_and_false_sharing}  \label{sect:cache_effects_and_false_sharing}
362    
363  Shared-memory machines often have local to processor memory caches  Shared-memory machines often have local to processor memory caches
364  which contain mirrored copies of main memory. Automatic cache-coherence  which contain mirrored copies of main memory. Automatic cache-coherence
# Line 373  in an application are potentially visibl Line 377  in an application are potentially visibl
377  threads operating within a single process is the standard mechanism for  threads operating within a single process is the standard mechanism for
378  supporting shared memory that the WRAPPER utilizes. Configuring and launching  supporting shared memory that the WRAPPER utilizes. Configuring and launching
379  code to run in multi-threaded mode on specific platforms is discussed in  code to run in multi-threaded mode on specific platforms is discussed in
380  section \ref{sec:running_with_threads}.  However, on many systems, potentially  section \ref{sect:running_with_threads}.  However, on many systems, potentially
381  very efficient mechanisms for using shared memory communication between  very efficient mechanisms for using shared memory communication between
382  multiple processes (in contrast to multiple threads within a single  multiple processes (in contrast to multiple threads within a single
383  process) also exist. In most cases this works by making a limited region of  process) also exist. In most cases this works by making a limited region of
# Line 386  distributed with the default WRAPPER sou Line 390  distributed with the default WRAPPER sou
390  nature.  nature.
391    
392  \subsection{Distributed memory communication}  \subsection{Distributed memory communication}
393  \label{sec:distributed_memory_communication}  \label{sect:distributed_memory_communication}
394  Many parallel systems are not constructed in a way where it is  Many parallel systems are not constructed in a way where it is
395  possible or practical for an application to use shared memory  possible or practical for an application to use shared memory
396  for communication. For example cluster systems consist of individual computers  for communication. For example cluster systems consist of individual computers
# Line 400  described in \ref{hoe-hill:99} substitut Line 404  described in \ref{hoe-hill:99} substitut
404  highly optimized library.  highly optimized library.
405    
406  \subsection{Communication primitives}  \subsection{Communication primitives}
407  \label{sec:communication_primitives}  \label{sect:communication_primitives}
408    
409  \begin{figure}  \begin{figure}
410  \begin{center}  \begin{center}
411   \resizebox{5in}{3in}{   \resizebox{5in}{!}{
412    \includegraphics*[1.5in,0.7in][7.9in,4.4in]{part4/comm-primm.eps}    \includegraphics{part4/comm-primm.eps}
413   }   }
414  \end{center}  \end{center}
415  \caption{Three performance critical parallel primititives are provided  \caption{Three performance critical parallel primitives are provided
416  by the WRAPPER. These primititives are always used to communicate data  by the WRAPPER. These primitives are always used to communicate data
417  between tiles. The figure shows four tiles. The curved arrows indicate  between tiles. The figure shows four tiles. The curved arrows indicate
418  exchange primitives which transfer data between the overlap regions at tile  exchange primitives which transfer data between the overlap regions at tile
419  edges and interior regions for nearest-neighbor tiles.  edges and interior regions for nearest-neighbor tiles.
# Line 485  sub-domains. Line 489  sub-domains.
489    
490  \begin{figure}  \begin{figure}
491  \begin{center}  \begin{center}
492   \resizebox{5in}{3in}{   \resizebox{5in}{!}{
493    \includegraphics*[0.5in,1.3in][7.9in,5.7in]{part4/tiling_detail.eps}    \includegraphics{part4/tiling_detail.eps}
494   }   }
495  \end{center}  \end{center}
496  \caption{The tiling strategy that the WRAPPER supports allows tiles  \caption{The tiling strategy that the WRAPPER supports allows tiles
# Line 544  WRAPPER are Line 548  WRAPPER are
548  computing CPU's.  computing CPU's.
549  \end{enumerate}  \end{enumerate}
550  This section describes the details of each of these operations.  This section describes the details of each of these operations.
551  Section \ref{sec:specifying_a_decomposition} explains how the way in which  Section \ref{sect:specifying_a_decomposition} explains how the way in which
552  a domain is decomposed (or composed) is expressed. Section  a domain is decomposed (or composed) is expressed. Section
553  \ref{sec:starting_a_code} describes practical details of running codes  \ref{sect:starting_a_code} describes practical details of running codes
554  in various different parallel modes on contemporary computer systems.  in various different parallel modes on contemporary computer systems.
555  Section \ref{sec:controlling_communication} explains the internal information  Section \ref{sect:controlling_communication} explains the internal information
556  that the WRAPPER uses to control how information is communicated between  that the WRAPPER uses to control how information is communicated between
557  tiles.  tiles.
558    
559  \subsection{Specifying a domain decomposition}  \subsection{Specifying a domain decomposition}
560  \label{sec:specifying_a_decomposition}  \label{sect:specifying_a_decomposition}
561    
562  At its heart much of the WRAPPER works only in terms of a collection of tiles  At its heart much of the WRAPPER works only in terms of a collection of tiles
563  which are interconnected to each other. This is also true of application  which are interconnected to each other. This is also true of application
# Line 589  not cause any other problems. Line 593  not cause any other problems.
593    
594  \begin{figure}  \begin{figure}
595  \begin{center}  \begin{center}
596   \resizebox{5in}{7in}{   \resizebox{5in}{!}{
597    \includegraphics*[0.5in,0.3in][7.9in,10.7in]{part4/size_h.eps}    \includegraphics{part4/size_h.eps}
598   }   }
599  \end{center}  \end{center}
600  \caption{ The three level domain decomposition hierarchy employed by the  \caption{ The three level domain decomposition hierarchy employed by the
# Line 605  be created within a single process. Each Line 609  be created within a single process. Each
609  dimensions of {\em sNx} and {\em sNy}. If, when the code is executed, these tiles are  dimensions of {\em sNx} and {\em sNy}. If, when the code is executed, these tiles are
610  allocated to different threads of a process that are then bound to  allocated to different threads of a process that are then bound to
611  different physical processors ( see the multi-threaded  different physical processors ( see the multi-threaded
612  execution discussion in section \ref{sec:starting_the_code} ) then  execution discussion in section \ref{sect:starting_the_code} ) then
613  computation will be performed concurrently on each tile. However, it is also  computation will be performed concurrently on each tile. However, it is also
614  possible to run the same decomposition within a process running a single thread on  possible to run the same decomposition within a process running a single thread on
615  a single processor. In this case the tiles will be computed over sequentially.  a single processor. In this case the tiles will be computed over sequentially.
# Line 657  Within a {\em bi}, {\em bj} loop Line 661  Within a {\em bi}, {\em bj} loop
661  computation is performed concurrently over as many processes and threads  computation is performed concurrently over as many processes and threads
662  as there are physical processors available to compute.  as there are physical processors available to compute.
663    
664    An exception to the the use of {\em bi} and {\em bj} in loops arises in the
665    exchange routines used when the exch2 package is used with the cubed
666    sphere.  In this case {\em bj} is generally set to 1 and the loop runs from
667    1,{\em bi}.  Within the loop {\em bi} is used to retrieve the tile number,
668    which is then used to reference exchange parameters.
669    
670  The amount of computation that can be embedded  The amount of computation that can be embedded
671  a single loop over {\em bi} and {\em bj} varies for different parts of the  a single loop over {\em bi} and {\em bj} varies for different parts of the
672  MITgcm algorithm. Figure \ref{fig:bibj_extract} shows a code extract  MITgcm algorithm. Figure \ref{fig:bibj_extract} shows a code extract
# Line 777  The global domain size is again ninety g Line 787  The global domain size is again ninety g
787  forty grid points in y. The two sub-domains in each process will be computed  forty grid points in y. The two sub-domains in each process will be computed
788  sequentially if they are given to a single thread within a single process.  sequentially if they are given to a single thread within a single process.
789  Alternatively if the code is invoked with multiple threads per process  Alternatively if the code is invoked with multiple threads per process
790  the two domains in y may be computed on concurrently.  the two domains in y may be computed concurrently.
791  \item  \item
792  \begin{verbatim}  \begin{verbatim}
793        PARAMETER (        PARAMETER (
# Line 795  thirty-two grid points, and x and y over Line 805  thirty-two grid points, and x and y over
805  There are six tiles allocated to six separate logical processors ({\em nSx=6}).  There are six tiles allocated to six separate logical processors ({\em nSx=6}).
806  This set of values can be used for a cube sphere calculation.  This set of values can be used for a cube sphere calculation.
807  Each tile of size $32 \times 32$ represents a face of the  Each tile of size $32 \times 32$ represents a face of the
808  cube. Initialising the tile connectivity correctly ( see section  cube. Initializing the tile connectivity correctly ( see section
809  \ref{sec:cube_sphere_communication}. allows the rotations associated with  \ref{sect:cube_sphere_communication}. allows the rotations associated with
810  moving between the six cube faces to be embedded within the  moving between the six cube faces to be embedded within the
811  tile-tile communication code.  tile-tile communication code.
812  \end{enumerate}  \end{enumerate}
813    
814    
815  \subsection{Starting the code}  \subsection{Starting the code}
816  \label{sec:starting_the_code}  \label{sect:starting_the_code}
817  When code is started under the WRAPPER, execution begins in a main routine {\em  When code is started under the WRAPPER, execution begins in a main routine {\em
818  eesupp/src/main.F} that is owned by the WRAPPER. Control is transferred  eesupp/src/main.F} that is owned by the WRAPPER. Control is transferred
819  to the application through a routine called {\em THE\_MODEL\_MAIN()}  to the application through a routine called {\em THE\_MODEL\_MAIN()}
# Line 812  to support subsequent calls to communica Line 822  to support subsequent calls to communica
822  by the application code. The startup calling sequence followed by the  by the application code. The startup calling sequence followed by the
823  WRAPPER is shown in figure \ref{fig:wrapper_startup}.  WRAPPER is shown in figure \ref{fig:wrapper_startup}.
824    
   
825  \begin{figure}  \begin{figure}
826    {\footnotesize
827  \begin{verbatim}  \begin{verbatim}
828    
829         MAIN           MAIN  
# Line 842  WRAPPER is shown in figure \ref{fig:wrap Line 852  WRAPPER is shown in figure \ref{fig:wrap
852    
853    
854  \end{verbatim}  \end{verbatim}
855    }
856  \caption{Main stages of the WRAPPER startup procedure.  \caption{Main stages of the WRAPPER startup procedure.
857  This process proceeds transfer of control to application code, which  This process proceeds transfer of control to application code, which
858  occurs through the procedure {\em THE\_MODEL\_MAIN()}.  occurs through the procedure {\em THE\_MODEL\_MAIN()}.
# Line 849  occurs through the procedure {\em THE\_M Line 860  occurs through the procedure {\em THE\_M
860  \end{figure}  \end{figure}
861    
862  \subsubsection{Multi-threaded execution}  \subsubsection{Multi-threaded execution}
863    \label{sect:multi-threaded-execution}
864  Prior to transferring control to the procedure {\em THE\_MODEL\_MAIN()} the  Prior to transferring control to the procedure {\em THE\_MODEL\_MAIN()} the
865  WRAPPER may cause several coarse grain threads to be initialized. The routine  WRAPPER may cause several coarse grain threads to be initialized. The routine
866  {\em THE\_MODEL\_MAIN()} is called once for each thread and is passed a single  {\em THE\_MODEL\_MAIN()} is called once for each thread and is passed a single
867  stack argument which is the thread number, stored in the  stack argument which is the thread number, stored in the
868  variable {\em myThid}. In addition to specifying a decomposition with  variable {\em myThid}. In addition to specifying a decomposition with
869  multiple tiles per process ( see section \ref{sec:specifying_a_decomposition})  multiple tiles per process ( see section \ref{sect:specifying_a_decomposition})
870  configuring and starting a code to run using multiple threads requires the following  configuring and starting a code to run using multiple threads requires the following
871  steps.\\  steps.\\
872    
# Line 904  parallelization the compiler may otherwi Line 916  parallelization the compiler may otherwi
916  \end{enumerate}  \end{enumerate}
917    
918    
 \paragraph{Environment variables}  
 On most systems multi-threaded execution also requires the setting  
 of a special environment variable. On many machines this variable  
 is called PARALLEL and its values should be set to the number  
 of parallel threads required. Generally the help pages associated  
 with the multi-threaded compiler on a machine will explain  
 how to set the required environment variables for that machines.  
   
 \paragraph{Runtime input parameters}  
 Finally the file {\em eedata} needs to be configured to indicate  
 the number of threads to be used in the x and y directions.  
 The variables {\em nTx} and {\em nTy} in this file are used to  
 specify the information required. The product of {\em nTx} and  
 {\em nTy} must be equal to the number of threads spawned i.e.  
 the setting of the environment variable PARALLEL.  
 The value of {\em nTx} must subdivide the number of sub-domains  
 in x ({\em nSx}) exactly. The value of {\em nTy} must subdivide the  
 number of sub-domains in y ({\em nSy}) exactly.  
   
919  An example of valid settings for the {\em eedata} file for a  An example of valid settings for the {\em eedata} file for a
920  domain with two subdomains in y and running with two threads is shown  domain with two subdomains in y and running with two threads is shown
921  below  below
# Line 942  File: {\em eesupp/inc/MAIN\_PDIRECTIVES1 Line 935  File: {\em eesupp/inc/MAIN\_PDIRECTIVES1
935  File: {\em eesupp/inc/MAIN\_PDIRECTIVES2.h}\\  File: {\em eesupp/inc/MAIN\_PDIRECTIVES2.h}\\
936  File: {\em model/src/THE\_MODEL\_MAIN.F}\\  File: {\em model/src/THE\_MODEL\_MAIN.F}\\
937  File: {\em eesupp/src/MAIN.F}\\  File: {\em eesupp/src/MAIN.F}\\
938  File: {\em tools/genmake}\\  File: {\em tools/genmake2}\\
939  File: {\em eedata}\\  File: {\em eedata}\\
940  CPP:  {\em TARGET\_SUN}\\  CPP:  {\em TARGET\_SUN}\\
941  CPP:  {\em TARGET\_DEC}\\  CPP:  {\em TARGET\_DEC}\\
# Line 955  Parameter:  {\em nTy} Line 948  Parameter:  {\em nTy}
948  } \\  } \\
949    
950  \subsubsection{Multi-process execution}  \subsubsection{Multi-process execution}
951    \label{sect:multi-process-execution}
952    
953  Despite its appealing programming model, multi-threaded execution remains  Despite its appealing programming model, multi-threaded execution remains
954  less common then multi-process execution. One major reason for this  less common then multi-process execution. One major reason for this
# Line 966  models varies between systems. Line 960  models varies between systems.
960    
961  Multi-process execution is more ubiquitous.  Multi-process execution is more ubiquitous.
962  In order to run code in a multi-process configuration a decomposition  In order to run code in a multi-process configuration a decomposition
963  specification is given ( in which the at least one of the  specification ( see section \ref{sect:specifying_a_decomposition})
964    is given ( in which the at least one of the
965  parameters {\em nPx} or {\em nPy} will be greater than one)  parameters {\em nPx} or {\em nPy} will be greater than one)
966  and then, as for multi-threaded operation,  and then, as for multi-threaded operation,
967  appropriate compile time and run time steps must be taken.  appropriate compile time and run time steps must be taken.
# Line 995  Parameter:  {\em nPy} Line 990  Parameter:  {\em nPy}
990    
991  Additionally, compile time options are required to link in the  Additionally, compile time options are required to link in the
992  MPI libraries and header files. Examples of these options  MPI libraries and header files. Examples of these options
993  can be found in the {\em genmake} script that creates makefiles  can be found in the {\em genmake2} script that creates makefiles
994  for compilation. When this script is executed with the {bf -mpi}  for compilation. When this script is executed with the {bf -mpi}
995  flag it will generate a makefile that includes  flag it will generate a makefile that includes
996  paths for search for MPI head files and for linking in  paths for search for MPI head files and for linking in
# Line 1017  local configuration of your system.\\ Line 1012  local configuration of your system.\\
1012    
1013  \fbox{  \fbox{
1014  \begin{minipage}{4.75in}  \begin{minipage}{4.75in}
1015  File: {\em tools/genmake}  File: {\em tools/genmake2}
1016  \end{minipage}  \end{minipage}
1017  } \\  } \\
1018  \paragraph{\bf Execution} The mechanics of starting a program in  \paragraph{\bf Execution} The mechanics of starting a program in
# Line 1029  using a command such as Line 1024  using a command such as
1024  \begin{verbatim}  \begin{verbatim}
1025  mpirun -np 64 -machinefile mf ./mitgcmuv  mpirun -np 64 -machinefile mf ./mitgcmuv
1026  \end{verbatim}  \end{verbatim}
1027  In this example the text {\em -np 64} specifices the number of processes  In this example the text {\em -np 64} specifies the number of processes
1028  that will be created. The numeric value {\em 64} must be equal to the  that will be created. The numeric value {\em 64} must be equal to the
1029  product of the processor grid settings of {\em nPx} and {\em nPy}  product of the processor grid settings of {\em nPx} and {\em nPy}
1030  in the file {\em SIZE.h}. The parameter {\em mf} specifies that a text file  in the file {\em SIZE.h}. The parameter {\em mf} specifies that a text file
# Line 1046  Parameter: {\em nPy} Line 1041  Parameter: {\em nPy}
1041  \end{minipage}  \end{minipage}
1042  } \\  } \\
1043    
1044    
1045    \paragraph{Environment variables}
1046    On most systems multi-threaded execution also requires the setting
1047    of a special environment variable. On many machines this variable
1048    is called PARALLEL and its values should be set to the number
1049    of parallel threads required. Generally the help pages associated
1050    with the multi-threaded compiler on a machine will explain
1051    how to set the required environment variables for that machines.
1052    
1053    \paragraph{Runtime input parameters}
1054    Finally the file {\em eedata} needs to be configured to indicate
1055    the number of threads to be used in the x and y directions.
1056    The variables {\em nTx} and {\em nTy} in this file are used to
1057    specify the information required. The product of {\em nTx} and
1058    {\em nTy} must be equal to the number of threads spawned i.e.
1059    the setting of the environment variable PARALLEL.
1060    The value of {\em nTx} must subdivide the number of sub-domains
1061    in x ({\em nSx}) exactly. The value of {\em nTy} must subdivide the
1062    number of sub-domains in y ({\em nSy}) exactly.
1063  The multiprocess startup of the MITgcm executable {\em mitgcmuv}  The multiprocess startup of the MITgcm executable {\em mitgcmuv}
1064  is controlled by the routines {\em EEBOOT\_MINIMAL()} and  is controlled by the routines {\em EEBOOT\_MINIMAL()} and
1065  {\em INI\_PROCS()}. The first routine performs basic steps required  {\em INI\_PROCS()}. The first routine performs basic steps required
# Line 1058  number so that process number 0 will cre Line 1072  number so that process number 0 will cre
1072  output files {\bf STDOUT.0001} and {\bf STDERR.0001} etc... These files  output files {\bf STDOUT.0001} and {\bf STDERR.0001} etc... These files
1073  are used for reporting status and configuration information and  are used for reporting status and configuration information and
1074  for reporting error conditions on a process by process basis.  for reporting error conditions on a process by process basis.
1075  The {{\em EEBOOT\_MINIMAL()} procedure also sets the variables  The {\em EEBOOT\_MINIMAL()} procedure also sets the variables
1076  {\em myProcId} and {\em MPI\_COMM\_MODEL}.  {\em myProcId} and {\em MPI\_COMM\_MODEL}.
1077  These variables are related  These variables are related
1078  to processor identification are are used later in the routine  to processor identification are are used later in the routine
# Line 1099  Parameter: {\em pidN       } Line 1113  Parameter: {\em pidN       }
1113  The WRAPPER maintains internal information that is used for communication  The WRAPPER maintains internal information that is used for communication
1114  operations and that can be customized for different platforms. This section  operations and that can be customized for different platforms. This section
1115  describes the information that is held and used.  describes the information that is held and used.
1116    
1117  \begin{enumerate}  \begin{enumerate}
1118  \item {\bf Tile-tile connectivity information} For each tile the WRAPPER  \item {\bf Tile-tile connectivity information} For each tile the WRAPPER
1119  sets a flag that sets the tile number to the north, south, east and  sets a flag that sets the tile number to the north, south, east and
# Line 1112  This information is held in the variable Line 1127  This information is held in the variable
1127  This latter set of variables can take one of the following values  This latter set of variables can take one of the following values
1128  {\em COMM\_NONE}, {\em COMM\_MSG}, {\em COMM\_PUT} and {\em COMM\_GET}.  {\em COMM\_NONE}, {\em COMM\_MSG}, {\em COMM\_PUT} and {\em COMM\_GET}.
1129  A value of {\em COMM\_NONE} is used to indicate that a tile has no  A value of {\em COMM\_NONE} is used to indicate that a tile has no
1130  neighbor to cummnicate with on a particular face. A value  neighbor to communicate with on a particular face. A value
1131  of {\em COMM\_MSG} is used to indicated that some form of distributed  of {\em COMM\_MSG} is used to indicated that some form of distributed
1132  memory communication is required to communicate between  memory communication is required to communicate between
1133  these tile faces ( see section \ref{sec:distributed_memory_communication}).  these tile faces ( see section \ref{sect:distributed_memory_communication}).
1134  A value of {\em COMM\_PUT} or {\em COMM\_GET} is used to indicate  A value of {\em COMM\_PUT} or {\em COMM\_GET} is used to indicate
1135  forms of shared memory communication ( see section  forms of shared memory communication ( see section
1136  \ref{sec:shared_memory_communication}). The {\em COMM\_PUT} value indicates  \ref{sect:shared_memory_communication}). The {\em COMM\_PUT} value indicates
1137  that a CPU should communicate by writing to data structures owned by another  that a CPU should communicate by writing to data structures owned by another
1138  CPU. A {\em COMM\_GET} value indicates that a CPU should communicate by reading  CPU. A {\em COMM\_GET} value indicates that a CPU should communicate by reading
1139  from data structures owned by another CPU. These flags affect the behavior  from data structures owned by another CPU. These flags affect the behavior
# Line 1169  the product of the parameters {\em nTx} Line 1184  the product of the parameters {\em nTx}
1184  are read from the file {\em eedata}. If the value of {\em nThreads}  are read from the file {\em eedata}. If the value of {\em nThreads}
1185  is inconsistent with the number of threads requested from the  is inconsistent with the number of threads requested from the
1186  operating system (for example by using an environment  operating system (for example by using an environment
1187  varialble as described in section \ref{sec:multi_threaded_execution})  variable as described in section \ref{sect:multi_threaded_execution})
1188  then usually an error will be reported by the routine  then usually an error will be reported by the routine
1189  {\em CHECK\_THREADS}.\\  {\em CHECK\_THREADS}.\\
1190    
# Line 1186  Parameter: {\em nTy} \\ Line 1201  Parameter: {\em nTy} \\
1201  \end{minipage}  \end{minipage}
1202  }  }
1203    
 \begin{figure}  
 \begin{verbatim}  
 C--  
 C--  Parallel directives for MIPS Pro Fortran compiler  
 C--  
 C      Parallel compiler directives for SGI with IRIX  
 C$PAR  PARALLEL DO  
 C$PAR&  CHUNK=1,MP_SCHEDTYPE=INTERLEAVE,  
 C$PAR&  SHARE(nThreads),LOCAL(myThid,I)  
 C  
       DO I=1,nThreads  
         myThid = I  
   
 C--     Invoke nThreads instances of the numerical model  
         CALL THE_MODEL_MAIN(myThid)  
   
       ENDDO  
 \end{verbatim}  
 \caption{Prior to transferring control to  
 the procedure {\em THE\_MODEL\_MAIN()} the WRAPPER may use  
 MP directives to spawn multiple threads.  
 } \label{fig:mp_directives}  
 \end{figure}  
   
   
1204  \item {\bf memsync flags}  \item {\bf memsync flags}
1205  As discussed in section \ref{sec:memory_consistency}, when using shared memory,  As discussed in section \ref{sect:memory_consistency}, when using shared memory,
1206  a low-level system function may be need to force memory consistency.  a low-level system function may be need to force memory consistency.
1207  The routine {\em MEMSYNC()} is used for this purpose. This routine should  The routine {\em MEMSYNC()} is used for this purpose. This routine should
1208  not need modifying and the information below is only provided for  not need modifying and the information below is only provided for
# Line 1228  For an Ultra Sparc system the following Line 1218  For an Ultra Sparc system the following
1218  \begin{verbatim}  \begin{verbatim}
1219  asm("membar #LoadStore|#StoreStore");  asm("membar #LoadStore|#StoreStore");
1220  \end{verbatim}  \end{verbatim}
1221  for an Alpha based sytem the euivalent code reads  for an Alpha based system the equivalent code reads
1222  \begin{verbatim}  \begin{verbatim}
1223  asm("mb");  asm("mb");
1224  \end{verbatim}  \end{verbatim}
# Line 1238  asm("lock; addl $0,0(%%esp)": : :"memory Line 1228  asm("lock; addl $0,0(%%esp)": : :"memory
1228  \end{verbatim}  \end{verbatim}
1229    
1230  \item {\bf Cache line size}  \item {\bf Cache line size}
1231  As discussed in section \ref{sec:cache_effects_and_false_sharing},  As discussed in section \ref{sect:cache_effects_and_false_sharing},
1232  milti-threaded codes explicitly avoid penalties associated with excessive  milti-threaded codes explicitly avoid penalties associated with excessive
1233  coherence traffic on an SMP system. To do this the sgared memory data structures  coherence traffic on an SMP system. To do this the shared memory data structures
1234  used by the {\em GLOBAL\_SUM}, {\em GLOBAL\_MAX} and {\em BARRIER} routines  used by the {\em GLOBAL\_SUM}, {\em GLOBAL\_MAX} and {\em BARRIER} routines
1235  are padded. The variables that control the padding are set in the  are padded. The variables that control the padding are set in the
1236  header file {\em EEPARAMS.h}. These variables are called  header file {\em EEPARAMS.h}. These variables are called
# Line 1248  header file {\em EEPARAMS.h}. These vari Line 1238  header file {\em EEPARAMS.h}. These vari
1238  {\em lShare8}. The default values should not normally need changing.  {\em lShare8}. The default values should not normally need changing.
1239  \item {\bf \_BARRIER}  \item {\bf \_BARRIER}
1240  This is a CPP macro that is expanded to a call to a routine  This is a CPP macro that is expanded to a call to a routine
1241  which synchronises all the logical processors running under the  which synchronizes all the logical processors running under the
1242  WRAPPER. Using a macro here preserves flexibility to insert  WRAPPER. Using a macro here preserves flexibility to insert
1243  a specialized call in-line into application code. By default this  a specialized call in-line into application code. By default this
1244  resolves to calling the procedure {\em BARRIER()}. The default  resolves to calling the procedure {\em BARRIER()}. The default
# Line 1256  setting for the \_BARRIER macro is given Line 1246  setting for the \_BARRIER macro is given
1246    
1247  \item {\bf \_GSUM}  \item {\bf \_GSUM}
1248  This is a CPP macro that is expanded to a call to a routine  This is a CPP macro that is expanded to a call to a routine
1249  which sums up a floating point numner  which sums up a floating point number
1250  over all the logical processors running under the  over all the logical processors running under the
1251  WRAPPER. Using a macro here provides extra flexibility to insert  WRAPPER. Using a macro here provides extra flexibility to insert
1252  a specialized call in-line into application code. By default this  a specialized call in-line into application code. By default this
1253  resolves to calling the procedure {\em GLOBAL\_SOM\_R8()} ( for  resolves to calling the procedure {\em GLOBAL\_SUM\_R8()} ( for
1254  84=bit floating point operands)  64-bit floating point operands)
1255  or {\em GLOBAL\_SOM\_R4()} (for 32-bit floating point operands). The default  or {\em GLOBAL\_SUM\_R4()} (for 32-bit floating point operands). The default
1256  setting for the \_GSUM macro is given in the file {\em CPP\_EEMACROS.h}.  setting for the \_GSUM macro is given in the file {\em CPP\_EEMACROS.h}.
1257  The \_GSUM macro is a performance critical operation, especially for  The \_GSUM macro is a performance critical operation, especially for
1258  large processor count, small tile size configurations.  large processor count, small tile size configurations.
1259  The custom communication example discussed in section \ref{sec:jam_example}  The custom communication example discussed in section \ref{sect:jam_example}
1260  shows how the macro is used to invoke a custom global sum routine  shows how the macro is used to invoke a custom global sum routine
1261  for a specific set of hardware.  for a specific set of hardware.
1262    
# Line 1280  physical fields and whether fields are 3 Line 1270  physical fields and whether fields are 3
1270  in the header file {\em CPP\_EEMACROS.h}. As with \_GSUM, the  in the header file {\em CPP\_EEMACROS.h}. As with \_GSUM, the
1271  \_EXCH operation plays a crucial role in scaling to small tile,  \_EXCH operation plays a crucial role in scaling to small tile,
1272  large logical and physical processor count configurations.  large logical and physical processor count configurations.
1273  The example in section \ref{sec:jam_example} discusses defining an  The example in section \ref{sect:jam_example} discusses defining an
1274  optimised and specialized form on the \_EXCH operation.  optimized and specialized form on the \_EXCH operation.
1275    
1276  The \_EXCH operation is also central to supporting grids such as  The \_EXCH operation is also central to supporting grids such as
1277  the cube-sphere grid. In this class of grid a rotation may be required  the cube-sphere grid. In this class of grid a rotation may be required
1278  between tiles. Aligning the coordinate requiring rotation with the  between tiles. Aligning the coordinate requiring rotation with the
1279  tile decomposistion, allows the coordinate transformation to  tile decomposition, allows the coordinate transformation to
1280  be embedded within a custom form of the \_EXCH primitive.  be embedded within a custom form of the \_EXCH primitive.
1281    
1282  \item {\bf Reverse Mode}  \item {\bf Reverse Mode}
1283  The communication primitives \_EXCH and \_GSUM both employ  The communication primitives \_EXCH and \_GSUM both employ
1284  hand-written adjoint forms (or reverse mode) forms.  hand-written adjoint forms (or reverse mode) forms.
1285  These reverse mode forms can be found in the  These reverse mode forms can be found in the
1286  sourc code directory {\em pkg/autodiff}.  source code directory {\em pkg/autodiff}.
1287  For the global sum primitive the reverse mode form  For the global sum primitive the reverse mode form
1288  calls are to {\em GLOBAL\_ADSUM\_R4} and  calls are to {\em GLOBAL\_ADSUM\_R4} and
1289  {\em GLOBAL\_ADSUM\_R8}. The reverse mode form of the  {\em GLOBAL\_ADSUM\_R8}. The reverse mode form of the
1290  exchamge primitives are found in routines  exchange primitives are found in routines
1291  prefixed {\em ADEXCH}. The exchange routines make calls to  prefixed {\em ADEXCH}. The exchange routines make calls to
1292  the same low-level communication primitives as the forward mode  the same low-level communication primitives as the forward mode
1293  operations. However, the routine argument {\em simulationMode}  operations. However, the routine argument {\em simulationMode}
# Line 1309  The variable {\em MAX\_NO\_THREADS} is u Line 1299  The variable {\em MAX\_NO\_THREADS} is u
1299  maximum number of OS threads that a code will use. This  maximum number of OS threads that a code will use. This
1300  value defaults to thirty-two and is set in the file {\em EEPARAMS.h}.  value defaults to thirty-two and is set in the file {\em EEPARAMS.h}.
1301  For single threaded execution it can be reduced to one if required.  For single threaded execution it can be reduced to one if required.
1302  The va;lue is largely private to the WRAPPER and application code  The value; is largely private to the WRAPPER and application code
1303  will nor normally reference the value, except in the following scenario.  will nor normally reference the value, except in the following scenario.
1304    
1305  For certain physical parametrization schemes it is necessary to have  For certain physical parametrization schemes it is necessary to have
# Line 1320  This can be achieved using a Fortran 90 Line 1310  This can be achieved using a Fortran 90
1310  if this might be unavailable then the work arrays can be extended  if this might be unavailable then the work arrays can be extended
1311  with dimensions use the tile dimensioning scheme of {\em nSx}  with dimensions use the tile dimensioning scheme of {\em nSx}
1312  and {\em nSy} ( as described in section  and {\em nSy} ( as described in section
1313  \ref{sec:specifying_a_decomposition}). However, if the configuration  \ref{sect:specifying_a_decomposition}). However, if the configuration
1314  being specified involves many more tiles than OS threads then  being specified involves many more tiles than OS threads then
1315  it can save memory resources to reduce the variable  it can save memory resources to reduce the variable
1316  {\em MAX\_NO\_THREADS} to be equal to the actual number of threads that  {\em MAX\_NO\_THREADS} to be equal to the actual number of threads that
1317  will be used and to declare the physical parameterisation  will be used and to declare the physical parameterization
1318  work arrays with a sinble {\em MAX\_NO\_THREADS} extra dimension.  work arrays with a single {\em MAX\_NO\_THREADS} extra dimension.
1319  An example of this is given in the verification experiment  An example of this is given in the verification experiment
1320  {\em aim.5l\_cs}. Here the default setting of  {\em aim.5l\_cs}. Here the default setting of
1321  {\em MAX\_NO\_THREADS} is altered to  {\em MAX\_NO\_THREADS} is altered to
# Line 1338  created with declarations of the form. Line 1328  created with declarations of the form.
1328  \begin{verbatim}  \begin{verbatim}
1329        common /FORCIN/ sst1(ngp,MAX_NO_THREADS)        common /FORCIN/ sst1(ngp,MAX_NO_THREADS)
1330  \end{verbatim}  \end{verbatim}
1331  This declaration scheme is not used widely, becuase most global data  This declaration scheme is not used widely, because most global data
1332  is used for permanent not temporary storage of state information.  is used for permanent not temporary storage of state information.
1333  In the case of permanent state information this approach cannot be used  In the case of permanent state information this approach cannot be used
1334  because there has to be enough storage allocated for all tiles.  because there has to be enough storage allocated for all tiles.
1335  However, the technique can sometimes be a useful scheme for reducing memory  However, the technique can sometimes be a useful scheme for reducing memory
1336  requirements in complex physical paramterisations.  requirements in complex physical parameterizations.
   
1337  \end{enumerate}  \end{enumerate}
1338    
1339    \begin{figure}
1340    \begin{verbatim}
1341    C--
1342    C--  Parallel directives for MIPS Pro Fortran compiler
1343    C--
1344    C      Parallel compiler directives for SGI with IRIX
1345    C$PAR  PARALLEL DO
1346    C$PAR&  CHUNK=1,MP_SCHEDTYPE=INTERLEAVE,
1347    C$PAR&  SHARE(nThreads),LOCAL(myThid,I)
1348    C
1349          DO I=1,nThreads
1350            myThid = I
1351    
1352    C--     Invoke nThreads instances of the numerical model
1353            CALL THE_MODEL_MAIN(myThid)
1354    
1355          ENDDO
1356    \end{verbatim}
1357    \caption{Prior to transferring control to
1358    the procedure {\em THE\_MODEL\_MAIN()} the WRAPPER may use
1359    MP directives to spawn multiple threads.
1360    } \label{fig:mp_directives}
1361    \end{figure}
1362    
1363    
1364  \subsubsection{Specializing the Communication Code}  \subsubsection{Specializing the Communication Code}
1365    
1366  The isolation of performance critical communication primitives and the  The isolation of performance critical communication primitives and the
1367  sub-division of the simulation domain into tiles is a powerful tool.  sub-division of the simulation domain into tiles is a powerful tool.
1368  Here we show how it can be used to improve application performance and  Here we show how it can be used to improve application performance and
1369  how it can be used to adapt to new gridding approaches.  how it can be used to adapt to new griding approaches.
1370    
1371  \subsubsection{JAM example}  \subsubsection{JAM example}
1372  \label{sec:jam_example}  \label{sect:jam_example}
1373  On some platforms a big performance boost can be obtained by  On some platforms a big performance boost can be obtained by
1374  binding the communication routines {\em \_EXCH} and  binding the communication routines {\em \_EXCH} and
1375  {\em \_GSUM} to specialized native libraries ) fro example the  {\em \_GSUM} to specialized native libraries ) fro example the
# Line 1371  communications library ( see {\em ini\_j Line 1385  communications library ( see {\em ini\_j
1385  \item The {\em \_GSUM} and {\em \_EXCH} macro definitions are replaced  \item The {\em \_GSUM} and {\em \_EXCH} macro definitions are replaced
1386  with calls to custom routines ( see {\em gsum\_jam.F} and {\em exch\_jam.F})  with calls to custom routines ( see {\em gsum\_jam.F} and {\em exch\_jam.F})
1387  \item a highly specialized form of the exchange operator (optimized  \item a highly specialized form of the exchange operator (optimized
1388  for overlap regions of width one) is substitued into the elliptic  for overlap regions of width one) is substituted into the elliptic
1389  solver routine {\em cg2d.F}.  solver routine {\em cg2d.F}.
1390  \end{itemize}  \end{itemize}
1391  Developing specialized code for other libraries follows a similar  Developing specialized code for other libraries follows a similar
1392  pattern.  pattern.
1393    
1394  \subsubsection{Cube sphere communication}  \subsubsection{Cube sphere communication}
1395  \label{sec:cube_sphere_communication}  \label{sect:cube_sphere_communication}
1396  Actual {\em \_EXCH} routine code is generated automatically from  Actual {\em \_EXCH} routine code is generated automatically from
1397  a series of template files, for example {\em exch\_rx.template}.  a series of template files, for example {\em exch\_rx.template}.
1398  This is done to allow a large number of variations on the exchange  This is done to allow a large number of variations on the exchange
1399  process to be maintained. One set of variations supports the  process to be maintained. One set of variations supports the
1400  cube sphere grid. Support for a cube sphere gris in MITgcm is based  cube sphere grid. Support for a cube sphere grid in MITgcm is based
1401  on having each face of the cube as a separate tile (or tiles).  on having each face of the cube as a separate tile (or tiles).
1402  The exchage routines are then able to absorb much of the  The exchange routines are then able to absorb much of the
1403  detailed rotation and reorientation required when moving around the  detailed rotation and reorientation required when moving around the
1404  cube grid. The set of {\em \_EXCH} routines that contain the  cube grid. The set of {\em \_EXCH} routines that contain the
1405  word cube in their name perform these transformations.  word cube in their name perform these transformations.
1406  They are invoked when the run-time logical parameter  They are invoked when the run-time logical parameter
1407  {\em useCubedSphereExchange} is set true. To facilitate the  {\em useCubedSphereExchange} is set true. To facilitate the
1408  transformations on a staggered C-grid, exchange operations are defined  transformations on a staggered C-grid, exchange operations are defined
1409  separately for both vector and scalar quantitities and for  separately for both vector and scalar quantities and for
1410  grid-centered and for grid-face and corner quantities.  grid-centered and for grid-face and corner quantities.
1411  Three sets of exchange routines are defined. Routines  Three sets of exchange routines are defined. Routines
1412  with names of the form {\em exch\_rx} are used to exchange  with names of the form {\em exch\_rx} are used to exchange
# Line 1411  quantities at the C-grid vorticity point Line 1425  quantities at the C-grid vorticity point
1425    
1426  Fitting together the WRAPPER elements, package elements and  Fitting together the WRAPPER elements, package elements and
1427  MITgcm core equation elements of the source code produces calling  MITgcm core equation elements of the source code produces calling
1428  sequence shown in section \ref{sec:calling_sequence}  sequence shown in section \ref{sect:calling_sequence}
1429    
1430  \subsection{Annotated call tree for MITgcm and WRAPPER}  \subsection{Annotated call tree for MITgcm and WRAPPER}
1431  \label{sec:calling_sequence}  \label{sect:calling_sequence}
1432    
1433  WRAPPER layer.  WRAPPER layer.
1434    
1435    {\footnotesize
1436  \begin{verbatim}  \begin{verbatim}
1437    
1438         MAIN           MAIN  
# Line 1445  WRAPPER layer. Line 1460  WRAPPER layer.
1460         |--THE_MODEL_MAIN   :: Numerical code top-level driver routine         |--THE_MODEL_MAIN   :: Numerical code top-level driver routine
1461    
1462  \end{verbatim}  \end{verbatim}
1463    }
1464    
1465  Core equations plus packages.  Core equations plus packages.
1466    
1467    {\footnotesize
1468  \begin{verbatim}  \begin{verbatim}
1469  C  C
1470  C  C
# Line 1457  C  : Line 1474  C  :
1474  C  |  C  |
1475  C  |-THE_MODEL_MAIN :: Primary driver for the MITgcm algorithm  C  |-THE_MODEL_MAIN :: Primary driver for the MITgcm algorithm
1476  C    |              :: Called from WRAPPER level numerical  C    |              :: Called from WRAPPER level numerical
1477  C    |              :: code innvocation routine. On entry  C    |              :: code invocation routine. On entry
1478  C    |              :: to THE_MODEL_MAIN separate thread and  C    |              :: to THE_MODEL_MAIN separate thread and
1479  C    |              :: separate processes will have been established.  C    |              :: separate processes will have been established.
1480  C    |              :: Each thread and process will have a unique ID  C    |              :: Each thread and process will have a unique ID
# Line 1471  C    | |-INI_PARMS :: Routine to set ker Line 1488  C    | |-INI_PARMS :: Routine to set ker
1488  C    | |           :: By default kernel parameters are read from file  C    | |           :: By default kernel parameters are read from file
1489  C    | |           :: "data" in directory in which code executes.  C    | |           :: "data" in directory in which code executes.
1490  C    | |  C    | |
1491  C    | |-MON_INIT :: Initialises monitor pacakge ( see pkg/monitor )  C    | |-MON_INIT :: Initializes monitor package ( see pkg/monitor )
1492  C    | |  C    | |
1493  C    | |-INI_GRID :: Control grid array (vert. and hori.) initialisation.  C    | |-INI_GRID :: Control grid array (vert. and hori.) initialization.
1494  C    | | |        :: Grid arrays are held and described in GRID.h.  C    | | |        :: Grid arrays are held and described in GRID.h.
1495  C    | | |  C    | | |
1496  C    | | |-INI_VERTICAL_GRID        :: Initialise vertical grid arrays.  C    | | |-INI_VERTICAL_GRID        :: Initialize vertical grid arrays.
1497  C    | | |  C    | | |
1498  C    | | |-INI_CARTESIAN_GRID       :: Cartesian horiz. grid initialisation  C    | | |-INI_CARTESIAN_GRID       :: Cartesian horiz. grid initialization
1499  C    | | |                          :: (calculate grid from kernel parameters).  C    | | |                          :: (calculate grid from kernel parameters).
1500  C    | | |  C    | | |
1501  C    | | |-INI_SPHERICAL_POLAR_GRID :: Spherical polar horiz. grid  C    | | |-INI_SPHERICAL_POLAR_GRID :: Spherical polar horiz. grid
1502  C    | | |                          :: initialisation (calculate grid from  C    | | |                          :: initialization (calculate grid from
1503  C    | | |                          :: kernel parameters).  C    | | |                          :: kernel parameters).
1504  C    | | |  C    | | |
1505  C    | | |-INI_CURVILINEAR_GRID     :: General orthogonal, structured horiz.  C    | | |-INI_CURVILINEAR_GRID     :: General orthogonal, structured horiz.
1506  C    | |                            :: grid initialisations. ( input from raw  C    | |                            :: grid initializations. ( input from raw
1507  C    | |                            :: grid files, LONC.bin, DXF.bin etc... )  C    | |                            :: grid files, LONC.bin, DXF.bin etc... )
1508  C    | |  C    | |
1509  C    | |-INI_DEPTHS    :: Read (from "bathyFile") or set bathymetry/orgography.  C    | |-INI_DEPTHS    :: Read (from "bathyFile") or set bathymetry/orgography.
# Line 1497  C    | | Line 1514  C    | |
1514  C    | |-INI_LINEAR_PHSURF :: Set ref. surface Bo_surf  C    | |-INI_LINEAR_PHSURF :: Set ref. surface Bo_surf
1515  C    | |  C    | |
1516  C    | |-INI_CORI          :: Set coriolis term. zero, f-plane, beta-plane,  C    | |-INI_CORI          :: Set coriolis term. zero, f-plane, beta-plane,
1517  C    | |                   :: sphere optins are coded.  C    | |                   :: sphere options are coded.
1518  C    | |  C    | |
1519  C    | |-PACAKGES_BOOT      :: Start up the optional package environment.  C    | |-PACAKGES_BOOT      :: Start up the optional package environment.
1520  C    | |                    :: Runtime selection of active packages.  C    | |                    :: Runtime selection of active packages.
# Line 1518  C    | | Line 1535  C    | |
1535  C    | |-PACKAGES_CHECK  C    | |-PACKAGES_CHECK
1536  C    | | |  C    | | |
1537  C    | | |-KPP_CHECK           :: KPP Package. pkg/kpp  C    | | |-KPP_CHECK           :: KPP Package. pkg/kpp
1538  C    | | |-OBCS_CHECK          :: Open bndy Pacakge. pkg/obcs  C    | | |-OBCS_CHECK          :: Open bndy Package. pkg/obcs
1539  C    | | |-GMREDI_CHECK        :: GM Package. pkg/gmredi  C    | | |-GMREDI_CHECK        :: GM Package. pkg/gmredi
1540  C    | |  C    | |
1541  C    | |-PACKAGES_INIT_FIXED  C    | |-PACKAGES_INIT_FIXED
# Line 1538  C    | Line 1555  C    |
1555  C    |-CTRL_UNPACK :: Control vector support package. see pkg/ctrl  C    |-CTRL_UNPACK :: Control vector support package. see pkg/ctrl
1556  C    |  C    |
1557  C    |-ADTHE_MAIN_LOOP :: Derivative evaluating form of main time stepping loop  C    |-ADTHE_MAIN_LOOP :: Derivative evaluating form of main time stepping loop
1558  C    !                 :: Auotmatically gerenrated by TAMC/TAF.  C    !                 :: Auotmatically generated by TAMC/TAF.
1559  C    |  C    |
1560  C    |-CTRL_PACK   :: Control vector support package. see pkg/ctrl  C    |-CTRL_PACK   :: Control vector support package. see pkg/ctrl
1561  C    |  C    |
# Line 1552  C    | | | Line 1569  C    | | |
1569  C    | | |-INI_LINEAR_PHISURF :: Set ref. surface Bo_surf  C    | | |-INI_LINEAR_PHISURF :: Set ref. surface Bo_surf
1570  C    | | |  C    | | |
1571  C    | | |-INI_CORI     :: Set coriolis term. zero, f-plane, beta-plane,  C    | | |-INI_CORI     :: Set coriolis term. zero, f-plane, beta-plane,
1572  C    | | |              :: sphere optins are coded.  C    | | |              :: sphere options are coded.
1573  C    | | |  C    | | |
1574  C    | | |-INI_CG2D     :: 2d con. grad solver initialisation.  C    | | |-INI_CG2D     :: 2d con. grad solver initialisation.
1575  C    | | |-INI_CG3D     :: 3d con. grad solver initialisation.  C    | | |-INI_CG3D     :: 3d con. grad solver initialisation.
# Line 1560  C    | | |-INI_MIXING   :: Initialise di Line 1577  C    | | |-INI_MIXING   :: Initialise di
1577  C    | | |-INI_DYNVARS  :: Initialise to zero all DYNVARS.h arrays (dynamical  C    | | |-INI_DYNVARS  :: Initialise to zero all DYNVARS.h arrays (dynamical
1578  C    | | |              :: fields).  C    | | |              :: fields).
1579  C    | | |  C    | | |
1580  C    | | |-INI_FIELDS   :: Control initialising model fields to non-zero  C    | | |-INI_FIELDS   :: Control initializing model fields to non-zero
1581  C    | | | |-INI_VEL    :: Initialize 3D flow field.  C    | | | |-INI_VEL    :: Initialize 3D flow field.
1582  C    | | | |-INI_THETA  :: Set model initial temperature field.  C    | | | |-INI_THETA  :: Set model initial temperature field.
1583  C    | | | |-INI_SALT   :: Set model initial salinity field.  C    | | | |-INI_SALT   :: Set model initial salinity field.
# Line 1638  C/\  | | |-CALC_EXACT_ETA :: Change SSH Line 1655  C/\  | | |-CALC_EXACT_ETA :: Change SSH
1655  C/\  | | |-CALC_SURF_DR   :: Calculate the new surface level thickness.  C/\  | | |-CALC_SURF_DR   :: Calculate the new surface level thickness.
1656  C/\  | | |-EXF_GETFORCING :: External forcing package. ( pkg/exf )  C/\  | | |-EXF_GETFORCING :: External forcing package. ( pkg/exf )
1657  C/\  | | |-EXTERNAL_FIELDS_LOAD :: Control loading time dep. external data.  C/\  | | |-EXTERNAL_FIELDS_LOAD :: Control loading time dep. external data.
1658  C/\  | | | |                    :: Simple interpolcation between end-points  C/\  | | | |                    :: Simple interpolation between end-points
1659  C/\  | | | |                    :: for forcing datasets.  C/\  | | | |                    :: for forcing datasets.
1660  C/\  | | | |                    C/\  | | | |                  
1661  C/\  | | | |-EXCH :: Sync forcing. in overlap regions.  C/\  | | | |-EXCH :: Sync forcing. in overlap regions.
# Line 1786  C    |-COMM_STATS     :: Summarise inter Line 1803  C    |-COMM_STATS     :: Summarise inter
1803  C                     :: events.  C                     :: events.
1804  C  C
1805  \end{verbatim}  \end{verbatim}
1806    }
1807    
1808  \subsection{Measuring and Characterizing Performance}  \subsection{Measuring and Characterizing Performance}
1809    

Legend:
Removed from v.1.1  
changed lines
  Added in v.1.11

  ViewVC Help
Powered by ViewVC 1.1.22