AdaptInstationary.cc 9.83 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
#include "AdaptInstationary.h"
#include "Parameters.h"
#include "Estimator.h"
#include "TecPlotWriter.h"
#include "ProblemIterationInterface.h"
#include "ProblemTimeInterface.h"
#include "Serializer.h"

namespace AMDiS {

11
  AdaptInstationary::AdaptInstationary(const char *name,
12
				       ProblemIterationInterface *problemStat,  
13
14
15
16
				       AdaptInfo *info,
				       ProblemTimeInterface *problemInstat,
				       AdaptInfo *initialInfo,
				       time_t initialTimestamp)
17
    : AdaptBase(name, problemStat, info, problemInstat, initialInfo),
18
19
      breakWhenStable(0),
      dbgMode(false)
20
21
22
23
24
25
26
27
28
29
30
31
32
33
  {
    FUNCNAME("AdaptInstationary::AdaptInstationary()");

    initialize(name_);

    fixedTimestep_ = (info->getMinTimestep() == info->getMaxTimestep());

    if (initialTimestamp == 0) {
      initialTimestamp_ = time(NULL);
    } else {
      initialTimestamp_ = initialTimestamp;
    }

    // Check if the problem should be deserialized because of the -rs parameter.
Thomas Witkowski's avatar
Thomas Witkowski committed
34
    std::string serializationFilename = "";
35
36
37
38
39
40
41
    GET_PARAMETER(0, "argv->rs", &serializationFilename);

    if (serializationFilename.compare("")) {
      // The value of the -rs argument is ignored, because we want to use the 
      // serialization file mentioned in the used init file.
      MSG("Deserialization from file: %s\n", queueSerializationFilename_.c_str());

Thomas Witkowski's avatar
Thomas Witkowski committed
42
      std::ifstream in(queueSerializationFilename_.c_str());
43
44
45
      deserialize(in);
      in.close();

46
47
      info->setIsDeserialized(true);
      initialInfo->setIsDeserialized(true);
48
49
50
51
52
53
54
55
56
57
    } else {
      int readSerialization = 0;
      int readSerializationWithAdaptInfo = 0;

      GET_PARAMETER(0, (*problemStat).getName() + "->input->read serialization", "%d", 
		    &readSerialization);
      GET_PARAMETER(0, (*problemStat).getName() + "->input->serialization with adaptinfo", "%d",
		    &readSerializationWithAdaptInfo);

      if (readSerialization && readSerializationWithAdaptInfo) {
Thomas Witkowski's avatar
Thomas Witkowski committed
58
	std::string serializationFilename = "";
59
60
61
62
63
64

	GET_PARAMETER(0, (*problemStat).getName() + "->input->serialization filename", 
		      &serializationFilename);
	TEST_EXIT(serializationFilename != "")("no serialization file\n");

	MSG("Deserialization with AdaptInfo from file: %s\n", serializationFilename.c_str());
Thomas Witkowski's avatar
Thomas Witkowski committed
65
	std::ifstream in(serializationFilename.c_str());
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
	deserialize(in);
	in.close();
      }
    }
  }

  AdaptInstationary::~AdaptInstationary()
  {
  }

  void AdaptInstationary::explicitTimeStrategy()
  {
    FUNCNAME("AdaptInstationary::explicitTimeStrategy()");

    // estimate before first adaption
81
82
    if (adaptInfo_->getTime() <= adaptInfo_->getStartTime()) {
      problemIteration_->oneIteration(adaptInfo_, ESTIMATE);
83
84
85
    }

    // increment time
86
    adaptInfo_->setTime(adaptInfo_->getTime() + adaptInfo_->getTimestep());
87

88
    problemTime_->setTime(adaptInfo_);
89
90

    INFO(info_,6)("time = %e, timestep = %e\n",
91
		  adaptInfo_->getTime(), adaptInfo_->getTimestep());
92

93
    adaptInfo_->setSpaceIteration(0);
94
95
  
    // do the iteration
96
97
98
    problemIteration_->beginIteration(adaptInfo_);
    problemIteration_->oneIteration(adaptInfo_, FULL_ITERATION);
    problemIteration_->endIteration(adaptInfo_);
99
100
101
102
103
104
105
  }

