MeshDistributor.h 22.6 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 48 49
#include <string>

#include "operations/functors.hpp"
50

51
namespace AMDiS { namespace Parallel {
52

Thomas Witkowski's avatar
Thomas Witkowski committed
53 54 55

  struct BoundaryDofInfo
  {
56
    std::map<GeoIndex, DofContainerSet> geoDofs;
Thomas Witkowski's avatar
Thomas Witkowski committed
57 58
  };

59

60
  class MeshDistributor
61
  {
62
  private:
63
    MeshDistributor();
64 65
	          
  public:
Thomas Witkowski's avatar
Thomas Witkowski committed
66 67
    ~MeshDistributor();

68
    /// Initialization of mesh distributor.
69
    void initParallelization();
70

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

74 75 76 77 78 79 80 81
    /** \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
82 83 84 85 86 87 88
    /** \brief
     * Removes a registered DOF mapping from the mesh distributor.
     *
     * \param[in] dofMap   Parallel DOF mapping object to be removed.
     */
    void removeDofMap(ParallelDofMapping &dofMap);

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

99 100 101 102 103 104 105 106 107 108 109 110
    /// Removes the pointer to DOFVector @param vec from the
    /// set of interchange vectors.
    template< typename T >
    void removeInterchangeVector(DOFVector<T> *vec) {}
    void removeInterchangeVector(DOFVector< double >* vec)
    {
      std::vector< DOFVector< double >* >::iterator it;
      it = std::find(interchangeVectors.begin(), interchangeVectors.end(), vec);
      if ( it != interchangeVectors.end())
        interchangeVectors.erase(it);
    }

111
    /// Adds all DOFVectors of a SystemVector to \ref interchangeVecs.
112
    void addInterchangeVector(SystemVector *vec);
113 114 115

    /// The same as for DOFVectors
    void removeInterchangeVector(SystemVector* vec);
116
    
117
    /** \brief
118 119 120 121 122
     * 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.
123
     *
124 125 126 127 128
     * \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.
129
     */
130
    void checkMeshChange(bool tryRepartition = true);
131

Thomas Witkowski's avatar
Thomas Witkowski committed
132 133 134
    /// 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.
Siqi Ling's avatar
Siqi Ling committed
135
    bool repartitionMesh();
136
    
137 138 139 140
    void quickRepartition();
    
    void fullRepartition();
    
Thomas Witkowski's avatar
Thomas Witkowski committed
141 142 143 144 145 146 147
    void getImbalanceFactor(double &imbalance, 
			    int &minDofs, 
			    int &maxDofs,
			    int &sumDofs);

    double getImbalanceFactor();

148 149 150
    /// Calculates the imbalancing factor and prints it to screen.
    void printImbalanceFactor();

Thomas Witkowski's avatar
Thomas Witkowski committed
151 152 153 154
    /// 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.
155
    void testForMacroMesh();
156

157
    inline std::string getName() 
158 159 160
    { 
      return name; 
    }
161

Thomas Witkowski's avatar
Thomas Witkowski committed
162 163 164 165 166
    inline Mesh* getMesh()
    {
      return mesh;
    }

167 168
    /// Returns the periodic mapping handler, \ref periodicMap.
    inline PeriodicMap& getPeriodicMap()
169
    {
170
      return periodicMap;
171
    }
172

173
    DofComm& getDofComm(int level)
174
    {
175
      return dofComm[level];
176 177
    }

178
    InteriorBoundary& getIntBoundary(int level)
179
    {
180
      return intBoundary[level];
181 182
    }

183
    inline long getLastMeshChangeIndex()
184
    {
185
      return lastMeshChangeIndex;
186
    }
187

188
    inline int getMpiRank()
189
    {
190
      return mpiRank;
191
    }
192

193
    inline int getMpiSize(int level)
Thomas Witkowski's avatar
Thomas Witkowski committed
194
    {
195
      return levelData.getMpiComm(level).Get_size();
Thomas Witkowski's avatar
Thomas Witkowski committed
196 197
    }

198
    inline MPI::Intracomm& getMpiComm(int level)
199
    {
200
      return levelData.getMpiComm(level);
201 202
    }

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

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

211
    // Reads the object data from an input stream.
212
    void deserialize(std::istream &in);
213 214 215 216 217 218
    
    /// Works quite similar to the function \ref synchVector, but instead the 
    /// values of subdomain vectors are combined along the boundaries, by a
    /// binary functor. 
    template<typename T, typename Operator>
    void synchVector(DOFVector<T> &vec, Operator op)
219
    {
220 221
      const FiniteElemSpace *fe = vec.getFeSpace();

222 223
      int nLevels = levelData.getNumberOfLevels();
      for (int level = nLevels - 1; level >= 0; level--) {
224
	StdMpi<std::vector<T> > stdMpi(levelData.getMpiComm(level));
225

226
	for (DofComm::Iterator it(dofComm[level].getRecvDofs(), fe);
227
	     !it.end(); it.nextRank()) {
228
	  std::vector<T> dofs;
229 230 231 232 233 234 235 236
	  dofs.reserve(it.getDofs().size());
	  
	  for (; !it.endDofIter(); it.nextDof())
	    dofs.push_back(vec[it.getDofIndex()]);
	  
	  stdMpi.send(it.getRank(), dofs);
	}
	
237
	for (DofComm::Iterator it(dofComm[level].getSendDofs()); 
238 239
	     !it.end(); it.nextRank())
	  stdMpi.recv(it.getRank());
240
	
241
	stdMpi.startCommunication();
242
	
243
	for (DofComm::Iterator it(dofComm[level].getSendDofs(), fe); 
244 245
	     !it.end(); it.nextRank())
	  for (; !it.endDofIter(); it.nextDof())
246 247
	    op(vec[it.getDofIndex()],
	       stdMpi.getRecvData(it.getRank())[it.getDofCounter()]);
248
      }
249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266
      if (!boost::is_same<Operator, functors::assign<T> >::value)
	synchVector(vec);
    }
    
    /** \brief
     * 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 
     * boundary, to all other ranks also having these DOFs.
     *
     * This function must be used, for example, after the linear system is
     * solved, or after the DOFVector is set by some user defined functions, 
     * e.g., initial solution functions.
     */    
    template<typename T>
    void synchVector(DOFVector<T> &vec) 
    {
      synchVector(vec, functors::assign<T>());
267
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
268
   
Thomas Witkowski's avatar
Blub  
Thomas Witkowski committed
269 270 271
    /// 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.
272
    void synchVector(SystemVector &vec);
273
    
Thomas Witkowski's avatar
Thomas Witkowski committed
274 275 276
    template<typename T>
    void synchAddVector(DOFVector<T> &vec)
    {
277
      synchVector(vec, functors::add_assign<T>());
Thomas Witkowski's avatar
Thomas Witkowski committed
278 279
    }

280 281 282 283 284 285
    /// 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.
286 287 288 289 290 291 292 293 294 295 296 297 298 299 300
    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, 
301 302
		   std::map<int, int> &edgeNoInEl,
		   std::vector<std::set<int> > &disconnectedEls);
303

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

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

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

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

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

    MeshLevelData& getMeshLevelData() 
    {
      return levelData;
    }

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

341 342 343 344 345 346
    void updateLocalGlobalNumbering();

    /// Updates the local and global DOF numbering after the mesh has been 
    /// changed.
    void updateLocalGlobalNumbering(ParallelDofMapping &dmap,
				    const FiniteElemSpace *feSpace);
347 348 349 350 351 352
    
    /// set variable \ref repartitioningAllowed
    void setRepartitioningAllowed(bool allowed)
    {
      repartitioningAllowed = allowed;
    }
Siqi Ling's avatar
Siqi Ling committed
353 354 355 356 357
    
    void setElementWeights(std::map<int, double>& elWgts)
    {
      elemWeights = elWgts;
    }
358

359
  protected:
360 361 362 363
    
    /// Checks if repartition is needed.
    bool isRepartitionNecessary();
    
364
    /// Creates an initial partitioning of the mesh.
Thomas Witkowski's avatar
Thomas Witkowski committed
365 366 367 368 369
    void createInitialPartitioning();

    /// Set for each element on the partitioning level the number of 
    /// leaf elements.
    void setInitialElementWeights();
370 371 372 373
    
    /// Calculates \ref elemWeights with the gloabl max weight and 
    /// global sum of weight.
    void calculateElemWeights();
Thomas Witkowski's avatar
Thomas Witkowski committed
374 375

    ///
376 377
    void addProblemStat(ProblemStatSeq *probStat);

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

Thomas Witkowski's avatar
Thomas Witkowski committed
382
    ///
Thomas Witkowski's avatar
Thomas Witkowski committed
383 384
    void createBoundaryDofs();

385 386
    /// Removes all macro elements from the mesh that are not part of ranks 
    /// partition.
387 388
    void removeMacroElements();

389 390 391 392
    /// Calls \ref createPeriodicMap(feSpace) for all FE spaces that are
    /// handled by the mesh distributor.
    void createPeriodicMap();

393 394 395
    /// 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.  
396
    void createPeriodicMap(const FiniteElemSpace *feSpace);
397

398 399 400 401 402 403
    /// 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.
404 405
    void createMacroElementInfo();

406 407
    void updateMacroElementInfo();

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

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

436 437
    void createMeshLevelStructure();

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

441
    /// Writes a \ref RankToDofContainer to an output stream.
442 443
    void serialize(std::ostream &out, 
		   std::map<int, std::map<const FiniteElemSpace*, DofContainer> > &data);
444

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

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

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

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

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

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

486 487
	TEST_EXIT_DBG(dofIndexMap.count(v1) != 0)
	  ("Cannot find DOF %d in map!\n", v1);
488

489
	data[dofIndexMap[v1]] = v2;
490 491
      }
    }
492

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

498 499 500
    /// If true, the mesh distributor is already initialized;
    bool initialized;

501 502 503 504
    /// The rank of the current process.
    int mpiRank;

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

507
    /// Set of all different FE spaces.
508
    std::vector<const FiniteElemSpace*> feSpaces;
509
    
510 511 512
    /// 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.
513 514
    Mesh *mesh;

515 516 517
    /// 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.    
518 519
    RefinementManager *refineManager;

520 521
    /// Pointer to a mesh partitioner that is used to partition the mesh to 
    /// the ranks.
522
    MeshPartitioner *partitioner;
523

524 525 526 527 528 529
    /// 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;

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

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

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

542
    /// Defines the interior boundaries of the domain that result from 
543
    /// partitioning the whole mesh. 
544
    MultiLevelInteriorBoundary intBoundary;
545

546 547
    /// Dof communicator object
    MultiLevelDofComm dofComm;
548

549
    PeriodicMap periodicMap;
550

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

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

564 565
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;
566 567 568
    
