MeshDistributor.h 22.2 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


22

23
/** \file MeshDistributor.h */
24

25 26
#ifndef AMDIS_MESHDISTRIBUTOR_H
#define AMDIS_MESHDISTRIBUTOR_H
27 28


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

49
namespace AMDiS { namespace Parallel {
50

Thomas Witkowski's avatar
Thomas Witkowski committed
51 52 53

  struct BoundaryDofInfo
  {
54
    std::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

138
    inline std::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(std::ostream &out);
191

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

    /** \brief
196 197 198
     * 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 
199
     * boundary, to all other ranks also having these DOFs.
200
     *
201
     * This function must be used, for example, after the linear system is
202 203
     * 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
      int nLevels = levelData.getNumberOfLevels();
      for (int level = nLevels - 1; level >= 0; level--) {
212
	StdMpi<std::vector<T> > stdMpi(levelData.getMpiComm(level));
213 214 215

	for (DofComm::Iterator it(dofComm[level].getSendDofs(), fe); 
	     !it.end(); it.nextRank()) {
216
	  std::vector<T> dofs;
217 218 219 220 221 222 223 224 225 226 227
	  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
      int nLevels = levelData.getNumberOfLevels();
      for (int level = nLevels - 1; level >= 0; level--) {
253
	StdMpi<std::vector<T> > stdMpi(levelData.getMpiComm(level));
254 255 256

	for (DofComm::Iterator it(dofComm[level].getRecvDofs(), fe);
	     !it.end(); it.nextRank()) {
257
	  std::vector<T> dofs;
258 259 260 261 262 263 264
	  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
    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, 
303 304
		   std::map<int, int> &edgeNoInEl,
		   std::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
    void updateLocalGlobalNumbering();

    /// Updates the local and global DOF numbering after the mesh has been 
    /// changed.
    void updateLocalGlobalNumbering(ParallelDofMapping &dmap,
				    const FiniteElemSpace *feSpace);
349 350 351 352 353 354
    
    /// set variable \ref repartitioningAllowed
    void setRepartitioningAllowed(bool allowed)
    {
      repartitioningAllowed = allowed;
    }
355

356
  protected:
357
    /// Creates an initial partitioning of the mesh.
Thomas Witkowski's avatar
Thomas Witkowski committed
358 359 360 361 362 363 364
    void createInitialPartitioning();

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

    ///
365 366
    void addProblemStat(ProblemStatSeq *probStat);

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

Thomas Witkowski's avatar
Thomas Witkowski committed
371
    ///
Thomas Witkowski's avatar
Thomas Witkowski committed
372 373
    void createBoundaryDofs();

374 375
    /// Removes all macro elements from the mesh that are not part of ranks 
    /// partition.
376 377
    void removeMacroElements();

378 379 380 381
    /// Calls \ref createPeriodicMap(feSpace) for all FE spaces that are
    /// handled by the mesh distributor.
    void createPeriodicMap();

382 383 384
    /// 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.  
385
    void createPeriodicMap(const FiniteElemSpace *feSpace);
386

387 388 389 390 391 392
    /// 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.
393 394
    void createMacroElementInfo();

395 396
    void updateMacroElementInfo();

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

418 419 420 421
    /// 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
422
    // Removes all periodic boundaries from a given boundary map.
423
    void removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
424

425 426
    void createMeshLevelStructure();

427
    /// Writes a vector of dof pointers to an output stream.
428
    void serialize(std::ostream &out, DofContainer &data);
429

430
    /// Writes a \ref RankToDofContainer to an output stream.
431 432
    void serialize(std::ostream &out, 
		   std::map<int, std::map<const FiniteElemSpace*, DofContainer> > &data);
433

434
    /// Reads a vector of dof pointers from an input stream.
435 436
    void deserialize(std::istream &in, DofContainer &data,
		     std::map<int, const DegreeOfFreedom*> &dofIndexMap);
437 438

    /// Reads a \ref RankToDofContainer from an input stream.
439 440 441
    void deserialize(std::istream &in, 
		     std::map<int, std::map<const FiniteElemSpace*, DofContainer> > &data,
		     std::map<const FiniteElemSpace*, std::map<int, const DegreeOfFreedom*> > &dofIndexMap);
442 443 444

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

449
      int mapSize = data.size();
450
      SerUtil::serialize(out, mapSize);
451
      for (typename std::map<const DegreeOfFreedom*, T>::iterator it = data.begin();
452 453 454
	   it != data.end(); ++it) {
	int v1 = (*(it->first));
	T v2 = it->second;
455 456
	SerUtil::serialize(out, v1);
	SerUtil::serialize(out, v2);
457 458 459 460 461
      }
    }

    /// Reads a mapping from dof pointer to some values from an input stream.
    template<typename T>
462 463
    void deserialize(std::istream &in, std::map<const DegreeOfFreedom*, T> &data,
		     std::map<int, const DegreeOfFreedom*> &dofIndexMap)
464
    {
465 466
      FUNCNAME("ParallelDomainBase::deserialize()");

467
      int mapSize = 0;
468
      SerUtil::deserialize(in, mapSize);
469 470 471
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
472 473
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
474

475 476
	TEST_EXIT_DBG(dofIndexMap.count(v1) != 0)
	  ("Cannot find DOF %d in map!\n", v1);
477

478
	data[dofIndexMap[v1]] = v2;
479 480
      }
    }
481

482
  protected:
483 484
    /// List of all stationary problems that are managed by this mesh 
    /// distributor.
485
    std::vector<ProblemStatSeq*> problemStat;
Thomas Witkowski's avatar
Thomas Witkowski committed
486

487 488 489
    /// If true, the mesh distributor is already initialized;
    bool initialized;

490 491 492 493
    /// The rank of the current process.
    int mpiRank;

    /// Name of the problem (as used in the init files)
494
    std::string name;
495

496
    /// Set of all different FE spaces.
497
    std::vector<const FiniteElemSpace*> feSpaces;
498
    
499 500 501
    /// 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.
502 503
    Mesh *mesh;

504 505 506
    /// 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.    
507 508
    RefinementManager *refineManager;

509 510
    /// Pointer to a mesh partitioner that is used to partition the mesh to 
    /// the ranks.
511
    MeshPartitioner *partitioner;
512

513 514 515 516 517 518
    /// Pointer to a mesh partitioner that is used for the very first 
    /// partitioning of the mesh. In most cases, this pointer points to the
    /// same object as \ref partitioner, but this must not be the case in
    /// general.
    MeshPartitioner *initialPartitioner;

519 520
    /// Weights for the elements, i.e., the number of leaf elements within 
    /// this element.
521
    std::map<int, double> elemWeights;
522

523 524
    /// Stores to every macro element index the number of the rank that owns this
    /// macro element.
525
    std::map<int, int> partitionMap;
526

527
    /// Database to store and query all sub-objects of all elements of the 
528
    /// macro mesh.
529
    ElementObjectDatabase elObjDb;
Thomas Witkowski's avatar
Thomas Witkowski committed
530

531
    /// Defines the interior boundaries of the domain that result from 
532
    /// partitioning the whole mesh. 
533
    MultiLevelInteriorBoundary intBoundary;
534

535 536
    /// Dof communicator object
    MultiLevelDofComm dofComm;
537

538
    PeriodicMap periodicMap;
539

540 541
    /// This set of values must be interchanged between ranks when the mesh is 
    /// repartitioned.
542
    std::vector<DOFVector<double>*> interchangeVectors;
543
		        
544 545 546 547
    /// 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.
548
    bool deserialized;
549

550 551 552
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

553 554
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;
555 556 557
    
    /// repartition the mesh (only) the first time repartitionMesh() is called
    bool repartitionOnlyOnce;
558

559
    /// Stores the number of mesh changes that must lie in between two 
560
    /// repartitionings.
561 562
    int repartitionIthChange;

563 564 565
    ///
    int repartitioningWaitAfterFail;

566 567
    /// Counts the number of mesh changes after the last mesh repartitioning 
    /// was done.
568
    int nMeshChangesAfterLastRepartitioning;
569

570 571 572
    /// Countes the number of mesh repartitions that were done. Till now, this 
    /// variable is used only for debug outputs.
    int repartitioningCounter;
573

574 575 576 577 578
    /// 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;

579
    /// Directory name where all debug output files should be written to.
580
    std::string debugOutputDir;
581

582 583
    /// Stores the mesh change index. This is used to recognize changes in the
    /// mesh structure (e.g. through refinement or coarsening managers).
584
    long lastMeshChangeIndex;
585

586 587 588 589
    /// 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.
590
    std::map<int, std::vector<int> > macroElementNeighbours;
591

592 593
    /// Store all macro elements of the overall mesh, i.e., before the
    /// mesh is redistributed for the first time.
594
    std::vector<MacroElement*> allMacroElements;
595

Thomas Witkowski's avatar
Thomas Witkowski committed
596 597
    Flag createBoundaryDofFlag;

598 599
    /// Stores on each mesh level for all FE spaces the information about
    /// all boundary DOFs.
600
    std::vector<std::map<const FiniteElemSpace*, BoundaryDofInfo> > boundaryDofInfo;
601

602 603
    /// Stores information about hierarchical decomposition of the mesh levels.
    /// Is used to specify multi level solver methods.
604 605
    MeshLevelData levelData;

Thomas Witkowski's avatar
bla  
Thomas Witkowski committed
606 607 608 609 610 611
    /// 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;

612 613 614 615 616
    /// 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;

617 618
    /// Set of all parallel DOF mapping object that are registered by parallel
    /// solver objects and must be updated automatically after mesh change.
619
    std::vector<ParallelDofMapping*> dofMaps;
620

Thomas Witkowski's avatar
Thomas Witkowski committed
621 622 623
    /// If true, detailed timings for benchmarking are printed.
    bool printTimings;

624 625 626
    /// If true, detailed information about memory usage are printed.
    bool printMemoryUsage;

Thomas Witkowski's avatar
Thomas Witkowski committed
627
  public:
628 629 630
    /// 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
631 632
    static const Flag BOUNDARY_SUBOBJ_SORTED;

633 634 635 636 637 638 639 640 641
    /// 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
642

643 644
    static MeshDistributor *globalMeshDistributor;

645
    friend class ParallelDebug;
646
  };
647
} }
648

649
#endif // AMDIS_MESHDISTRIBUTOR_H