MeshDistributor.h 18 KB
Newer Older
1
2
3
4
// ============================================================================
// ==                                                                        ==
// == AMDiS - Adaptive multidimensional simulations                          ==
// ==                                                                        ==
5
// ==  http://www.amdis-fem.org                                              ==
6
7
// ==                                                                        ==
// ============================================================================
8
9
10
11
12
13
14
15
16
17
18
19
//
// Software License for AMDiS
//
// Copyright (c) 2010 Dresden University of Technology 
// All rights reserved.
// Authors: Simon Vey, Thomas Witkowski et al.
//
// This file is part of AMDiS
//
// See also license.opensource.txt in the distribution.


20

21
/** \file MeshDistributor.h */
22

23
24
#ifndef AMDIS_MESHDISTRIBUTOR_H
#define AMDIS_MESHDISTRIBUTOR_H
25
26


Thomas Witkowski's avatar
Thomas Witkowski committed
27
#include <mpi.h>
28
#include "parallel/DofComm.h"
29
#include "parallel/ElementObjectDatabase.h"
30
#include "parallel/ParallelTypes.h"
31
#include "parallel/MeshLevelData.h"
32
#include "parallel/MeshPartitioner.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
33
#include "parallel/InteriorBoundary.h"
34
#include "parallel/ParallelDofMapping.h"
35
#include "parallel/PeriodicMap.h"
36
#include "parallel/StdMpi.h"
37
#include "AMDiS_fwd.h"
38
#include "Containers.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
39
#include "Global.h"
40
41
#include "ProblemTimeInterface.h"
#include "ProblemIterationInterface.h"
42
#include "FiniteElemSpace.h"
43
#include "Serializer.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
44
#include "BoundaryManager.h"
45
#include "SystemVector.h"
46

47
namespace AMDiS {
48
49

  using namespace std;
Thomas Witkowski's avatar
Thomas Witkowski committed
50
51
52
53


