MeshDistributor.h 21.8 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()
155
    {
156
      return dofComm;
157 158
    }

159 160 161 162 163
    DofComm& getDofCommSd()
    {
      return dofCommSd;
    }

164 165 166 167 168
    InteriorBoundary& getIntBoundary()
    {
      return intBoundary;
    }

169 170 171 172 173
    InteriorBoundary& getIntBoundarySd()
    {
      return intBoundarySd;
    }

174
    inline long getLastMeshChangeIndex()
175
    {
176
      return lastMeshChangeIndex;
177
    }
178

179
    inline int getMpiRank()
180
    {
181
      return mpiRank;
182
    }
183

Thomas Witkowski's avatar
Thomas Witkowski committed
184 185 186 187 188
    inline int getMpiSize()
    {
      return mpiSize;
    }

189 190 191
    inline MPI::Intracomm& getMpiComm()
    {
      return mpiComm;
192 193
    }

194 195 196 197 198 199 200 201 202 203
    inline MPI::Intracomm getLocalMpiComm()
    {
      if (levelData.getLevelNumber() == 1)
	return PETSC_COMM_SELF;

      TEST_EXIT(levelData.getLevelNumber() == 2)("Not yet implemented!\n");

      return levelData.getMpiComm(1);
    }

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

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

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

    /** \brief
216 217 218 219
     * 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.
220
     *
221 222 223
     * 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.
224
     */    
225 226 227 228 229
    template<typename T>
    void synchVector(DOFVector<T> &vec) 
    {
      StdMpi<vector<T> > stdMpi(mpiComm);

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

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

249 250
      for (DofComm::Iterator it(dofComm.getRecvDofs(), fe); 
	   !it.end(); it.nextRank())
251 252 253
	for (; !it.endDofIter(); it.nextDof())
	  vec[it.getDofIndex()] = 
	     stdMpi.getRecvData(it.getRank())[it.getDofCounter()];
254
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
255
   
Thomas Witkowski's avatar
Blub  
Thomas Witkowski committed
256 257 258 259
    /// 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);
260

Thomas Witkowski's avatar
Thomas Witkowski committed
261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295
    /// 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)
    {
      StdMpi<vector<T> > stdMpi(mpiComm);

      const FiniteElemSpace *fe = vec.getFeSpace();

      for (DofComm::Iterator it(dofComm.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);
      }

      for (DofComm::Iterator it(dofComm.getSendDofs()); 
	   !it.end(); it.nextRank())
        stdMpi.recv(it.getRank());
	     
      stdMpi.startCommunication();

      for (DofComm::Iterator it(dofComm.getSendDofs(), fe); 
	   !it.end(); it.nextRank())
	for (; !it.endDofIter(); it.nextDof())
	  vec[it.getDofIndex()] += 
	     stdMpi.getRecvData(it.getRank())[it.getDofCounter()];

      synchVector(vec);
    }

296 297 298 299 300 301
    /// 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.
302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318
    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);
319

Thomas Witkowski's avatar
Thomas Witkowski committed
320 321
    void setBoundaryDofRequirement(Flag flag)
    {
322
      createBoundaryDofFlag |= flag;
Thomas Witkowski's avatar
Thomas Witkowski committed
323 324
    }

325 326
    BoundaryDofInfo& getBoundaryDofInfo(const FiniteElemSpace *feSpace,
					int level)
327
    {
328 329 330 331 332 333 334
      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];
335 336
    }

337 338
    void getAllBoundaryDofs(const FiniteElemSpace *feSpace, 
			    int level,
339
			    DofContainer& dofs);
340

Thomas Witkowski's avatar
Thomas Witkowski committed
341
    ElementObjectDatabase& getElementObjectDb() 
342 343 344
    {
      return elObjDb;
    }
345 346 347

    /// Adds a stationary problem to the global mesh distributor objects.
    static void addProblemStatGlobal(ProblemStatSeq *probStat);
Thomas Witkowski's avatar
Thomas Witkowski committed
348 349 350 351 352 353

    MeshLevelData& getMeshLevelData() 
    {
      return levelData;
    }

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

