MeshDistributor.h 21.6 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
	          
  public:
Thomas Witkowski's avatar
Thomas Witkowski committed
64
65
    ~MeshDistributor();

66
    /// Initialization of mesh distributor.
67
    void initParallelization();
68

69
    /// Clean up procedure for the mesh distributor and attached objects.
70
    void exitParallelization();
71

72
73
74
75
76
77
78
79
    /** \brief
     * Register a parallel DOF mapping. This DOF mapping object will than 
     * automatically updated by the mesh distributer after mesh changes.
     *
     * \param[in]  dofMap   Parallel DOF mapping object.
     */
    void registerDofMap(ParallelDofMapping &dofMap);

Thomas Witkowski's avatar
Thomas Witkowski committed
80
81
82
83
84
85
86
    /** \brief
     * Removes a registered DOF mapping from the mesh distributor.
     *
     * \param[in] dofMap   Parallel DOF mapping object to be removed.
     */
    void removeDofMap(ParallelDofMapping &dofMap);

87
88
89
    /// Adds a DOFVector to the set of \ref interchangeVecs. Thus, this vector 
    /// will be automatically interchanged between ranks when mesh is 
    /// repartitioned.
90
91
92
93
94
    void addInterchangeVector(DOFVector<double> *vec)
    {
      interchangeVectors.push_back(vec);
    }

95
96
97
98
99
100
101
    /// 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));
    }
    
102
    /** \brief
103
104
105
106
107
     * 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.
108
     *
109
110
111
112
113
     * \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.
114
     */
115
    void checkMeshChange(bool tryRepartition = true);
116

Thomas Witkowski's avatar
Thomas Witkowski committed
117
118
119
    /// 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.
120
121
    void repartitionMesh();
    
Thomas Witkowski's avatar
Thomas Witkowski committed
122
123
124
125
126
127
128
    void getImbalanceFactor(double &imbalance, 
			    int &minDofs, 
			    int &maxDofs,
			    int &sumDofs);

    double getImbalanceFactor();

129
130
131
    /// Calculates the imbalancing factor and prints it to screen.
    void printImbalanceFactor();

Thomas Witkowski's avatar
Thomas Witkowski committed
132
133
134
135
    /// 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.
136
    void testForMacroMesh();
137

Thomas Witkowski's avatar
Thomas Witkowski committed
138
    inline string getName() 
139
140
141
    { 
      return name; 
    }
142

Thomas Witkowski's avatar
Thomas Witkowski committed
143
144
145
146
147
    inline Mesh* getMesh()
    {
      return mesh;
    }

148
149
    /// Returns the periodic mapping handler, \ref periodicMap.
    inline PeriodicMap& getPeriodicMap()
150
    {
151
      return periodicMap;
152
    }
153

154
    DofComm& getDofComm(int level)
155
    {
156
      return dofComm[level];
157
158
    }

159
    InteriorBoundary& getIntBoundary(int level)
160
    {
161
      return intBoundary[level];
162
163
    }

164
    inline long getLastMeshChangeIndex()
165
    {
166
      return lastMeshChangeIndex;
167
    }
168

169
    inline int getMpiRank()
170
    {
171
      return mpiRank;
172
    }
173

174
    inline int getMpiSize(int level)
Thomas Witkowski's avatar
Thomas Witkowski committed
175
    {
176
      return levelData.getMpiComm(level).Get_size();
Thomas Witkowski's avatar
Thomas Witkowski committed
177
178
    }

179
    inline MPI::Intracomm& getMpiComm(int level)
180
    {
181
      return levelData.getMpiComm(level);
182
183
    }

184
185
186
187
188
    inline bool isInitialized()
    {
      return initialized;
    }

189
    // Writes all data of this object to an output stream.
190
    void serialize(ostream &out);
191

192
    // Reads the object data from an input stream.
193
    void deserialize(istream &in);
194
195

    /** \brief
196
197
198
199
     * 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.
200
     *
201
202
203
     * 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.
204
     */    
