MeshDistributor.cc 70.5 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
/******************************************************************************
 *
 * AMDiS - Adaptive multidimensional simulations
 *
 * Copyright (C) 2013 Dresden University of Technology. All Rights Reserved.
 * Web: https://fusionforge.zih.tu-dresden.de/projects/amdis
 *
 * Authors: 
 * Simon Vey, Thomas Witkowski, Andreas Naumann, Simon Praetorius, et al.
 *
 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
 *
 *
 * This file is part of AMDiS
 *
 * See also license.opensource.txt in the distribution.
 * 
 ******************************************************************************/
20
21


Thomas Witkowski's avatar
Thomas Witkowski committed
22
#include <algorithm>
23
24
#include <iostream>
#include <fstream>
25
26
#include <limits>
#include <stdint.h>
Thomas Witkowski's avatar
Thomas Witkowski committed
27
#include <boost/lexical_cast.hpp>
28
29
#include <boost/filesystem.hpp>

30
#include "parallel/MeshDistributor.h"
31
#include "parallel/MeshManipulation.h"
32
#include "parallel/ParallelDebug.h"
33
#include "parallel/StdMpi.h"
34
#include "parallel/MeshPartitioner.h"
35
#include "parallel/ParMetisPartitioner.h"
36
#include "parallel/ZoltanPartitioner.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
37
#include "parallel/SimplePartitioner.h"
38
#include "parallel/CheckerPartitioner.h"
39
#include "parallel/MpiHelper.h"
40
#include "parallel/DofComm.h"
41
#include "parallel/ParallelProblemStat.h"
42
43
#include "io/ElementFileWriter.h"
#include "io/MacroInfo.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
44
#include "io/MacroWriter.h"
45
#include "io/VtkWriter.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
46
#include "io/ArhReader.h"
47
#include "io/Arh2Reader.h"
48
49
50
51
52
#include "Mesh.h"
#include "Traverse.h"
#include "ElInfo.h"
#include "Element.h"
#include "MacroElement.h"
53
54
#include "DOFMatrix.h"
#include "DOFVector.h"
55
#include "SystemVector.h"
56
#include "ElementDofIterator.h"
57
58
#include "ProblemStatBase.h"
#include "StandardProblemIteration.h"
59
#include "VertexVector.h"
60
#include "MeshStructure.h"
61
#include "ProblemStat.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
62
#include "ProblemInstat.h"
63
#include "RefinementManager3d.h"
64
#include "Debug.h"
65
#include "Timer.h"
66