357 358 359 360 361 362 363
    void updateLocalGlobalNumbering();

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

364
  protected:
Thomas Witkowski's avatar
Thomas Witkowski committed
365 366 367 368 369 370 371 372
    /// Creates an initial paritioning of the mesh.
    void createInitialPartitioning();

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

    ///
373 374
    void addProblemStat(ProblemStatSeq *probStat);

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

Thomas Witkowski's avatar
Thomas Witkowski committed
379
    ///
Thomas Witkowski's avatar
Thomas Witkowski committed
380 381
    void createBoundaryDofs();

382 383
    /// Removes all macro elements from the mesh that are not part of ranks 
    /// partition.
384 385
    void removeMacroElements();

386 387 388 389
    /// Calls \ref createPeriodicMap(feSpace) for all FE spaces that are
    /// handled by the mesh distributor.
    void createPeriodicMap();

390 391 392
    /// 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.  
393
    void createPeriodicMap(const FiniteElemSpace *feSpace);
394

395 396 397 398 399 400
    /// 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.
401 402
    void createMacroElementInfo();

403 404
    void updateMacroElementInfo();

405
    /** \brief
406 407 408 409 410 411
     * 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.
412
     *
413 414
     * \param[in] allBound   Defines a map from rank to interior boundaries 
     *                       which should be checked.
415
     *
416 417 418
     * \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.
419 420
     */
    bool checkAndAdaptBoundary(RankToBoundMap &allBound);
421
  
422 423 424 425
    /// Removes all periodic boundary condition information from all matrices and
    /// vectors of all stationary problems and from the mesh itself.
    void removePeriodicBoundaryConditions();

426 427 428 429
    /// 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
430
    // Removes all periodic boundaries from a given boundary map.
431
    void removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
432

433 434
    void createMeshLevelStructure();

435
    /// Writes a vector of dof pointers to an output stream.
436
    void serialize(ostream &out, DofContainer &data);
437

438 439 440 441
    /// Writes a \ref RankToDofContainer to an output stream.
    void serialize(ostream &out, 
		   map<int, map<const FiniteElemSpace*, DofContainer> > &data);

442
    /// Reads a vector of dof pointers from an input stream.
443
    void deserialize(istream &in, DofContainer &data,
444
		     map<int, const DegreeOfFreedom*> &dofIndexMap);
445 446

    /// Reads a \ref RankToDofContainer from an input stream.
447 448
    void deserialize(istream &in, 
		     map<int, map<const FiniteElemSpace*, DofContainer> > &data,
449
		     map<const FiniteElemSpace*, map<int, const DegreeOfFreedom*> > &dofIndexMap);
450 451 452

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

457
      int mapSize = data.size();
458
      SerUtil::serialize(out, mapSize);
459
      for (typename map<const DegreeOfFreedom*, T>::iterator it = data.begin();
460 461 462
	   it != data.end(); ++it) {
	int v1 = (*(it->first));
	T v2 = it->second;
463 464
	SerUtil::serialize(out, v1);
	SerUtil::serialize(out, v2);
465 466 467 468 469
      }
    }

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

475
      int mapSize = 0;
476
      SerUtil::deserialize(in, mapSize);
477 478 479
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
480 481
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
482

483 484
	TEST_EXIT_DBG(dofIndexMap.count(v1) != 0)
	  ("Cannot find DOF %d in map!\n", v1);
485

486
	data[dofIndexMap[v1]] = v2;
487 488
      }
    }
489

490
  protected:
491 492
    /// List of all stationary problems that are managed by this mesh 
    /// distributor.
493
    vector<ProblemStatSeq*> problemStat;
Thomas Witkowski's avatar
Thomas Witkowski committed
494

495 496 497
    /// If true, the mesh distributor is already initialized;
    bool initialized;

498 499 500 501 502 503
    /// The rank of the current process.
    int mpiRank;

    /// Overall number of processes.
    int mpiSize;

504 505
    /// MPI communicator collected all processes, which should be used for
    /// calculation. The Debug procces is not included in this communicator.