  struct BoundaryDofInfo
  {
54
    map<GeoIndex, DofContainerSet> geoDofs;
Thomas Witkowski's avatar
Thomas Witkowski committed
55
56
  };

57

58
  class MeshDistributor
59
  {
60
  private:
61
    MeshDistributor();
62
	          
63
    virtual ~MeshDistributor() {}
64

65
  public:
66
    void initParallelization();
67

68
    void exitParallelization();
69

70
71
72
    /// Adds a DOFVector to the set of \ref interchangeVecs. Thus, this vector 
    /// will be automatically interchanged between ranks when mesh is 
    /// repartitioned.
73
74
75
76
77
    void addInterchangeVector(DOFVector<double> *vec)
    {
      interchangeVectors.push_back(vec);
    }

78
79
80
81
82
83
84
    /// Adds all DOFVectors of a SystemVector to \ref interchangeVecs.
    void addInterchangeVector(SystemVector *vec)
    {
      for (int i = 0; i < vec->getSize(); i++)
	interchangeVectors.push_back(vec->getDOFVector(i));
    }
    
85
    /** \brief
86
87
88
89
90
     * This function checks if the mesh has changed on at least on rank. In 
     * this case, the interior boundaries are adapted on all ranks such that 
     * they fit together on all ranks. Furthermore the function 
     * \ref updateLocalGlobalNumbering() is called to update the DOF numberings 
     * and mappings on all rank due to the new mesh structure.
91
     *
92
93
94
95
96
     * \param[in]  tryRepartition   If this parameter is true, repartitioning 
     *                              may be done. This depends on several other 
     *                              parameters. If the parameter is false, the 
     *                              mesh is only checked and adapted but never 
     *                              repartitioned.
97
     */
98
    void checkMeshChange(bool tryRepartition = true);
99

100
101
102
103
104
105
106
107
108
109
    /** \brief
     * Checks if is required to repartition the mesh. If this is the case, a new
     * partition will be created and the mesh will be redistributed between the
     * ranks.
     */
    void repartitionMesh();
    
    /// Calculates the imbalancing factor and prints it to screen.
    void printImbalanceFactor();

110
    /** \brief
111
112
113
114
     * Test, if the mesh consists of macro elements only. The mesh partitioning 
     * of the parallelization works for macro meshes only and would fail, if the 
     * mesh is already refined in some way. Therefore, this function will exit
     * the program if it finds a non macro element in the mesh.
115
116
     */
    void testForMacroMesh();
117

118
119
    /// Set for each element on the partitioning level the number of 
    /// leaf elements.
120
    void setInitialElementWeights();
121

122
    inline virtual string getName() 
123
124
125
    { 
      return name; 
    }
126

Thomas Witkowski's avatar
Thomas Witkowski committed
127
128
129
130
131
    inline Mesh* getMesh()
    {
      return mesh;
    }

132
133
    /// Returns an FE space from \ref feSpaces.
    inline const FiniteElemSpace* getFeSpace(unsigned int i = 0)
134
    {
135
136
137
138
139
      FUNCNAME("MeshDistributor::getFeSpace()");

      TEST_EXIT_DBG(i < feSpaces.size())("Should not happen!\n");

      return feSpaces[i];
140
    }
141
142
143
144
145
146
147

    /// Returns all FE spaces, thus \ref feSpaces.
    inline vector<const FiniteElemSpace*>& getFeSpaces()
    {
      return feSpaces;
    }

148
149
    /// Returns the DOF mapping object, \ref dofMap.
    inline ParallelDofMapping& getDofMap()
Thomas Witkowski's avatar
Thomas Witkowski committed
150
    {
151
      return dofMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
152
153
    }

154
155
156
157
158
    inline ParallelDofMapping& getDofMapSd()
    {
      return dofMapSd;
    }

159
160
    /// Returns the periodic mapping handler, \ref periodicMap.
    inline PeriodicMap& getPeriodicMap()
161
    {
162
      return periodicMap;
163
    }
164

165
    DofComm& getDofComm()
166
    {
167
      return dofComm;
168
169
    }

170
171
172
173
174
    DofComm& getDofCommSd()
    {
      return dofCommSd;
    }

175
176
177
178
179
    InteriorBoundary& getIntBoundary()
    {
      return intBoundary;
    }

180
181
182
183
184
    InteriorBoundary& getIntBoundarySd()
    {
      return intBoundarySd;
    }

185
    inline long getLastMeshChangeIndex()
186
    {
187
      return lastMeshChangeIndex;
188
    }
189

190
    inline int getMpiRank()
191
    {
192
      return mpiRank;
193
    }
194

Thomas Witkowski's avatar
Thomas Witkowski committed
195
196
197
198
199
    inline int getMpiSize()
    {
      return mpiSize;
    }

200
201
202
    inline MPI::Intracomm& getMpiComm()
    {
      return mpiComm;
203
204
    }

205
206
207
208
209
    inline bool isInitialized()
    {
      return initialized;
    }

210
    // Writes all data of this object to an output stream.
211
    void serialize(ostream &out);
212

213
    // Reads the object data from an input stream.
214
    void deserialize(istream &in);
215
216

    /** \brief
217
218
219
220
     * This function must be used if the values of a DOFVector must be 
     * synchronised over all ranks. That means, that each rank sends the 
     * values of the DOFs, which are owned by the rank and lie on an interior 
     * bounday, to all other ranks also having these DOFs.
221
     *
222
223
224
     * This function must be used, for example, after the lineary system is 
     * solved, or after the DOFVector is set by some user defined functions, 
     * e.g., initial solution functions.
225
     */    
226
227
228
229
230
    template<typename T>
    void synchVector(DOFVector<T> &vec) 
    {
      StdMpi<vector<T> > stdMpi(mpiComm);

231
232
      const FiniteElemSpace *fe = vec.getFeSpace();

233
234
      for (DofComm::Iterator it(dofComm.getSendDofs(), fe); 
	   !it.end(); it.nextRank()) {
235
	vector<T> dofs;
236
	dofs.reserve(it.getDofs().size());
237
	
238
239
	for (; !it.endDofIter(); it.nextDof())
	  dofs.push_back(vec[it.getDofIndex()]);
240
	
241
	stdMpi.send(it.getRank(), dofs);
242
      }
243
	     
244
245
      for (DofComm::Iterator it(dofComm.getRecvDofs()); 
	   !it.end(); it.nextRank())
246
247
        stdMpi.recv(it.getRank());
	     
248
      stdMpi.startCommunication();
249

250
251
      for (DofComm::Iterator it(dofComm.getRecvDofs(), fe); 
	   !it.end(); it.nextRank())
252
253
254
	for (; !it.endDofIter(); it.nextDof())
	  vec[it.getDofIndex()] = 
	     stdMpi.getRecvData(it.getRank())[it.getDofCounter()];
255
256
    }
    
Thomas Witkowski's avatar
Blub  
Thomas Witkowski committed
257
258
259
260
    /// Works in the same way as the function above defined for DOFVectors. Due
    /// to performance, this function does not call \ref synchVector for each 
    /// DOFVector, but instead sends all values of all DOFVectors all at once.
    void synchVector(SystemVector &vec, int level = 0);
261

262
263
    void check3dValidMesh();

Thomas Witkowski's avatar
Thomas Witkowski committed
264
265
266
267
268
    void setBoundaryDofRequirement(Flag flag)
    {
      createBoundaryDofFlag = flag;
    }

269
270
    BoundaryDofInfo& getBoundaryDofInfo(const FiniteElemSpace *feSpace,
					int level)
271
    {
272
273
274
275
276
277
278
      FUNCNAME("MeshDistributor::getBoundaryDofInfo()");

      TEST_EXIT_DBG(level < static_cast<int>(boundaryDofInfo.size()))
	("Wrong level number: %d, whereas array size is %d!\n", 
	 level, boundaryDofInfo.size());

      return boundaryDofInfo[level][feSpace];
279
280
    }

281
282
    void getAllBoundaryDofs(const FiniteElemSpace *feSpace, 
			    int level,
283
			    DofContainer& dofs);
284

285
286
287
288
    const ElementObjectDatabase& getElementObjectDb() 
    {
      return elObjDb;
    }
289
290
291

    /// Adds a stationary problem to the global mesh distributor objects.
    static void addProblemStatGlobal(ProblemStatSeq *probStat);
Thomas Witkowski's avatar
Thomas Witkowski committed
292
293
294
295
296
297

    MeshLevelData& getMeshLevelData() 
    {
      return levelData;
    }

298
  protected:
299
300
    void addProblemStat(ProblemStatSeq *probStat);

301
302
    /// Determines the interior boundaries, i.e. boundaries between ranks, and
    /// stores all information about them in \ref interiorBoundary.
303
    void createInteriorBoundary(bool firstCall);
Thomas Witkowski's avatar
Thomas Witkowski committed
304

Thomas Witkowski's avatar
Thomas Witkowski committed
305
306
    void createBoundaryDofs();

307
308
    /// Removes all macro elements from the mesh that are not part of ranks 
    /// partition.
309
310
    void removeMacroElements();

311
312
    void updateLocalGlobalNumbering();

313
314
    /// Updates the local and global DOF numbering after the mesh has been 
    /// changed.
315
316
317
    void updateLocalGlobalNumbering(ParallelDofMapping &dmap,
				    DofComm &dcom,
				    const FiniteElemSpace *feSpace);
318

319
320
321
322
    /// Calls \ref createPeriodicMap(feSpace) for all FE spaces that are
    /// handled by the mesh distributor.
    void createPeriodicMap();

323
324
325
    /// Creates, for a specific FE space, to all DOFs in rank's partition that 
    /// are on a periodic boundary the mapping from dof index to the other 
    /// periodic dof indices. This information is stored in \ref periodicDofMap.  
326
    void createPeriodicMap(const FiniteElemSpace *feSpace);
327

328
329
330
331
332
333
    /// This function is called only once during the initialization when the
    /// whole macro mesh is available on all cores. It copies the pointers of all
    /// macro elements to \ref allMacroElements and stores all neighbour 
    /// information based on macro element indices (and not pointer based) in 
    /// \ref macroElementNeighbours. These information are then used to 
    /// reconstruct macro elements during mesh redistribution.
334
335
    void createMacroElementInfo();

336
337
    void updateMacroElementInfo();

338
    /** \brief
339
340
341
342
343
344
     * Checks for all given interior boundaries if the elements fit together on
     * both sides of the boundaries. If this is not the case, the mesh is 
     * adapted. Because refinement of a certain element may forces the 
     * refinement of other elements, it is not guaranteed that all rank's meshes
     * fit together after this function terminates. Hence, it must be called 
     * until a stable mesh refinement is reached.
345
     *
346
347
     * \param[in] allBound   Defines a map from rank to interior boundaries 
     *                       which should be checked.
348
     *
349
350
351
     * \return    If the mesh has  been changed by this function, it returns 
     *            true. Otherwise, it returns false, i.e., the given interior 
     *            boundaries fit together on both sides.
352
353
     */
    bool checkAndAdaptBoundary(RankToBoundMap &allBound);
354
  
355
356
    /// Sets \ref isRankDof to all matrices and rhs vectors in a given 
    /// stationary problem.
357
    void setRankDofs(ProblemStatSeq *probStat);
358

359
360
    /// Sets \ref isRankDof to all matrices and rhs vectors in all 
    /// stationary problems.
361
362
    void setRankDofs();

363
364
365
366
    /// Removes all periodic boundary condition information from all matrices and
    /// vectors of all stationary problems and from the mesh itself.
    void removePeriodicBoundaryConditions();

367
368
369
370
    /// Removes all periodic boundary condition information from all matrices and
    /// vector of a given stationary problem.
    void removePeriodicBoundaryConditions(ProblemStatSeq *probStat);

Thomas Witkowski's avatar
Thomas Witkowski committed
371
    // Removes all periodic boundaries from a given boundary map.
372
    void removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
373

374
375
    void createMeshLevelStructure();

376
    /// Writes a vector of dof pointers to an output stream.
377
    void serialize(ostream &out, DofContainer &data);
378

379
380
381
382
    /// Writes a \ref RankToDofContainer to an output stream.
    void serialize(ostream &out, 
		   map<int, map<const FiniteElemSpace*, DofContainer> > &data);

383
    /// Reads a vector of dof pointers from an input stream.
384
    void deserialize(istream &in, DofContainer &data,
385
		     map<int, const DegreeOfFreedom*> &dofIndexMap);
386
387

    /// Reads a \ref RankToDofContainer from an input stream.
388
389
    void deserialize(istream &in, 
		     map<int, map<const FiniteElemSpace*, DofContainer> > &data,
390
		     map<const FiniteElemSpace*, map<int, const DegreeOfFreedom*> > &dofIndexMap);
391
392
393

    /// Writes a mapping from dof pointers to some values to an output stream.
    template<typename T>
394
    void serialize(ostream &out, map<const DegreeOfFreedom*, T> &data)
395
    {
396
397
      FUNCNAME("ParallelDomainBase::serialize()");

398
      int mapSize = data.size();
399
      SerUtil::serialize(out, mapSize);
400
      for (typename map<const DegreeOfFreedom*, T>::iterator it = data.begin();
401
402
403
	   it != data.end(); ++it) {
	int v1 = (*(it->first));
	T v2 = it->second;
404
405
	SerUtil::serialize(out, v1);
	SerUtil::serialize(out, v2);
406
407
408
409
410
      }
    }

    /// Reads a mapping from dof pointer to some values from an input stream.
    template<typename T>
411
    void deserialize(istream &in, map<const DegreeOfFreedom*, T> &data,
412
		     map<int, const DegreeOfFreedom*> &dofIndexMap)
413
    {
414
415
      FUNCNAME("ParallelDomainBase::deserialize()");

416
      int mapSize = 0;
417
      SerUtil::deserialize(in, mapSize);
418
419
420
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
421
422
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
423

424
425
	TEST_EXIT_DBG(dofIndexMap.count(v1) != 0)
	  ("Cannot find DOF %d in map!\n", v1);
426

427
	data[dofIndexMap[v1]] = v2;
428
429
      }
    }
430

431
  protected:
432
433
    /// List of all stationary problems that are managed by this mesh 
    /// distributor.
434
    vector<ProblemStatSeq*> problemStat;
Thomas Witkowski's avatar
Thomas Witkowski committed
435

436
437
438
    /// If true, the mesh distributor is already initialized;
    bool initialized;

439
440
441
442
443
444
    /// The rank of the current process.
    int mpiRank;