205
206
207
    template<typename T>
    void synchVector(DOFVector<T> &vec) 
    {
208
209
      const FiniteElemSpace *fe = vec.getFeSpace();

210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
      int nLevels = levelData.getNumberOfLevels();
      for (int level = nLevels - 1; level >= 0; level--) {
	StdMpi<vector<T> > stdMpi(levelData.getMpiComm(level));

	for (DofComm::Iterator it(dofComm[level].getSendDofs(), fe); 
	     !it.end(); it.nextRank()) {
	  vector<T> dofs;
	  dofs.reserve(it.getDofs().size());
	  
	  for (; !it.endDofIter(); it.nextDof())
	    dofs.push_back(vec[it.getDofIndex()]);
	  
	  stdMpi.send(it.getRank(), dofs);
	}
	
	for (DofComm::Iterator it(dofComm[level].getRecvDofs()); 
	     !it.end(); it.nextRank())
	  stdMpi.recv(it.getRank());
228
	
229
	stdMpi.startCommunication();
230
	
231
232
233
234
235
	for (DofComm::Iterator it(dofComm[level].getRecvDofs(), fe); 
	     !it.end(); it.nextRank())
	  for (; !it.endDofIter(); it.nextDof())
	    vec[it.getDofIndex()] = 
	      stdMpi.getRecvData(it.getRank())[it.getDofCounter()];
236
237
      }
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
238
   
Thomas Witkowski's avatar
Blub  
Thomas Witkowski committed
239
240
241
    /// 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.
242
    void synchVector(SystemVector &vec);
243

Thomas Witkowski's avatar
Thomas Witkowski committed
244
245
246
247
248
249
250
    /// Works quite similar to the function \ref synchVector, but instead the 
    /// values of subdomain vectors are add along the boundaries.
    template<typename T>
    void synchAddVector(DOFVector<T> &vec)
    {
      const FiniteElemSpace *fe = vec.getFeSpace();

251
252
253
254
255
256
257
258
259
260
261
262
263
264
      int nLevels = levelData.getNumberOfLevels();
      for (int level = nLevels - 1; level >= 0; level--) {
	StdMpi<vector<T> > stdMpi(levelData.getMpiComm(level));

	for (DofComm::Iterator it(dofComm[level].getRecvDofs(), fe);
	     !it.end(); it.nextRank()) {
	  vector<T> dofs;
	  dofs.reserve(it.getDofs().size());
	  
	  for (; !it.endDofIter(); it.nextDof())
	    dofs.push_back(vec[it.getDofIndex()]);
	  
	  stdMpi.send(it.getRank(), dofs);
	}
Thomas Witkowski's avatar
Thomas Witkowski committed
265
	
266
267
268
	for (DofComm::Iterator it(dofComm[level].getSendDofs()); 
	     !it.end(); it.nextRank())
	  stdMpi.recv(it.getRank());
Thomas Witkowski's avatar
Thomas Witkowski committed
269
	
270
271
272
273
274
275
276
	stdMpi.startCommunication();
	
	for (DofComm::Iterator it(dofComm[level].getSendDofs(), fe); 
	     !it.end(); it.nextRank())
	  for (; !it.endDofIter(); it.nextDof())
	    vec[it.getDofIndex()] += 
	      stdMpi.getRecvData(it.getRank())[it.getDofCounter()];
Thomas Witkowski's avatar
Thomas Witkowski committed
277
278
279
280
281
      }

      synchVector(vec);
    }

282
283
284
285
286
287
    /// In 3D, a subdomain may not be a valid AMDiS mesh if it contains two
    /// parts which are only connected by an edge. In this case, the standard
    /// refinement algorithm does not work correctly, as two elements connected
    /// only on one edge are not neighours by definition. This functions checks
    /// for this situation and fix the problem. For this, the mesh is search for
    /// all edges connecting two elements that are otherwise not connected.
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
    void fix3dMeshRefinement();

    /** \brief Is used only within \ref fix3dMeshRefinement.
     * 
     * \param[in]  elems            Set of macro element indices.
     * \param[in]  edgeNoInEl       Maps from each element index in elems to a
     *                              local edge number.
     * \param[out] disconnectedEls  On output, this vector contains sets of
     *                              element indices. The union is equal to elems.
     *                              Each set contains all element indices, which
     *                              are reachable among each other by neighbour
     *                              relations. Elements within two different sets
     *                              cannot be reached via neigbourhood relation.
     */
    void helpToFix(std::set<int> &elems, 
		   map<int, int> &edgeNoInEl,
		   vector<std::set<int> > &disconnectedEls);
305

Thomas Witkowski's avatar
Thomas Witkowski committed
306
307
    void setBoundaryDofRequirement(Flag flag)
    {
308
      createBoundaryDofFlag |= flag;
Thomas Witkowski's avatar
Thomas Witkowski committed
309
310
    }

311
312
    BoundaryDofInfo& getBoundaryDofInfo(const FiniteElemSpace *feSpace,
					int level)
313
    {
314
315
316
317
318
319
320
      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];
321
322
    }

323
324
    void getAllBoundaryDofs(const FiniteElemSpace *feSpace, 
			    int level,
325
			    DofContainer& dofs);
326

Thomas Witkowski's avatar
Thomas Witkowski committed
327
    ElementObjectDatabase& getElementObjectDb() 
328
329
330
    {
      return elObjDb;
    }
331
332
333

    /// Adds a stationary problem to the global mesh distributor objects.
    static void addProblemStatGlobal(ProblemStatSeq *probStat);