    /// repartition the mesh (only) the first time repartitionMesh() is called
    bool repartitionOnlyOnce;
569

570
    /// Stores the number of mesh changes that must lie in between two 
571
    /// repartitionings.
572 573
    int repartitionIthChange;

574 575 576
    ///
    int repartitioningWaitAfterFail;

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

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

585 586 587 588 589
    /// 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;

590
    /// Directory name where all debug output files should be written to.
591
    std::string debugOutputDir;
592

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

597 598 599 600
    /// 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.
601
    std::map<int, std::vector<int> > macroElementNeighbours;
602

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

Thomas Witkowski's avatar
Thomas Witkowski committed
607 608
    Flag createBoundaryDofFlag;

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

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

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

623 624 625 626 627
    /// 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;

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

Thomas Witkowski's avatar
Thomas Witkowski committed
632 633 634
    /// If true, detailed timings for benchmarking are printed.
    bool printTimings;

635 636 637
    /// If true, detailed information about memory usage are printed.
    bool printMemoryUsage;

Thomas Witkowski's avatar
Thomas Witkowski committed
638
  public:
639 640 641
    /// 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
642 643
    static const Flag BOUNDARY_SUBOBJ_SORTED;

644 645 646 647 648 649 650 651 652
    /// 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
653

654 655
    static MeshDistributor *globalMeshDistributor;

656
    friend class ParallelDebug;
657
  };
658
} }
659

660
#endif // AMDIS_MESHDISTRIBUTOR_H