506 507 508
    MPI::Intracomm mpiComm;

    /// Name of the problem (as used in the init files)
509
    string name;
510

511 512
    /// Set of all different FE spaces.
    vector<const FiniteElemSpace*> feSpaces;
513
    
514 515 516
    /// 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.
517 518
    Mesh *mesh;

519 520 521
    /// 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.    
522 523
    RefinementManager *refineManager;

524 525
    /// Pointer to a mesh partitioner that is used to partition the mesh to 
    /// the ranks.
526
    MeshPartitioner *partitioner;
527

528 529
    /// Weights for the elements, i.e., the number of leaf elements within 
    /// this element.
530
    map<int, double> elemWeights;
531

532 533
    /// Stores to every macro element index the number of the rank that owns this
    /// macro element.
534
    map<int, int> partitionMap;
535

536
    /// Database to store and query all sub-objects of all elements of the 
537
    /// macro mesh.
538
    ElementObjectDatabase elObjDb;
Thomas Witkowski's avatar
Thomas Witkowski committed
539

540
    /// Defines the interior boundaries of the domain that result from 
541 542
    /// partitioning the whole mesh. 
    InteriorBoundary intBoundary;
543

544 545
    InteriorBoundary intBoundarySd;

546
    DofComm dofComm;
547

548 549
    DofComm dofCommSd;

550
    PeriodicMap periodicMap;
551

552 553 554 555
    /// This set of values must be interchanged between ranks when the mesh is 
    /// repartitioned.
    vector<DOFVector<double>*> interchangeVectors;
		        
556 557 558 559
    /// 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.
560
    bool deserialized;
561

562 563 564
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

565 566 567
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;

568 569
    /// Stores the number of mesh changes that must lie in between to 
    /// repartitionings.
570 571
    int repartitionIthChange;

572 573 574
    ///
    int repartitioningWaitAfterFail;

575 576
    /// Counts the number of mesh changes after the last mesh repartitioning 
    /// was done.
577
    int nMeshChangesAfterLastRepartitioning;
578

579 580 581
    /// Countes the number of mesh repartitions that were done. Till now, this 
    /// variable is used only for debug outputs.
    int repartitioningCounter;
582

583 584 585 586 587
    /// 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;

588
    /// Directory name where all debug output files should be written to.
589
    string debugOutputDir;
590

591 592
    /// Stores the mesh change index. This is used to recognize changes in the
    /// mesh structure (e.g. through refinement or coarsening managers).
593
    long lastMeshChangeIndex;
594

595 596 597 598
    /// 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.
599
    map<int, vector<int> > macroElementNeighbours;
600

601 602
    /// Store all macro elements of the overall mesh, i.e., before the
    /// mesh is redistributed for the first time.
603
    vector<MacroElement*> allMacroElements;
604

Thomas Witkowski's avatar
Thomas Witkowski committed
605 606
    Flag createBoundaryDofFlag;

607 608 609
    /// Stores on each mesh level for all FE spaces the information about
    /// all boundary DOFs.
    vector<map<const FiniteElemSpace*, BoundaryDofInfo> > boundaryDofInfo;
610

611 612
    /// Stores information about hierarchical decomposition of the mesh levels.
    /// Is used to specify multi level solver methods.
613 614
    MeshLevelData levelData;

Thomas Witkowski's avatar
bla  
Thomas Witkowski committed
615 616 617 618 619 620
    /// 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;

621 622 623 624 625
    /// 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;

626 627 628 629
    /// 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
630 631 632
    /// If true, detailed timings for benchmarking are printed.
    bool printTimings;

Thomas Witkowski's avatar
Thomas Witkowski committed
633
  public:
634 635 636
    /// 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
637 638
    static const Flag BOUNDARY_SUBOBJ_SORTED;

639 640 641 642 643 644 645 646 647
    /// 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
648

649 650
    static MeshDistributor *globalMeshDistributor;

651
    friend class ParallelDebug;
652 653 654
  };
}

655
#endif // AMDIS_MESHDISTRIBUTOR_H