67
namespace AMDiS { namespace Parallel {
68

Thomas Witkowski's avatar
Thomas Witkowski committed
69
  using boost::lexical_cast;
70
  using namespace boost::filesystem;
71
  using namespace std;
Thomas Witkowski's avatar
Thomas Witkowski committed
72

73
  MeshDistributor* MeshDistributor::globalMeshDistributor = nullptr;
74

75
76
77
  const Flag MeshDistributor::BOUNDARY_SUBOBJ_SORTED              = 0X01L;
  const Flag MeshDistributor::BOUNDARY_FILL_INFO_SEND_DOFS        = 0X02L;
  const Flag MeshDistributor::BOUNDARY_FILL_INFO_RECV_DOFS        = 0X04L;
Thomas Witkowski's avatar
Thomas Witkowski committed
78

79
80
81
82
83
  inline bool cmpDofsByValue(const DegreeOfFreedom* dof1, const DegreeOfFreedom* dof2)
  {
    return (*dof1 < *dof2);
  }

84
  MeshDistributor::MeshDistributor()
85
    : problemStat(0),
86
      initialized(false),
87
      name("parallel"),
88
89
90
91
      mesh(nullptr),
      refineManager(nullptr),
      partitioner(nullptr),
      initialPartitioner(nullptr),
92
      deserialized(false),
93
      writeSerializationFile(false),
94
      repartitioningAllowed(false),
95
      repartitionOnlyOnce(false),
96
      repartitionIthChange(20),
97
      repartitioningWaitAfterFail(20),
98
99
      nMeshChangesAfterLastRepartitioning(0),
      repartitioningCounter(0),
100
      repartitioningFailed(0),
101
      debugOutputDir(""),
Thomas Witkowski's avatar
Thomas Witkowski committed
102
      lastMeshChangeIndex(0),
103
      createBoundaryDofFlag(0),
Thomas Witkowski's avatar
bla    
Thomas Witkowski committed
104
      boundaryDofInfo(1),
105
      meshAdaptivity(true),
Thomas Witkowski's avatar
Thomas Witkowski committed
106
      hasPeriodicBoundary(false),
107
108
      printTimings(false),
      printMemoryUsage(false)
109
  {
110
    FUNCNAME("MeshDistributor::MeshDistributor()");
Thomas Witkowski's avatar
Thomas Witkowski committed
111

112
    MPI::Intracomm &mpiComm = MPI::COMM_WORLD;
113
    mpiRank = mpiComm.Get_rank();
114

115
    Parameters::get(name + "->repartitioning", repartitioningAllowed);
116
    Parameters::get(name + "->debug output dir", debugOutputDir);
117
    Parameters::get(name + "->repartition only once", repartitionOnlyOnce);
118
    Parameters::get(name + "->repartition ith change", repartitionIthChange);
119
    Parameters::get(name + "->repartition wait after fail", repartitioningWaitAfterFail);
Thomas Witkowski's avatar
bla    
Thomas Witkowski committed
120
    Parameters::get(name + "->mesh adaptivity", meshAdaptivity);
121

122
    nMeshChangesAfterLastRepartitioning = repartitionIthChange - 1;
Thomas Witkowski's avatar
Thomas Witkowski committed
123
    
124
125
    // === Create partitioner object. ===

126
    string partStr = "parmetis";
127
    Parameters::get(name + "->partitioner", partStr);
128
129

    if (partStr == "parmetis") 
130
      partitioner = new ParMetisPartitioner("parallel->partitioner", &mpiComm);
131

Thomas Witkowski's avatar
Thomas Witkowski committed
132
133
    if (partStr == "zoltan") {
#ifdef HAVE_ZOLTAN
134
      partitioner = new ZoltanPartitioner("parallel->partitioner", &mpiComm);
Thomas Witkowski's avatar
Thomas Witkowski committed
135
#else
Thomas Witkowski's avatar
Thomas Witkowski committed
136
      ERROR_EXIT("AMDiS was compiled without Zoltan support. Therefore you cannot make use of it!\n");
Thomas Witkowski's avatar
Thomas Witkowski committed
137
138
#endif
    }
139

140
    if (partStr == "checker")
141
      partitioner = new CheckerPartitioner("parallel->partitioner", &mpiComm);
142

Thomas Witkowski's avatar
Thomas Witkowski committed
143
    if (partStr == "simple")
144
145
      partitioner = new SimplePartitioner("parallel->partitioner", &mpiComm);

146
147
148
    if (!partitioner) {
      ERROR_EXIT("Unknown partitioner or no partitioner specified!\n");
    }
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166

    // === Create initial partitioner object. ===

    partStr = "";
    Parameters::get(name + "->initial partitioner", partStr);
    if (partStr == "") {
      initialPartitioner = partitioner;
    } else {    
      if (partStr == "checker") {
	initialPartitioner = 
	  new CheckerPartitioner("parallel->initial partitioner", &mpiComm);
      } else {
	ERROR_EXIT("Not yet supported, but very easy to implement!\n");
      }
    }


    // === And read some more parameters. ===
Thomas Witkowski's avatar
Thomas Witkowski committed
167

168
    int tmp = 0;
169
    Parameters::get(name + "->box partitioning", tmp);
Thomas Witkowski's avatar
Thomas Witkowski committed
170
    partitioner->setBoxPartitioning(static_cast<bool>(tmp));
171
    initialPartitioner->setBoxPartitioning(static_cast<bool>(tmp));
Thomas Witkowski's avatar
Thomas Witkowski committed
172

Thomas Witkowski's avatar
Thomas Witkowski committed
173
    Parameters::get(name + "->print timings", printTimings);
174
    Parameters::get(name + "->print memory usage", printMemoryUsage);
Thomas Witkowski's avatar
Thomas Witkowski committed
175

176
177
    // If required, create hierarchical mesh level structure.
    createMeshLevelStructure();
178
179
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
180

Thomas Witkowski's avatar
Thomas Witkowski committed
181
182
  MeshDistributor::~MeshDistributor()
  {
183
    if (partitioner) {
Thomas Witkowski's avatar
Thomas Witkowski committed
184
      delete partitioner;
185
      partitioner = nullptr;
186
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
187
188
189
  }


190
  void MeshDistributor::initParallelization()
191
  {
192
    FUNCNAME("MeshDistributor::initParallelization()");
193

194
195
196
    if (initialized)
      return;

Thomas Witkowski's avatar
Thomas Witkowski committed
197
198
    double first = MPI::Wtime();
    MSG("Initialization phase 1 needed %.5f seconds\n", 
199
	first - ParallelProblemStat::initTimeStamp);
Thomas Witkowski's avatar
Thomas Witkowski committed
200

201
    TEST_EXIT(MPI::COMM_WORLD.Get_size() > 1)
202
      ("Parallelization does not work with only one process!\n");
203
    TEST_EXIT(feSpaces.size() > 0)
204
      ("No FE space has been defined for the mesh distributor!\n");
205
    TEST_EXIT(mesh)("No mesh has been defined for the mesh distributor!\n");
206

207
208
209
210
211
    // === Sort FE spaces with respect to the degree of the basis ===
    // === functions. Use stuiped bubble sort for this.           ===

    bool doNext = false;
    do {
212
      doNext = false;
213
214
215
216
217
218
      for (unsigned int i = 0; i < feSpaces.size() - 1; i++) {
	if (feSpaces[i]->getBasisFcts()->getDegree() >
	    feSpaces[i + 1]->getBasisFcts()->getDegree()) {
	  const FiniteElemSpace *tmp = feSpaces[i + 1];
	  feSpaces[i + 1] = feSpaces[i];
	  feSpaces[i] = tmp;
219
220
	  doNext = true;
	}
221
      }
222
223
    } while (doNext);

224
    elObjDb.setFeSpace(feSpaces[0]);
225

Thomas Witkowski's avatar
Thomas Witkowski committed
226

227
228
229
    // If the problem has been already read from a file, we need only to set
    // isRankDofs to all matrices and rhs vector and to remove periodic 
    // boundary conditions (if there are some).
230
    if (deserialized) {
231
232
      updateMacroElementInfo();

233
      removePeriodicBoundaryConditions();
234

235
      elObjDb.createMacroElementInfo(allMacroElements);
236

Thomas Witkowski's avatar
Thomas Witkowski committed
237
      updateLocalGlobalNumbering();
238

Thomas Witkowski's avatar
Thomas Witkowski committed
239
240
      elObjDb.setData(partitionMap, levelData);

Thomas Witkowski's avatar
Thomas Witkowski committed
241
#if (DEBUG != 0)
242
      TEST_EXIT_DBG(dofMaps.size())("No DOF mapping defined!\n");
243
      ParallelDebug::writeDebugFile(feSpaces[feSpaces.size() - 1], 
244
				    *(dofMaps[0]), 
Thomas Witkowski's avatar
Blub    
Thomas Witkowski committed
245
				    debugOutputDir + "mpi-dbg", "dat");
Thomas Witkowski's avatar
Thomas Witkowski committed
246
#endif    
247
248

      initialized = true;
249
      return;
250
    }
251

252

Thomas Witkowski's avatar
Thomas Witkowski committed
253
254
    // Create a very first pariitioning of the mesh.
    createInitialPartitioning();
255

256

257
#if (DEBUG != 0)    
258
259
    debug::ElementIdxToDofs elMap;
    debug::createSortedDofs(mesh, elMap);
260
261
#endif

262
    if (mpiRank == 0) {
263
#if (DEBUG != 0)    
264
      int writePartMesh = 1;
265
266
267
#else
      int writePartMesh = 0;
#endif
Thomas Witkowski's avatar
Thomas Witkowski committed
268
      Parameters::get("parallel->debug->write mesh partitioning", writePartMesh);
269

270
      if (writePartMesh > 0) {
271
	debug::writeElementIndexMesh(mesh , debugOutputDir + "elementIndex");
272
	ParallelDebug::writePartitioning(*this, debugOutputDir + "part");
273
      }
274
    }
275

276
    // Create interior boundary information.
277
    createInteriorBoundary(true);
Thomas Witkowski's avatar
Thomas Witkowski committed
278

279
280
    // === Remove neighbourhood relations due to periodic bounday conditions. ===

281
282
283
284
285
    for (deque<MacroElement*>::iterator it = mesh->firstMacroElement();
	 it != mesh->endOfMacroElements(); ++it) {
      for (int i = 0; i < mesh->getGeo(NEIGH); i++) {
	if ((*it)->getNeighbour(i) && 
	    mesh->isPeriodicAssociation((*it)->getBoundary(i))) {
286
287
288

	  int neighIndex = (*it)->getNeighbour(i)->getIndex();

289
290
	  (*it)->getNeighbour(i)->setNeighbour((*it)->getOppVertex(i), nullptr);
	  (*it)->setNeighbour(i, nullptr);
291
292
293
	  (*it)->setBoundary(i, 0);

	  macroElementNeighbours[(*it)->getIndex()][i] = -1;
294
	  macroElementNeighbours[neighIndex][(*it)->getOppVertex(i)] = -1;
295
296
297
298
299
300
301
302
303
	}
      }
    }

    for (vector<MacroElement*>::iterator it = allMacroElements.begin();
	 it != allMacroElements.end(); ++it) {
      for (int i = 0; i < mesh->getGeo(NEIGH); i++) {
	if ((*it)->getNeighbour(i) && 
	    mesh->isPeriodicAssociation((*it)->getBoundary(i))) {
304
305
306

	  int neighIndex = (*it)->getNeighbour(i)->getIndex();

307
308
	  (*it)->getNeighbour(i)->setNeighbour((*it)->getOppVertex(i), nullptr);
	  (*it)->setNeighbour(i, nullptr);
309
310
311
	  (*it)->setBoundary(i, 0);

	  macroElementNeighbours[(*it)->getIndex()][i] = -1;
312
	  macroElementNeighbours[neighIndex][(*it)->getOppVertex(i)] = -1;
313

314
315
316
	}
      }
    }
317

Thomas Witkowski's avatar
n    
Thomas Witkowski committed
318
319
320
    // === Remove all macro elements that are not part of the rank partition. ===

    removeMacroElements();
321

322
323
    // === Create new global and local DOF numbering. ===

Thomas Witkowski's avatar
Thomas Witkowski committed
324

325
    // We have to remove the VertexVectors, which contain periodic assoiciations, 
326
327
    // because they are not valid anymore after some macro elements have been
    // removed and the corresponding DOFs were deleted.
328
    for (map<BoundaryType, VertexVector*>::iterator it = mesh->getPeriodicAssociations().begin();
329
330
	 it != mesh->getPeriodicAssociations().end(); ++it)
      const_cast<DOFAdmin&>(mesh->getDofAdmin(0)).removeDOFContainer(dynamic_cast<DOFContainer*>(it->second));
331

332

333
    updateLocalGlobalNumbering();
334

335

336
337
338
    // === In 3D we have to fix the mesh to allow local refinements. ===

    fix3dMeshRefinement();
339

340

341
342
    // === If in debug mode, make some tests. ===

Thomas Witkowski's avatar
Thomas Witkowski committed
343
#if (DEBUG != 0)
344
    MSG("AMDiS runs in debug mode, so make some test ...\n");
345

346
    ParallelDebug::testAllElements(*this);
347
    debug::testSortedDofs(mesh, elMap);
348
    ParallelDebug::testInteriorBoundary(*this);
Thomas Witkowski's avatar
Thomas Witkowski committed
349
    ParallelDebug::followBoundary(*this);
Thomas Witkowski's avatar
Thomas Witkowski committed
350

351
    debug::writeMesh(feSpaces[0], -1, debugOutputDir + "macro_mesh");   
352
353

    MSG("Debug mode tests finished!\n");
354
#endif
355

356
357
358
    // Remove periodic boundary conditions in sequential problem definition. 
    removePeriodicBoundaryConditions();

359
360
361
#if (DEBUG != 0)
    ParallelDebug::testPeriodicBoundary(*this);
#endif
362

363
    // === Global refinements. ===
364
    
Thomas Witkowski's avatar
Thomas Witkowski committed
365
    int globalRefinement = 0;
366
    Parameters::get(mesh->getName() + "->global refinements", globalRefinement);
367
    
Thomas Witkowski's avatar
Thomas Witkowski committed
368
    if (globalRefinement > 0) {
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
      bool doRefineInter = true;
      Parameters::get(mesh->getName() + "->refinement interpol", doRefineInter);
      std::map<DOFVector<double>*, RefineCoarsenOperation> rememberOp;
      if (!doRefineInter) {
	// no refinement during initial global refinement
	for (int iadmin = 0; iadmin < mesh->getNumberOfDOFAdmin(); iadmin++) {
	  std::list<DOFIndexedBase*>::iterator it;
	  DOFAdmin* admin = const_cast<DOFAdmin*>(&mesh->getDofAdmin(iadmin));
	  std::list<DOFIndexedBase*>::iterator end = admin->endDOFIndexed();
	  for (it = admin->beginDOFIndexed(); it != end; it++) {
	    DOFVector<double>* vec = dynamic_cast<DOFVector<double>*>(*it);
	    if (vec) {
	      rememberOp[vec] = vec->getRefineOperation();
	      vec->setRefineOperation(NO_OPERATION);
	    }
	  }
	}
      }
387
      refineManager->globalRefine(mesh, globalRefinement);
388
389
390
391
392
393
394
395
396
397
398
399
400
      if (!doRefineInter) {
	// no refinement during initial global refinement
	for (int iadmin = 0; iadmin < mesh->getNumberOfDOFAdmin(); iadmin++) {
	  std::list<DOFIndexedBase*>::iterator it;
	  DOFAdmin* admin = const_cast<DOFAdmin*>(&mesh->getDofAdmin(iadmin));
	  std::list<DOFIndexedBase*>::iterator end = admin->endDOFIndexed();
	  for (it = admin->beginDOFIndexed(); it != end; it++) {
	    DOFVector<double>* vec = dynamic_cast<DOFVector<double>*>(*it);
	    if (vec)
	      vec->setRefineOperation(rememberOp[vec]);
	  }
	}
      }
401
      updateLocalGlobalNumbering();
402

403
404
405
#if (DEBUG != 0)
    ParallelDebug::testPeriodicBoundary(*this);
#endif
Thomas Witkowski's avatar
Thomas Witkowski committed
406
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
407

Thomas Witkowski's avatar
bla    
Thomas Witkowski committed
408
    // And delete some data, we there is no mesh adaptivty.
Thomas Witkowski's avatar
Thomas Witkowski committed
409
    if (!meshAdaptivity)
Thomas Witkowski's avatar
bla    
Thomas Witkowski committed
410
411
      elObjDb.clear();

412
    initialized = true;
Thomas Witkowski's avatar
Thomas Witkowski committed
413
    MSG("Init parallelization needed %.5f seconds\n", MPI::Wtime() - first);
414
415
  }

416

Thomas Witkowski's avatar
Thomas Witkowski committed
417
418
419
420
421
422
423
424
425
426
427
428
429
430
  void MeshDistributor::createInitialPartitioning()
  {
    FUNCNAME("MeshDistributor::createInitialPartitioning()");

    // Test, if the mesh is the macro mesh only! Paritioning of the mesh is
    // supported only for macro meshes, so it will not work yet if the mesh is
    // already refined in some way.
    testForMacroMesh();

    // For later mesh repartitioning, we need to store some information about
    // the macro mesh.
    createMacroElementInfo();

    // create an initial partitioning of the mesh
431
432
    bool useInitialPartitioning = 
      initialPartitioner->createInitialPartitioning();
Thomas Witkowski's avatar
Thomas Witkowski committed
433
434
435
436

    // set the element weights, which are 1 at the very first begin
    setInitialElementWeights();

437
    if (!useInitialPartitioning) {   
Thomas Witkowski's avatar
Thomas Witkowski committed
438
      // and now partition the mesh    
439
440
      bool partitioningSucceed = 
	initialPartitioner->partition(elemWeights, INITIAL);
Thomas Witkowski's avatar
Thomas Witkowski committed
441
442
      TEST_EXIT(partitioningSucceed)("Initial partitioning does not work!\n");
    }
443

444
445
446
447
448
    initialPartitioner->createPartitionMap(partitionMap);

    if (initialPartitioner != partitioner) {
      *partitioner = *initialPartitioner;
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
  }


  void MeshDistributor::setInitialElementWeights() 
  {
    FUNCNAME("MeshDistributor::setInitialElementWeights()");

    elemWeights.clear();
      
    string filename = "";
    Parameters::get(mesh->getName() + "->macro weights", filename);
    if (filename != "") {
      MSG("Read macro weights from %s\n", filename.c_str());

      ifstream infile;
      infile.open(filename.c_str(), ifstream::in);
      while (!infile.eof()) {
	int elNum, elWeight;
	infile >> elNum;
	if (infile.eof())
	  break;
	infile >> elWeight;

	elemWeights[elNum] = elWeight;
      }

      infile.close();

      return;
    }

    filename = "";
    Parameters::get("parallel->partitioner->read meta arh", filename);
    if (filename != "") {
      map<int, int> arhElInRank;
      map<int, int> arhElCodeSize;

486
      /*int nProc = */ io::Arh2Reader::readMetaData(filename, arhElInRank, arhElCodeSize);
Thomas Witkowski's avatar
Thomas Witkowski committed
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
      for (map<int, int>::iterator it = arhElCodeSize.begin(); 
	   it != arhElCodeSize.end(); ++it)
	elemWeights[it->first] = it->second;

      return;
    }

    TraverseStack stack;
    ElInfo *elInfo = stack.traverseFirst(mesh, -1, Mesh::CALL_LEAF_EL);
    while (elInfo) {
      elemWeights[elInfo->getElement()->getIndex()] = 1.0;
      elInfo = stack.traverseNext(elInfo);    
    }
  }


503
  void MeshDistributor::addProblemStat(ProblemStatSeq *probStat)
504
  {
505
    FUNCNAME("MeshDistributor::addProblemStat()");
506

507
508
509
    TEST_EXIT_DBG(probStat->getFeSpaces().size())
      ("No FE spaces in stationary problem!\n");

510

511
512
513
514
515
516
517
518
519
520
521
    // === Add all FE spaces from stationary problem. ===

    vector<const FiniteElemSpace*> newFeSpaces = probStat->getFeSpaces();
    for (int i = 0; i < static_cast<int>(newFeSpaces.size()); i++)
      if (find(feSpaces.begin(), feSpaces.end(), newFeSpaces[i]) == 
	  feSpaces.end())
	feSpaces.push_back(newFeSpaces[i]);

    // === Add mesh of stationary problem and create a corresponding  ===
    // === refinement manager object.                                 ===
    
522
    if (mesh != nullptr) {
523
      TEST_EXIT(mesh == probStat->getMesh())
524
	("Does not yet support for different meshes! %s\n", probStat->getMesh()->getName().c_str());
525
526
527
    } else {
      mesh = probStat->getMesh();
    }
528
529
530
531
532
533
534
535
536
537
    
    switch (mesh->getDim()) {
    case 2:
      refineManager = new RefinementManager2d();
      break;
    case 3:
      refineManager = new RefinementManager3d();
      break;
    default:
      ERROR_EXIT("This should not happen for dim = %d!\n", mesh->getDim());
538
    }
539
540
    
    partitioner->setMesh(mesh);
541
    initialPartitioner->setMesh(mesh);
542
    
543

544
545
546
    // === Check whether the stationary problem should be serialized. ===


547
548
    // Create parallel serialization file writer, if needed.
    int writeSerialization = 0;
549
    Parameters::get(probStat->getName() + "->output->write serialization",  
550
		    writeSerialization);
551
    if (writeSerialization && !writeSerializationFile) {
552
      string filename = "";
553
      Parameters::get(name + "->output->serialization filename", filename);
554
555
556
      
      TEST_EXIT(filename != "")
	("No filename defined for parallel serialization file!\n");
557
558

      int tsModulo = -1;
559
      Parameters::get(probStat->getName() + "->output->write every i-th timestep", 
560
		      tsModulo);
561
      
562
      probStat->getFileWriterList().push_back(new Serializer<MeshDistributor>(this, filename, tsModulo));
563
564
      writeSerializationFile = true;
    }    
565

566
567
568

    // === Check whether the stationary problem should be deserialized. ===

569
    int readSerialization = 0;
570
    Parameters::get(probStat->getName() + "->input->read serialization", 
571
		    readSerialization);
572
    if (readSerialization) {
573
      string filename = "";
574
      Parameters::get(probStat->getName() + "->input->serialization filename", 
575
		      filename);
576
      filename += ".p" + lexical_cast<string>(mpiRank);
577
      MSG("Start deserialization with %s\n", filename.c_str());
578
      ifstream in(filename.c_str());
579
580
581
582

      TEST_EXIT(!in.fail())("Could not open deserialization file: %s\n",
			    filename.c_str());

583
584
585
586
587
      // Read the revision number of the AMDiS version which was used to create 
      // the serialization file.
      int revNumber = -1;
      SerUtil::deserialize(in, revNumber);

588
      probStat->deserialize(in);
589
      in.close();
590
591
      MSG("Deserialization from file: %s\n", filename.c_str());

592
      filename = "";
593
      Parameters::get(name + "->input->serialization filename", filename);
594
595
596
597
      
      TEST_EXIT(filename != "")
	("No filename defined for parallel deserialization file!\n");
      
598
      string rankFilename = filename + ".p" + lexical_cast<string>(mpiRank);
599
600
601
602
      in.open(rankFilename.c_str());
      
      TEST_EXIT(!in.fail())("Could not open parallel deserialization file: %s\n",
			    filename.c_str());
603
604
605
606
607

      // Read the revision number of the AMDiS version which was used to create 
      // the serialization file.
      revNumber = -1;
      SerUtil::deserialize(in, revNumber);
608
609
610
611
612
      
      deserialize(in);
      in.close();
      MSG("Deserializtion of mesh distributor from file: %s\n", rankFilename.c_str());
      deserialized = true;
613
614
    }

615
    problemStat.push_back(probStat);
616

617
618
619

    // === If the mesh distributor is already initialized, don't forget to  ===
    // === remove the periodic boundary conditions on these objects.        ===
620

621
    if (initialized)
622
      removePeriodicBoundaryConditions(probStat);
623
624
625
  }


626
627
628
629
  void MeshDistributor::addProblemStatGlobal(ProblemStatSeq *probStat)
  {
    FUNCNAME("MeshDistributor::addProblemStatGlobal()");

630
    if (globalMeshDistributor == nullptr)
631
632
633
634
635
636
      globalMeshDistributor = new MeshDistributor();

    globalMeshDistributor->addProblemStat(probStat);
  }


637
  void MeshDistributor::exitParallelization()
638
  {}
639

640
641
642
643
644
645
646
647
648

  void MeshDistributor::registerDofMap(ParallelDofMapping &dofMap)
  {
    FUNCNAME("MeshDistributor::registerDofMap()");

    TEST_EXIT(find(dofMaps.begin(), dofMaps.end(), &dofMap) ==
	      dofMaps.end())
      ("Parallel DOF mapping already registerd in mesh distributor object!\n");

649
    dofMaps.push_back(&dofMap);   
650
651
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
652
653
654
655
656
657

  void MeshDistributor::removeDofMap(ParallelDofMapping &dofMap)
  {
    vector<ParallelDofMapping*>::iterator it = 
      find(dofMaps.begin(), dofMaps.end(), &dofMap);

658
659
    if (it != dofMaps.end())
      dofMaps.erase(it);
Thomas Witkowski's avatar
Thomas Witkowski committed
660
661
662
  }


663
  void MeshDistributor::testForMacroMesh()
664
  {
665
    FUNCNAME("MeshDistributor::testForMacroMesh()");
666
667
668
669
670
671
672

    int nMacroElements = 0;

    TraverseStack stack;
    ElInfo *elInfo = stack.traverseFirst(mesh, -1, Mesh::CALL_LEAF_EL);
    while (elInfo) {
      TEST_EXIT(elInfo->getLevel() == 0)
673
	("Mesh is already refined! This does not work with parallelization!\n");
674
675
676

      TEST_EXIT(elInfo->getType() == 0)
	("Only macro elements with level 0 are supported!\n");
677
678
679
680
681
682
      
      nMacroElements++;

      elInfo = stack.traverseNext(elInfo);
    }

683
    TEST_EXIT(nMacroElements >= MPI::COMM_WORLD.Get_size())
684
685
686
      ("The mesh has less macro elements than number of mpi processes!\n");
  }

687

688
  void MeshDistributor::synchVector(SystemVector &vec)
Thomas Witkowski's avatar
Thomas Witkowski committed
689
  {
690
    FUNCNAME("MeshDistributor::synchVector()");
691
692
693
694
695
696
697
   
    int nLevels = levelData.getNumberOfLevels();
    for (int level = nLevels - 1; level >= 0; level--) {
      MPI::Intracomm &mpiComm = levelData.getMpiComm(level);
      
      if (mpiComm == MPI::COMM_SELF)
	continue;
698

699
      StdMpi<vector<double> > stdMpi(mpiComm);
700

701
702
703
704
705
706
707
708
709
710
711
712
713
714
      for (DofComm::Iterator it(dofComm[level].getSendDofs()); 
	   !it.end(); it.nextRank()) {
	vector<double> dofs;
	
	for (int i = 0; i < vec.getSize(); i++) {
	  DOFVector<double> &dofVec = *(vec.getDOFVector(i));
	  for (it.beginDofIter(vec.getFeSpace(i)); !it.endDofIter(); it.nextDof())
	    dofs.push_back(dofVec[it.getDofIndex()]);
	}
	
	int rank = it.getRank();
	// if (level > 0)
	//   rank = levelData.mapRank(rank, 0, level);
	stdMpi.send(rank, dofs);
715
      }
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
      
      for (DofComm::Iterator it(dofComm[level].getRecvDofs()); 
	   !it.end(); it.nextRank()) {
	int rank = it.getRank();
	// if (level > 0)
	//   rank = levelData.mapRank(rank, 0, level);
	stdMpi.recv(rank);
      }
      
      stdMpi.startCommunication();
      
      for (DofComm::Iterator it(dofComm[level].getRecvDofs()); 
	   !it.end(); it.nextRank()) {
	int rank = it.getRank();
	// if (level > 0)
	//   rank = levelData.mapRank(rank, 0, level);
	
	int counter = 0;
	vector<double> &recvData =  stdMpi.getRecvData(rank);
	
	for (int i = 0; i < vec.getSize(); i++) {
	  DOFVector<double> &dofVec = *(vec.getDOFVector(i));
	  
	  for (it.beginDofIter(vec.getFeSpace(i)); !it.endDofIter(); it.nextDof()) {
	    TEST_EXIT_DBG(counter < recvData.size())
	      ("Recv data from rank %d has only %d entries!\n", rank, recvData.size());
	    dofVec[it.getDofIndex()] = recvData[counter++];
	  }
744
	}
745
746
747
748
      }
    }
  }

749

750
  void MeshDistributor::fix3dMeshRefinement()
751
  {
752
    FUNCNAME("MeshDistributor::fix3dMeshRefinement()");
753
754
755
756

    if (mesh->getDim() != 3)
      return;

757
    Timer t;
758

759
760
761
    // === Create set of all edges and all macro element indices in rank's ===
    // === subdomain.                                                      ===

762
763
764
765
766
767
    std::set<DofEdge> allEdges;
    std::set<int> rankMacroEls;

    TraverseStack stack;
    ElInfo *elInfo = stack.traverseFirst(mesh, 0, Mesh::CALL_EL_LEVEL);
    while (elInfo) {
768
      for (int i = 0; i < mesh->getGeo(EDGE); i++) {
769
	ElementObjectData elData(elInfo->getElement()->getIndex(), i);
770
771
	DofEdge e = elObjDb.getEdgeLocalMap(elData);
	allEdges.insert(e);
772
773
774
775
776
777
778
      }

      rankMacroEls.insert(elInfo->getElement()->getIndex());

      elInfo = stack.traverseNext(elInfo);
    }

779

780
781
    // === Reset fixed edges, and start new search for edges that must  ===
    // === be fixed.                                                    ===
782

783
    FixRefinementPatch::connectedEdges.clear();
784

785
    // Traverse all edges
786
    for (std::set<DofEdge>::iterator it = allEdges.begin(); it != allEdges.end(); ++it) {
787
      // For each edge get all macro elements that contain this edge.
788
      vector<ElementObjectData>& edgeEls = elObjDb.getElements(*it);
789
790
791
792

      TEST_EXIT_DBG(edgeEls.size() > 0)
	("No edge %d/%d in elObjDB!\n", it->first, it->second);

793
794

      // We have now to check, if the current edge connects two macro elements,
795
      // which are otherwise not connected. 
796

797
798
799
      // All elements on this edge.
      std::set<int> allEls;
      // Maps from each element index to the local edge index of the common edge.
800
      map<int, int> edgeNoInEl;
801
802
803

      for (unsigned int i = 0; i < edgeEls.size(); i++) {
	if (rankMacroEls.count(edgeEls[i].elIndex)) {
804
	  allEls.insert(edgeEls[i].elIndex);
805
806
807
	  edgeNoInEl[edgeEls[i].elIndex] = edgeEls[i].ithObject;
	}
      }
808
           
809
      TEST_EXIT_DBG(!allEls.empty())("Should not happen!\n");
810

811
812
813
814

      // If there is only one element in rank on this edge, there is nothing 
      // to do.
      if (allEls.size() == 1)
815
816
	continue;
      
817
818
819
820
821
      // Create a set of element index sets. All element within one set are 
      // neighbours of each other, but can not reach any other element of the
      // other index sets by neighbourhood relations.
      vector<std::set<int> > disconnectedEls;
      helpToFix(allEls, edgeNoInEl, disconnectedEls);   
822
      
823
824
825
826
827
828
829
830
831
832
833
834
      // Fix the edges
      for (int dc0 = 0; dc0 < static_cast<int>(disconnectedEls.size()); dc0++) {
	for (int dc1 = 0; dc1 < static_cast<int>(disconnectedEls.size()); dc1++) {
	  if (dc0 == dc1)
	    continue;   
	  
	  int elIdx = *(disconnectedEls[dc1].begin());
	  pair<Element*, int> edge0 = 
	    make_pair(elObjDb.getElementPtr(elIdx), edgeNoInEl[elIdx]);
	  
	  for (std::set<int>::iterator elIt = disconnectedEls[dc0].begin();
	       elIt != disconnectedEls[dc0].end(); ++elIt) {
835
	    pair<Element*, int> edge1 = 
836
	      make_pair(elObjDb.getElementPtr(*elIt), edgeNoInEl[*elIt]);
837

838
#if (DEBUG != 0)
839
840
	    DofEdge dofEdge0 = edge0.first->getEdge(edge0.second);
	    DofEdge dofEdge1 = edge1.first->getEdge(edge1.second);
841
	    
842
	    WorldVector<double> c0, c1;
843
844
	    mesh->getDofIndexCoords(dofEdge0.first, feSpaces[0], c0);
	    mesh->getDofIndexCoords(dofEdge0.second, feSpaces[0], c1);
845
846
847
848
849
850
851
852
853
854
855
856
	    
	    // 	      MSG("FOUND EDGE %d/%d <-> %d/%d\n", 
	    // 		  edge0.first->getIndex(), edge0.second,
	    // 		  edge1.first->getIndex(), edge1.second);
	    
	    // 	      MSG("FOUND EDGE: %d %d with coords %f %f %f   %f %f %f\n",
	    // 		  dofEdge0.first, dofEdge0.second, 
	    // 		  c0[0], c0[1], c0[2],
	    // 		  c1[0], c1[1], c1[2]);
	    
	    TEST_EXIT_DBG(dofEdge0 == dofEdge1)("Should noth happen!\n");
#endif
857

858
859
860
861
862
	    FixRefinementPatch::connectedEdges.push_back(make_pair(edge1, edge0));
	  }
	}	  
      }
    }
863

864

865
    MSG("Fix 3D mesh refinement needed %.5f seconds\n", t.elapsed());
866
  }
867

868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887

  void MeshDistributor::helpToFix(std::set<int> &elems, 
				  map<int, int> &edgeNoInEl,
				  vector<std::set<int> > &disconnectedEls)
  {
    std::set<int> firstElem;
    firstElem.insert(*(elems.begin()));

    std::set<int> otherElems(++(elems.begin()), elems.end());
    
    bool found = false;      
    do {
      found = false;
      for (std::set<int>::iterator elIt = firstElem.begin(); elIt != firstElem.end(); ++elIt) {
	for (int i = 0; i < mesh->getGeo(NEIGH); i++) {
	  int neighEl = macroElementNeighbours[*elIt][i];
	  if (neighEl != -1 && otherElems.count(neighEl)) {
	    firstElem.insert(neighEl);
	    otherElems.erase(neighEl);
	    found = true;
888
889
	  }
	}
890
891
892
	
	if (found)
	  break;
893
      }
894
    } while (found);
895

896
897
898
    disconnectedEls.push_back(firstElem);
    if (otherElems.size())
      helpToFix(otherElems, edgeNoInEl, disconnectedEls);
899
900
901
  }


902
  void MeshDistributor::getAllBoundaryDofs(const FiniteElemSpace *feSpace,
903
					   int level,
904
					   DofContainer& dofs)
905
906
  {
    DofContainerSet dofSet;
907
    for (DofComm::Iterator it(dofComm[level].getSendDofs(), feSpace); 
908
	 !it.end(); it.nextRank())
909
      dofSet.insert(it.getDofs().begin(), it.getDofs().end());
910
    for (DofComm::Iterator it(dofComm[level].getRecvDofs(), feSpace); 
911
	 !it.end(); it.nextRank())
Thomas Witkowski's avatar