1 |
cnh |
1.3 |
C $Header: /u/gcmpack/models/MITgcmUV/eesupp/src/exch_rx_cube.template,v 1.2 2001/05/29 14:01:36 adcroft Exp $ |
2 |
|
|
C $Name: $ |
3 |
adcroft |
1.2 |
|
4 |
|
|
#include "CPP_EEOPTIONS.h" |
5 |
|
|
|
6 |
cnh |
1.3 |
CBOP |
7 |
|
|
C !ROUTINE: EXCH_RX_CUBE |
8 |
|
|
|
9 |
|
|
C !INTERFACE: |
10 |
adcroft |
1.2 |
SUBROUTINE EXCH_RX_CUBE( |
11 |
|
|
U array, |
12 |
|
|
I myOLw, myOLe, myOLn, myOLs, myNz, |
13 |
|
|
I exchWidthX, exchWidthY, |
14 |
|
|
I simulationMode, cornerMode, myThid ) |
15 |
|
|
IMPLICIT NONE |
16 |
|
|
|
17 |
cnh |
1.3 |
C !DESCRIPTION: |
18 |
|
|
C *==========================================================* |
19 |
|
|
C | SUBROUTINE EXCH_RX_CUBE |
20 |
|
|
C | o Control edge exchanges for RX array. |
21 |
|
|
C *==========================================================* |
22 |
|
|
C | |
23 |
|
|
C | Controlling routine for exchange of XY edges of an array |
24 |
|
|
C | distributed in X and Y. The routine interfaces to |
25 |
|
|
C | communication routines that can use messages passing |
26 |
|
|
C | exchanges, put type exchanges or get type exchanges. |
27 |
|
|
C | This allows anything from MPI to raw memory channel to |
28 |
|
|
C | memmap segments to be used as a inter-process and/or |
29 |
|
|
C | inter-thread communiation and synchronisation |
30 |
|
|
C | mechanism. |
31 |
|
|
C | Notes -- |
32 |
|
|
C | 1. Some low-level mechanisms such as raw memory-channel |
33 |
|
|
C | or SGI/CRAY shmem put do not have direct Fortran bindings |
34 |
|
|
C | and are invoked through C stub routines. |
35 |
|
|
C | 2. Although this routine is fairly general but it does |
36 |
|
|
C | require nSx and nSy are the same for all innvocations. |
37 |
|
|
C | There are many common data structures ( myByLo, |
38 |
|
|
C | westCommunicationMode, mpiIdW etc... ) tied in with |
39 |
|
|
C | (nSx,nSy). To support arbitray nSx and nSy would require |
40 |
|
|
C | general forms of these. |
41 |
|
|
C | |
42 |
|
|
C *==========================================================* |
43 |
|
|
|
44 |
|
|
C !USES: |
45 |
adcroft |
1.2 |
C == Global data == |
46 |
|
|
#include "SIZE.h" |
47 |
|
|
#include "EEPARAMS.h" |
48 |
|
|
#include "EESUPPORT.h" |
49 |
|
|
#include "EXCH.h" |
50 |
|
|
|
51 |
cnh |
1.3 |
C !INPUT/OUTPUT PARAMETERS: |
52 |
adcroft |
1.2 |
C == Routine arguments == |
53 |
cnh |
1.3 |
C array :: Array with edges to exchange. |
54 |
|
|
C myOLw :: West, East, North and South overlap region sizes. |
55 |
adcroft |
1.2 |
C myOLe |
56 |
|
|
C myOLn |
57 |
|
|
C myOLs |
58 |
cnh |
1.3 |
C exchWidthX :: Width of data region exchanged in X. |
59 |
|
|
C exchWidthY :: Width of data region exchanged in Y. |
60 |
|
|
C Note -- |
61 |
|
|
C 1. In theory one could have a send width and |
62 |
|
|
C a receive width for each face of each tile. The only |
63 |
|
|
C restriction woul be that the send width of one |
64 |
|
|
C face should equal the receive width of the sent to |
65 |
|
|
C tile face. Dont know if this would be useful. I |
66 |
|
|
C have left it out for now as it requires additional |
67 |
|
|
C bookeeping. |
68 |
|
|
C simulationMode :: Forward or reverse mode exchange ( provides |
69 |
|
|
C support for adjoint integration of code. ) |
70 |
|
|
C cornerMode :: Flag indicating whether corner updates are |
71 |
|
|
C needed. |
72 |
|
|
C myThid :: Thread number of this instance of S/R EXCH... |
73 |
adcroft |
1.2 |
INTEGER myOLw |
74 |
|
|
INTEGER myOLe |
75 |
|
|
INTEGER myOLs |
76 |
|
|
INTEGER myOLn |
77 |
|
|
INTEGER myNz |
78 |
|
|
INTEGER exchWidthX |
79 |
|
|
INTEGER exchWidthY |
80 |
|
|
INTEGER simulationMode |
81 |
|
|
INTEGER cornerMode |
82 |
|
|
INTEGER myThid |
83 |
|
|
_RX array(1-myOLw:sNx+myOLe, |
84 |
|
|
& 1-myOLs:sNy+myOLn, |
85 |
|
|
& myNZ, nSx, nSy) |
86 |
|
|
|
87 |
cnh |
1.3 |
C !LOCAL VARIABLES: |
88 |
adcroft |
1.2 |
C == Local variables == |
89 |
cnh |
1.3 |
C theSimulationMode :: Holds working copy of simulation mode |
90 |
|
|
C theCornerMode :: Holds working copy of corner mode |
91 |
|
|
C I,J,K,bl,bt,bn,bs :: Loop and index counters |
92 |
|
|
C be,bw |
93 |
adcroft |
1.2 |
INTEGER theSimulationMode |
94 |
|
|
INTEGER theCornerMode |
95 |
|
|
INTEGER I,J,K |
96 |
|
|
INTEGER bl,bt,bn,bs,be,bw |
97 |
|
|
C == Statement function == |
98 |
|
|
C tilemod - Permutes indices to return neighboring tile index on |
99 |
|
|
C six face cube. |
100 |
|
|
INTEGER tilemod |
101 |
|
|
tilemod(I)=1+mod(I-1+6,6) |
102 |
cnh |
1.3 |
CEOP |
103 |
adcroft |
1.2 |
|
104 |
|
|
theSimulationMode = simulationMode |
105 |
|
|
theCornerMode = cornerMode |
106 |
|
|
|
107 |
|
|
C For now tile<->tile exchanges are sequentialised through |
108 |
|
|
C thread 1. This is a temporary feature for preliminary testing until |
109 |
|
|
C general tile decomposistion is in place (CNH April 11, 2001) |
110 |
|
|
CALL BAR2( myThid ) |
111 |
|
|
IF ( myThid .EQ. 1 ) THEN |
112 |
|
|
|
113 |
|
|
DO bl = 1, 5, 2 |
114 |
|
|
|
115 |
|
|
bt = bl |
116 |
|
|
bn=tilemod(bt+2) |
117 |
|
|
bs=tilemod(bt-1) |
118 |
|
|
be=tilemod(bt+1) |
119 |
|
|
bw=tilemod(bt-2) |
120 |
|
|
|
121 |
|
|
DO K = 1, myNz |
122 |
|
|
DO J = 1, sNy |
123 |
|
|
DO I = 1, exchWidthX |
124 |
|
|
|
125 |
|
|
C Tile Odd:Odd+2 [get] [North<-West] |
126 |
|
|
array(J,sNy+I,K,bt,1) = array(I,sNy+1-J,K,bn,1) |
127 |
|
|
C Tile Odd:Odd-1 [get] [South<-North] |
128 |
|
|
array(J,1-I,K,bt,1) = array(J,sNy+1-I,K,bs,1) |
129 |
|
|
C Tile Odd:Odd+1 [get] [East<-West] |
130 |
|
|
array(sNx+I,J,K,bt,1) = array(I,J,K,be,1) |
131 |
|
|
C Tile Odd:Odd-2 [get] [West<-North] |
132 |
|
|
array(1-I,J,K,bt,1) = array(sNx+1-J,sNy+1-I,K,bw,1) |
133 |
|
|
|
134 |
|
|
ENDDO |
135 |
|
|
ENDDO |
136 |
|
|
ENDDO |
137 |
|
|
|
138 |
|
|
bt = bl+1 |
139 |
|
|
bn=tilemod(bt+1) |
140 |
|
|
bs=tilemod(bt-2) |
141 |
|
|
be=tilemod(bt+2) |
142 |
|
|
bw=tilemod(bt-1) |
143 |
|
|
|
144 |
|
|
DO K = 1, myNz |
145 |
|
|
DO J = 1, sNy |
146 |
|
|
DO I = 1, exchWidthX |
147 |
|
|
|
148 |
|
|
C Tile Even:Even+1 [get] [North<-South] |
149 |
|
|
array(J,sNy+I,K,bt,1) = array(J,I,K,bn,1) |
150 |
|
|
C Tile Even:Even-2 [get] [South<-East] |
151 |
|
|
array(J,1-I,K,bt,1) = array(sNx+1-I,sNy+1-J,K,bs,1) |
152 |
|
|
C Tile Even:Even+2 [get] [East<-South] |
153 |
|
|
array(sNx+I,J,K,bt,1) = array(sNx+1-J,I,K,be,1) |
154 |
|
|
C Tile Even:Even-1 [get] [West<-East] |
155 |
|
|
array(1-I,J,K,bt,1) = array(sNx+1-I,J,K,bw,1) |
156 |
|
|
|
157 |
|
|
ENDDO |
158 |
|
|
ENDDO |
159 |
|
|
ENDDO |
160 |
|
|
|
161 |
|
|
ENDDO |
162 |
|
|
|
163 |
|
|
ENDIF |
164 |
|
|
CALL BAR2(myThid) |
165 |
|
|
|
166 |
|
|
RETURN |
167 |
|
|
END |