  void AdaptInstationary::implicitTimeStrategy()
  {
    FUNCNAME("AdaptInstationary::implicitTimeStrategy()");

    do {
106
107
      adaptInfo_->setTime(adaptInfo_->getTime() + adaptInfo_->getTimestep());
      problemTime_->setTime(adaptInfo_);
108
109

      INFO(info_,6)("time = %e, try timestep = %e\n",
110
		    adaptInfo_->getTime(), adaptInfo_->getTimestep());
111
    
112
      problemIteration_->oneIteration(adaptInfo_, NO_ADAPTION);
113

114
      adaptInfo_->incTimestepIteration();
115

116
      if (!fixedTimestep_ && 
117
118
119
120
121
122
123
	  !adaptInfo_->timeToleranceReached() &&
	  !adaptInfo_->getTimestep() <= adaptInfo_->getMinTimestep()) {

	adaptInfo_->setTime(adaptInfo_->getTime() - adaptInfo_->getTimestep());
	adaptInfo_->setTimestep(adaptInfo_->getTimestep() * time_delta_1);
	continue;
      }
124

125
      adaptInfo_->setSpaceIteration(0);
126
127
128
129
130


      /* === Do only space iterations only if the maximum is higher than 0. === */

      if (adaptInfo_->getMaxSpaceIteration() > 0) {
131
    
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
	/* === Space iterations === */
	do {
	  problemIteration_->beginIteration(adaptInfo_);
	  
	  if (problemIteration_->oneIteration(adaptInfo_, FULL_ITERATION)) {
	    if (!fixedTimestep_ && 
		!adaptInfo_->timeToleranceReached() &&
		!adaptInfo_->getTimestep() <= adaptInfo_->getMinTimestep()) 
	      {
		adaptInfo_->setTime(adaptInfo_->getTime() - adaptInfo_->getTimestep());
		adaptInfo_->setTimestep(adaptInfo_->getTimestep() * time_delta_1);
		problemIteration_->endIteration(adaptInfo_);
		adaptInfo_->incSpaceIteration();
		break;
	      }	
	  }

	  adaptInfo_->incSpaceIteration();
	  problemIteration_->endIteration(adaptInfo_);
	  
	} while(!adaptInfo_->spaceToleranceReached() && 
		adaptInfo_->getSpaceIteration() <= adaptInfo_->getMaxSpaceIteration());

      } else {
156
	problemIteration_->endIteration(adaptInfo_);
157
158
      }

159

160
161
162
    } while(!adaptInfo_->timeToleranceReached() &&
	    !adaptInfo_->getTimestep() <= adaptInfo_->getMinTimestep() && 
	    adaptInfo_->getTimestepIteration() <= adaptInfo_->getMaxTimestepIteration());  
163

164
165
    if (!fixedTimestep_ && adaptInfo_->timeErrorLow()) {
      adaptInfo_->setTimestep(adaptInfo_->getTimestep() *time_delta_2);
166
167
168
169
170
171
172
173
174
175
176
177
178
179
      if (dbgMode) {
	// print information about timestep increase
      }
    } else {
      if (dbgMode) {
	std::cout << "=== ADAPT INFO DEBUG MODE ===\n";
	std::cout << " Do not increase timestep: \n";
	if (fixedTimestep_) {
	  std::cout << "   fixedTimestep = true\n";	
	}
	if (!adaptInfo_->timeErrorLow()) {
	  adaptInfo_->printTimeErrorLowInfo();
	}
      }
180
181
182
183
184
    }
  }

  void AdaptInstationary::oneTimestep()
  {
185
    FUNCNAME("AdaptInstationary::oneTimestep()");
186

187
    adaptInfo_->setTimestepIteration(0);
188

189
190
191
192
193
194
195
196
197
198
199
    switch (strategy) {
    case 0:
      explicitTimeStrategy();
      break;
    case 1:
      implicitTimeStrategy();
      break;
    default:
      MSG("unknown strategy = %d; use explicit strategy\n", strategy);
      explicitTimeStrategy();
    }
200

201
    adaptInfo_->incTimestepNumber();
202
203
204
205
206
207
208
209
  }