Thomas Witkowski's avatar
Thomas Witkowski committed
334
335
336
337
338
339

    MeshLevelData& getMeshLevelData() 
    {
      return levelData;
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
340
341
342
    /// Updates all registered parallel DOF mappings, see \ref dofMaps.
    void updateParallelDofMappings();

343
344
345
346
347
348
349
    void updateLocalGlobalNumbering();

    /// Updates the local and global DOF numbering after the mesh has been 
    /// changed.
    void updateLocalGlobalNumbering(ParallelDofMapping &dmap,
				    const FiniteElemSpace *feSpace);

350
  protected:
Thomas Witkowski's avatar
Thomas Witkowski committed
351
352
353
354
355
356
357
358
    /// Creates an initial paritioning of the mesh.
    void createInitialPartitioning();

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

    ///
359
360
    void addProblemStat(ProblemStatSeq *probStat);

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

Thomas Witkowski's avatar
Thomas Witkowski committed
365
    ///
Thomas Witkowski's avatar
Thomas Witkowski committed
366
367
    void createBoundaryDofs();

368
369
    /// Removes all macro elements from the mesh that are not part of ranks 
    /// partition.
370
371
    void removeMacroElements();

372
373
374
375
    /// Calls \ref createPeriodicMap(feSpace) for all FE spaces that are
    /// handled by the mesh distributor.
    void createPeriodicMap();

376
377
378
    /// 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.  
379
    void createPeriodicMap(const FiniteElemSpace *feSpace);
380

381
382
383
384
385
386
    /// 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.
387
388
    void createMacroElementInfo();

389
390
    void updateMacroElementInfo();

391
    /** \brief
392
393
394
395
396
397
     * 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.
398
     *
399
400
     * \param[in] allBound   Defines a map from rank to interior boundaries 
     *                       which should be checked.
401
     *
402
403
404
     * \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.
405
406
     */
    bool checkAndAdaptBoundary(RankToBoundMap &allBound);
407
  
408
409
410
411
    /// Removes all periodic boundary condition information from all matrices and
    /// vectors of all stationary problems and from the mesh itself.
    void removePeriodicBoundaryConditions();

412
413
414
415
    /// 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
416
    // Removes all periodic boundaries from a given boundary map.
417
    void removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
418

419
420
    void createMeshLevelStructure();

421
    /// Writes a vector of dof pointers to an output stream.
422
    void serialize(ostream &out, DofContainer &data);
423

424
425
426
427
    /// Writes a \ref RankToDofContainer to an output stream.
    void serialize(ostream &out, 
		   map<int, map<const FiniteElemSpace*, DofContainer> > &data);

428
    /// Reads a vector of dof pointers from an input stream.
429
    void deserialize(istream &in, DofContainer &data,
430
		     map<int, const DegreeOfFreedom*> &dofIndexMap);
431
432

    /// Reads a \ref RankToDofContainer from an input stream.
433
434
    void deserialize(istream &in, 
		     map<int, map<const FiniteElemSpace*, DofContainer> > &data,
435
		     map<const FiniteElemSpace*, map<int, const DegreeOfFreedom*> > &dofIndexMap);
436
437
438

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

443
      int mapSize = data.size();
444
      SerUtil::serialize(out, mapSize);
445
      for (typename map<const DegreeOfFreedom*, T>::iterator it = data.begin();
446
447
448
	   it != data.end(); ++it) {
	int v1 = (*(it->first));
	T v2 = it->second;
449
450
	SerUtil::serialize(out, v1);
	SerUtil::serialize(out, v2);
451
452
453
454
455
      }
    }

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

461
      int mapSize = 0;
462
      SerUtil::deserialize(in, mapSize);
463
464
465
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
466
467
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
468

469
470
	TEST_EXIT_DBG(dofIndexMap.count(v1) != 0)
	  ("Cannot find DOF %d in map!\n", v1);
471

472
	data[dofIndexMap[v1]] = v2;
473
474
      }
    }
475

476
  protected:
477
478
    /// List of all stationary problems that are managed by this mesh 
    /// distributor.
479
    vector<ProblemStatSeq*> problemStat;
Thomas Witkowski's avatar
Thomas Witkowski committed
480

481
482
483
    /// If true, the mesh distributor is already initialized;
    bool initialized;

484
485
486
487
    /// The rank of the current process.
    int mpiRank;

    /// Name of the problem (as used in the init files)
488
    string name;
489

490
491
    /// Set of all different FE spaces.
    vector<const FiniteElemSpace*> feSpaces;
492
    
493
494
495
    /// Pointer to the only mesh. Note that we do not yet support multi mesh
    /// method, thus even if we consider coupled problems, all problems must
    /// be defined on the same mesh.
