| 1 |
adcroft |
1.14 |
C $Header: /u/gcmpack/models/MITgcmUV/model/src/do_the_model_io.F,v 1.13 1999/05/18 18:01:12 adcroft Exp $ |
| 2 |
cnh |
1.1 |
|
| 3 |
cnh |
1.11 |
#include "CPP_OPTIONS.h" |
| 4 |
cnh |
1.1 |
|
| 5 |
cnh |
1.3 |
SUBROUTINE DO_THE_MODEL_IO(myCurrentTime, myIter, myThid) |
| 6 |
cnh |
1.1 |
C /==========================================================\ |
| 7 |
|
|
C | SUBROUTINE DO_THE_MODEL_IO | |
| 8 |
|
|
C | o Controlling routine for IO in model main time-stepping | |
| 9 |
|
|
C | loop. | |
| 10 |
|
|
C |==========================================================| |
| 11 |
|
|
C | Many systems do not have thread safe IO so it is easier | |
| 12 |
|
|
C | to lump everything together and do dumping of fields | |
| 13 |
|
|
C | and updating of forcing terms in a single place. | |
| 14 |
|
|
C | The approach to IO used here is that writes are only | |
| 15 |
|
|
C | performed by thread 1 and that a process only writes out | |
| 16 |
cnh |
1.10 |
C | its data ( it does not know about anyone elses data!) | |
| 17 |
cnh |
1.1 |
C | Reading on the other hand is assumed to be from a file | |
| 18 |
|
|
C | containing all the data for all the processes. Only the | |
| 19 |
|
|
C | portion of data of interest to this process is actually | |
| 20 |
|
|
C | loaded. To work well this assumes the existence of some | |
| 21 |
|
|
C | reliable tool to join datasets together at the end of a | |
| 22 |
cnh |
1.10 |
C | run - see joinds.p | |
| 23 |
cnh |
1.1 |
C \==========================================================/ |
| 24 |
adcroft |
1.12 |
IMPLICIT NONE |
| 25 |
cnh |
1.1 |
|
| 26 |
|
|
C == Global variables === |
| 27 |
|
|
#include "SIZE.h" |
| 28 |
|
|
#include "EEPARAMS.h" |
| 29 |
|
|
#include "PARAMS.h" |
| 30 |
|
|
#include "DYNVARS.h" |
| 31 |
|
|
#include "CG2D.h" |
| 32 |
adcroft |
1.13 |
#ifdef ALLOW_KPP |
| 33 |
|
|
#include "KPPMIX.h" |
| 34 |
|
|
#endif |
| 35 |
cnh |
1.1 |
|
| 36 |
cnh |
1.3 |
LOGICAL DIFFERENT_MULTIPLE |
| 37 |
|
|
EXTERNAL DIFFERENT_MULTIPLE |
| 38 |
|
|
|
| 39 |
cnh |
1.1 |
C == Routine arguments == |
| 40 |
|
|
C myThid - Thread number for this instance of the routine. |
| 41 |
|
|
C myIter - Iteration number |
| 42 |
cnh |
1.3 |
C myCurrentTime - Current time of simulation ( s ) |
| 43 |
cnh |
1.1 |
INTEGER myThid |
| 44 |
|
|
INTEGER myIter |
| 45 |
adcroft |
1.13 |
_RL myCurrentTime |
| 46 |
cnh |
1.1 |
|
| 47 |
|
|
C == Local variables == |
| 48 |
|
|
|
| 49 |
cnh |
1.10 |
C-- Generaly only thread 1 does IO here. It can not start until |
| 50 |
|
|
C-- all threads fields are ready. |
| 51 |
cnh |
1.6 |
IF ( |
| 52 |
cnh |
1.10 |
& DIFFERENT_MULTIPLE(dumpFreq,myCurrentTime, |
| 53 |
|
|
& myCurrentTime-deltaTClock) |
| 54 |
cnh |
1.6 |
& ) THEN |
| 55 |
|
|
|
| 56 |
cnh |
1.3 |
_BARRIER |
| 57 |
cnh |
1.1 |
|
| 58 |
cnh |
1.3 |
C-- Write "text-plots" of certain fields |
| 59 |
cnh |
1.10 |
CALL PLOT_FIELD_XYZRL( uVel , 'Current uVel ' , |
| 60 |
|
|
& Nr, myIter, myThid ) |
| 61 |
|
|
CALL PLOT_FIELD_XYZRL( vVel , 'Current vVel ' , |
| 62 |
|
|
& Nr, myIter, myThid ) |
| 63 |
|
|
CALL PLOT_FIELD_XYZRL( theta, 'Current theta ' , |
| 64 |
|
|
& Nr, myIter, myThid ) |
| 65 |
|
|
CALL PLOT_FIELD_XYRL( cg2d_x, 'Current cg2d_x ' , |
| 66 |
|
|
& myIter, myThid ) |
| 67 |
adcroft |
1.13 |
|
| 68 |
|
|
#ifdef ALLOW_KPP |
| 69 |
|
|
IF (KPPmixingMaps) THEN |
| 70 |
|
|
CALL PLOT_FIELD_XYRL ( KPPhbl , 'KPPhbl' , |
| 71 |
|
|
& myIter, myThid ) |
| 72 |
|
|
CALL PLOT_FIELD_XYZRL ( KPPviscAz , 'KPPviscAz' , |
| 73 |
|
|
& Nr, myIter, myThid ) |
| 74 |
|
|
CALL PLOT_FIELD_XYZRL ( KPPdiffKzT, 'KPPdiffKzT', |
| 75 |
|
|
& Nr, myIter, myThid ) |
| 76 |
|
|
CALL PLOT_FIELD_XYZRL ( KPPghat , 'KPPghat' , |
| 77 |
|
|
& Nr, myIter, myThid ) |
| 78 |
|
|
ENDIF |
| 79 |
|
|
#endif |
| 80 |
cnh |
1.3 |
|
| 81 |
|
|
ENDIF |
| 82 |
|
|
|
| 83 |
|
|
C-- Write model state to binary file |
| 84 |
adcroft |
1.7 |
CALL WRITE_STATE( .FALSE., myCurrentTime, myIter, myThid ) |
| 85 |
cnh |
1.5 |
|
| 86 |
cnh |
1.1 |
C |
| 87 |
|
|
RETURN |
| 88 |
|
|
END |
| 89 |
|
|
|
Parent Directory
| 
Revision Log
| 
Revision Graph