  int AdaptInstationary::adapt()
  {
    FUNCNAME("AdaptInstationary::adapt()");

    int errorCode = 0;

210
    TEST_EXIT(adaptInfo_->getTimestep() >= adaptInfo_->getMinTimestep())
211
      ("timestep < min timestep\n");
212
    TEST_EXIT(adaptInfo_->getTimestep() <= adaptInfo_->getMaxTimestep())
213
214
      ("timestep > max timestep\n");

215
    TEST_EXIT(adaptInfo_->getTimestep() > 0)("timestep <= 0!\n");
216

217
218
219
220
    if (adaptInfo_->getTimestepNumber() == 0) {
      adaptInfo_->setTime(adaptInfo_->getStartTime());
      initialAdaptInfo_->setStartTime(adaptInfo_->getStartTime());
      initialAdaptInfo_->setTime(adaptInfo_->getStartTime());
221

222
      problemTime_->setTime(adaptInfo_);
223
224
225

      // initial adaption
      problemTime_->solveInitialProblem(initialAdaptInfo_);
226
      problemTime_->transferInitialSolution(adaptInfo_);
227
228
    }

229
    while (adaptInfo_->getTime() < adaptInfo_->getEndTime() - DBL_TOL) {
230
231
      iterationTimestamp_ = time(NULL);

232
      problemTime_->initTimestep(adaptInfo_);
Thomas Witkowski's avatar
Thomas Witkowski committed
233

234
      oneTimestep();
Thomas Witkowski's avatar
Thomas Witkowski committed
235

236
      problemTime_->closeTimestep(adaptInfo_);
237

238
      if (breakWhenStable && (adaptInfo_->getSolverIterations() == 0)) {
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
	break;
      }

      // Check if there is a runtime limitation. If there is a runtime limitation
      // and there is no more time for a next adaption loop, than return the error
      // code for rescheduling the problem and break the adaption loop.
      if (checkQueueRuntime()) {
	errorCode = RescheduleErrorCode;
	break;
      }
    }

    return errorCode;
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
254
  void AdaptInstationary::initialize(const std::string& aName)
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
  {
    FUNCNAME("AdaptInstationary::initialize()");

    strategy = 0;
    time_delta_1 = 0.7071;
    time_delta_2 = 1.4142;
    queueRuntime_ = -1;
    queueSerializationFilename_ = "__serialized_problem.ser";

    GET_PARAMETER(0, aName + "->strategy", "%d", &strategy);
    GET_PARAMETER(0, aName + "->time delta 1", "%f", &time_delta_1);
    GET_PARAMETER(0, aName + "->time delta 2", "%f", &time_delta_2);
    GET_PARAMETER(0, aName + "->info", "%d", &info_);
    GET_PARAMETER(0, aName + "->break when stable", "%d", &breakWhenStable);
    GET_PARAMETER(0, aName + "->queue->runtime", "%d", &queueRuntime_);
    GET_PARAMETER(0, aName + "->queue->serialization filename", &queueSerializationFilename_);

    return;
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
275
  void AdaptInstationary::serialize(std::ostream &out)
276
277
278
279
  {
    FUNCNAME("AdaptInstationary::serialize()");

    problemIteration_->serialize(out);
280
    adaptInfo_->serialize(out);
281
282
283
284
285
    if (problemTime_) {
      problemTime_->serialize(out);
    }
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
286
  void AdaptInstationary::deserialize(std::istream &in)
287
288
289
290
  {
    FUNCNAME("AdaptInstationary::deserialize()");

    problemIteration_->deserialize(in);
291
    adaptInfo_->deserialize(in);
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
    if (problemTime_) {
      problemTime_->deserialize(in);
    }
  }


  bool AdaptInstationary::checkQueueRuntime()
  {
    // If there is no time limited runtime queue, there is also nothing to check.
    if (queueRuntime_ == -1) {
      return false;
    }

    // Get the current time.
    time_t currentTimestamp = time(NULL);

    // Update list with the last iteration runtimes.
309
    lastIterationsDuration_.push(currentTimestamp - iterationTimestamp_);
310
    // The list should not contain more than 5 elements. If so, delete the oldest one.
311
312
    if (lastIterationsDuration_.size() > 5) {
      lastIterationsDuration_.pop();
313
314
315
    }

    // Calculate the avarage of the last iterations.
Thomas Witkowski's avatar
Thomas Witkowski committed
316
    std::queue<int> tmpQueue = lastIterationsDuration_;
317
318
319
320
321
    int avrgLastIterations = 0;
    while (!tmpQueue.empty()) {
      avrgLastIterations += tmpQueue.front();
      tmpQueue.pop();
    } 
322
    avrgLastIterations /= lastIterationsDuration_.size();
323
324
325
    
    // Check if there is enough time for a further iteration.
    if (initialTimestamp_ + queueRuntime_ - currentTimestamp < avrgLastIterations * 2) {
Thomas Witkowski's avatar
Thomas Witkowski committed
326
      std::ofstream out(queueSerializationFilename_.c_str());
327
328
329
330
331
332
333
334
335
336
      serialize(out);
      out.close();

      return true;
    }

    return false;
  }

}