496
497
    Mesh *mesh;

498
499
500
    /// 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.    
501
502
    RefinementManager *refineManager;

503
504
    /// Pointer to a mesh partitioner that is used to partition the mesh to 
    /// the ranks.
505
    MeshPartitioner *partitioner;
506

507
508
    /// Weights for the elements, i.e., the number of leaf elements within 
    /// this element.
509
    map<int, double> elemWeights;
510

511
512
    /// Stores to every macro element index the number of the rank that owns this
    /// macro element.
513
    map<int, int> partitionMap;
514

515
    /// Database to store and query all sub-objects of all elements of the 
516
    /// macro mesh.
517
    ElementObjectDatabase elObjDb;
Thomas Witkowski's avatar
Thomas Witkowski committed
518

519
    /// Defines the interior boundaries of the domain that result from 
520
    /// partitioning the whole mesh. 
521
    MultiLevelInteriorBoundary intBoundary;
522

523
524
    /// Dof communicator object
    MultiLevelDofComm dofComm;
525

526
    PeriodicMap periodicMap;
527

528
529
530
531
    /// This set of values must be interchanged between ranks when the mesh is 
    /// repartitioned.
    vector<DOFVector<double>*> interchangeVectors;
		        
532
533
534
535
    /// 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.
536
    bool deserialized;
537

538
539
540
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

541
542
543
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;

544
545
    /// Stores the number of mesh changes that must lie in between to 
    /// repartitionings.
546
547
    int repartitionIthChange;

548
549
550
    ///
    int repartitioningWaitAfterFail;

551
552
    /// Counts the number of mesh changes after the last mesh repartitioning 
    /// was done.
553
    int nMeshChangesAfterLastRepartitioning;
554

555
556
557
    /// Countes the number of mesh repartitions that were done. Till now, this 
    /// variable is used only for debug outputs.
    int repartitioningCounter;
558

559
560
561
562
563
    /// If repartitioning of the mesh fail, this variable has a positive value
    /// that gives the number of mesh changes the mesh distributer will wait
    /// before trying new mesh repartitioning.
    int repartitioningFailed;

564
    /// Directory name where all debug output files should be written to.
565
    string debugOutputDir;
566

567
568
    /// Stores the mesh change index. This is used to recognize changes in the
    /// mesh structure (e.g. through refinement or coarsening managers).
569
    long lastMeshChangeIndex;
570

571
572
573
574
    /// 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.
575
    map<int, vector<int> > macroElementNeighbours;
576

577
578
    /// Store all macro elements of the overall mesh, i.e., before the
    /// mesh is redistributed for the first time.
579
    vector<MacroElement*> allMacroElements;
580

Thomas Witkowski's avatar
Thomas Witkowski committed
581
582
    Flag createBoundaryDofFlag;

583
584
585
    /// Stores on each mesh level for all FE spaces the information about
    /// all boundary DOFs.
    vector<map<const FiniteElemSpace*, BoundaryDofInfo> > boundaryDofInfo;
586

587
588
    /// Stores information about hierarchical decomposition of the mesh levels.
    /// Is used to specify multi level solver methods.
589
590
    MeshLevelData levelData;

Thomas Witkowski's avatar
bla  
Thomas Witkowski committed
591
592
593
594
595
596
    /// If there is no mesh adaptivity, the mesh distributor can remove some
    /// data structures which are only used if mesh changes or it must be
    /// redistributed due to some local adaptivity. By default, this variable
    /// is set to true, and thus no special assumption are made.
    bool meshAdaptivity;

597
598
599
600
601
    /// Specifies whether the global domain has periodic boundaries. Thus, this
    /// variable is not related to rank's subdomain but to the global problem
    /// and therefore the value if the same on all ranks.
    bool hasPeriodicBoundary;

602
603
604
605
    /// Set of all parallel DOF mapping object that are registered by parallel
    /// solver objects and must be updated automatically after mesh change.
    vector<ParallelDofMapping*> dofMaps;

Thomas Witkowski's avatar
Thomas Witkowski committed
606
607
608
    /// If true, detailed timings for benchmarking are printed.
    bool printTimings;

609
610
611
    /// If true, detailed information about memory usage are printed.
    bool printMemoryUsage;

Thomas Witkowski's avatar
Thomas Witkowski committed
612
  public:
613
614
615
    /// 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
616
617
    static const Flag BOUNDARY_SUBOBJ_SORTED;

618
619
620
621
622
623
624
625
626
    /// 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
627

628
629
    static MeshDistributor *globalMeshDistributor;

630
    friend class ParallelDebug;
631
632
633
  };
}

634
#endif // AMDIS_MESHDISTRIBUTOR_H