    /// Overall number of processes.
    int mpiSize;

445
446
    /// MPI communicator collected all processes, which should be used for
    /// calculation. The Debug procces is not included in this communicator.
447
448
449
    MPI::Intracomm mpiComm;

    /// Name of the problem (as used in the init files)
450
    string name;
451

452
453
    /// Finite element spaces of the problem.
    vector<const FiniteElemSpace*> feSpaces;
454

455
456
457
    /// Mesh of the problem.
    Mesh *mesh;

458
459
460
    /// A refinement manager that should be used on the mesh. It is used to 
    /// refine elements at interior boundaries in order to fit together with 
    /// elements on the other side of the interior boundary.    
461
462
    RefinementManager *refineManager;

463
464
465
    /// Info level.
    int info;

466
467
    /// Pointer to a mesh partitioner that is used to partition the mesh to 
    /// the ranks.
468
    MeshPartitioner *partitioner;
469

470
471
    /// Weights for the elements, i.e., the number of leaf elements within 
    /// this element.
472
    map<int, double> elemWeights;
473

474
475
    /// Stores to every macro element index the number of the rank that owns this
    /// macro element.
476
    map<int, int> partitionMap;
477

478
    /// Mapping object to map from local DOF indices to global ones.
479
480
    ParallelDofMapping dofMap;

481
482
    ParallelDofMapping dofMapSd;

483
    /// Database to store and query all sub-objects of all elements of the 
484
    /// macro mesh.
485
    ElementObjectDatabase elObjDb;
Thomas Witkowski's avatar
Thomas Witkowski committed
486

487
    /// Defines the interior boundaries of the domain that result from 
488
489
    /// partitioning the whole mesh. 
    InteriorBoundary intBoundary;
490

491
492
    InteriorBoundary intBoundarySd;

493
    DofComm dofComm;
494

495
496
    DofComm dofCommSd;

497
    PeriodicMap periodicMap;
498

499
500
501
502
    /// This set of values must be interchanged between ranks when the mesh is 
    /// repartitioned.
    vector<DOFVector<double>*> interchangeVectors;
		        
503
504
505
506
    /// If the problem definition has been read from a serialization file, this 
    /// variable is true, otherwise it is false. This variable is used to stop the
    /// initialization function, if the problem definition has already been read
    /// from a serialization file.
507
    bool deserialized;
508

509
510
511
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

512
513
514
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;

515
516
    /// Stores the number of mesh changes that must lie in between to 
    /// repartitionings.
517
518
    int repartitionIthChange;

519
520
    /// Counts the number of mesh changes after the last mesh repartitioning 
    /// was done.
521
    int nMeshChangesAfterLastRepartitioning;
522

523
524
525
    /// Countes the number of mesh repartitions that were done. Till now, this 
    /// variable is used only for debug outputs.
    int repartitioningCounter;
526

527
    /// Directory name where all debug output files should be written to.
528
    string debugOutputDir;
529

530
531
    /// Stores the mesh change index. This is used to recognize changes in the
    /// mesh structure (e.g. through refinement or coarsening managers).
532
    long lastMeshChangeIndex;
533

534
535
536
537
    /// Stores for all macro elements of the original macro mesh the
    /// neighbourhood information based on element indices. Thus, each macro
    /// element index is mapped to a vector containing all indices of 
    /// neighbouring macro elements.
538
    map<int, vector<int> > macroElementNeighbours;
539

540
541
    /// Store all macro elements of the overall mesh, i.e., before the
    /// mesh is redistributed for the first time.
542
    vector<MacroElement*> allMacroElements;
543

Thomas Witkowski's avatar
Thomas Witkowski committed
544
545
    Flag createBoundaryDofFlag;

546
547
548
    /// Stores on each mesh level for all FE spaces the information about
    /// all boundary DOFs.
    vector<map<const FiniteElemSpace*, BoundaryDofInfo> > boundaryDofInfo;
549

550
551
    MeshLevelData levelData;

Thomas Witkowski's avatar
Thomas Witkowski committed
552
  public:
553
554
    static bool sebastianMode;

555
556
557
    /// The boundary DOFs are sorted by subobject entities, i.e., first all
    /// face DOFs, edge DOFs and to the last vertex DOFs will be set to
    /// communication structure vectors, \ref sendDofs and \ref recvDofs.
Thomas Witkowski's avatar
Thomas Witkowski committed
558
559
    static const Flag BOUNDARY_SUBOBJ_SORTED;

560
561
562
563
564
565
566
567
568
    /// When boundary DOFs are created, \ref boundaryDofInfo is filled for
    /// all DOFs that this rank will send to other ranks (thus, rank 
    /// owned DOFs.
    static const Flag BOUNDARY_FILL_INFO_SEND_DOFS;

    /// When boundary DOFs are created, \ref boundaryDofInfo is filled for
    /// all DOFs that this rank will receive from other ranks (thus, DOFs
    /// that are owned by another rank).
    static const Flag BOUNDARY_FILL_INFO_RECV_DOFS;
Thomas Witkowski's avatar
Thomas Witkowski committed
569

570
571
    static MeshDistributor *globalMeshDistributor;

572
    friend class ParallelDebug;
573
574
575
  };
}

576
#endif // AMDIS_MESHDISTRIBUTOR_H