Liebe Gitlab-Nutzer, lieber Gitlab-Nutzer, es ist nun möglich sich mittels des ZIH-Logins/LDAP an unserem Dienst anzumelden. Die Konto der externen Nutzer:innen sind über den Reiter "Standard" erreichbar. Die Administratoren

Dear Gitlab user, it is now possible to log in to our service using the ZIH login/LDAP. The accounts of external users can be accessed via the "Standard" tab. The administrators

MeshDistributor.h 22.4 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 59

  struct DofData
  {
60 61 62
    /// Maps all DOFs in ranks partition to a bool value. If it is true, the DOF 
    /// is owned by the rank. Otherwise, its an interior boundary DOF that is 
    /// owned by another rank.
63 64
    DofIndexToBool isRankDof;
  };
65 66


67
  class MeshDistributor
68
  {
69
  private:
70
    MeshDistributor();
71
	          
72
    virtual ~MeshDistributor() {}
73

74
  public:
75
    void initParallelization();
76

77
    void exitParallelization();
78

79 80 81
    /// Adds a DOFVector to the set of \ref interchangeVecs. Thus, this vector 
    /// will be automatically interchanged between ranks when mesh is 
    /// repartitioned.
82 83 84 85 86
    void addInterchangeVector(DOFVector<double> *vec)
    {
      interchangeVectors.push_back(vec);
    }

87 88 89 90 91 92 93
    /// 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));
    }
    
94
    /** \brief
95 96 97 98 99
     * 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.
100
     *
101 102 103 104 105
     * \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.
106
     */
107
    void checkMeshChange(bool tryRepartition = true);
108

109 110 111 112 113 114 115 116 117 118
    /** \brief
     * Checks if is required to repartition the mesh. If this is the case, a new
     * partition will be created and the mesh will be redistributed between the
     * ranks.
     */
    void repartitionMesh();
    
    /// Calculates the imbalancing factor and prints it to screen.
    void printImbalanceFactor();

119
    /** \brief
120 121 122 123
     * 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.
124 125
     */
    void testForMacroMesh();
126

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

131
    inline virtual string getName() 
132 133 134
    { 
      return name; 
    }
135

Thomas Witkowski's avatar
Thomas Witkowski committed
136 137 138 139 140
    inline Mesh* getMesh()
    {
      return mesh;
    }

141 142
    /// Returns an FE space from \ref feSpaces.
    inline const FiniteElemSpace* getFeSpace(unsigned int i = 0)
143
    {
144 145 146 147 148
      FUNCNAME("MeshDistributor::getFeSpace()");

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

      return feSpaces[i];
149
    }
150 151 152 153 154 155 156

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

157 158
    /// Returns the number of DOFs in rank's domain for a given FE space.
    inline int getNumberRankDofs(const FiniteElemSpace *feSpace) 
159
    {
160
      return dofMap[feSpace].nRankDofs;
161
    }
162

163 164 165 166 167 168
    /// Returns the number of DOFs in rank's domain for a set of FE spaces.
    inline int getNumberRankDofs(vector<const FiniteElemSpace*>& feSpaces)
    {
      FUNCNAME("MeshDistributor::getNumberRankDofs()");

      int result = 0;
169 170
      for (unsigned int i = 0; i < feSpaces.size(); i++)
	result += dofMap[feSpaces[i]].nRankDofs;
171 172 173

      return result;
    }
174

175
    /// Returns the first global DOF index of an FE space, owned by rank.
176
    inline int getStartDofs(const FiniteElemSpace *feSpace)
177
    {
178
      return dofMap[feSpace].rStartDofs;
179 180
    }

181 182 183 184 185 186
    /// Returns the first global DOF index for a set of FE spaces, owned by rank.
    inline int getStartDofs(vector<const FiniteElemSpace*>& feSpaces)
    {
      FUNCNAME("MeshDistributor::getStartDofs()");

      int result = 0;
187 188
      for (unsigned int i = 0; i < feSpaces.size(); i++)
	result += dofMap[feSpaces[i]].rStartDofs;
189 190 191 192

      return result;
    }

193 194
    ///  Returns the global number of DOFs for a given FE space.
    inline int getNumberOverallDofs(const FiniteElemSpace *feSpace)
195
    {
196
      return dofMap[feSpace].nOverallDofs;
197
    }
198

199 200 201 202 203 204
    /// Returns the global number of DOFs for a set of FE spaces.
    inline int getNumberOverallDofs(vector<const FiniteElemSpace*>& feSpaces)
    {
      FUNCNAME("MeshDistributor::getNumberOverallDofs()");

      int result = 0;
205 206
      for (unsigned int i = 0; i < feSpaces.size(); i++)
	result += dofMap[feSpaces[i]].nOverallDofs;
207 208 209 210

      return result;
    }

211
    inline map<DegreeOfFreedom, MultiIndex>& getMapDofToGlobal(const FiniteElemSpace *feSpace)
Thomas Witkowski's avatar
Thomas Witkowski committed
212
    {
213
      return dofMap[feSpace].getMap();
Thomas Witkowski's avatar
Thomas Witkowski committed
214 215
    }

216
    /// Maps a local DOF to its global index.
217 218
    inline DegreeOfFreedom mapDofToGlobal(const FiniteElemSpace *feSpace,
					  DegreeOfFreedom dof)
219
    {
220
      return dofMap[feSpace][dof].global;
221
    }
222

223 224 225 226
    /// Returns for a global index the DOF index in rank's subdomain. As there
    /// is no direct data structure that stores this information, we have to
    /// search for it in \ref dofFeData.mapDofToGlobal. This is not very
    /// efficient and this function should thus be used for debugging only.
227 228
    DegreeOfFreedom mapGlobalToLocal(const FiniteElemSpace *feSpace,
				     DegreeOfFreedom dof);
229

230 231
    /// Returns the periodic mapping handler, \ref periodicMap.
    inline PeriodicMap& getPeriodicMap()
Thomas Witkowski's avatar
Thomas Witkowski committed
232
    {
233
      return periodicMap;
234 235
    }

236
    DofComm& getSendDofs()
237 238 239 240
    {
      return sendDofs;
    }

241
    DofComm& getRecvDofs()
242 243 244 245
    {
      return recvDofs;
    }

246 247 248 249 250
    DofComm& getPeriodicDofs()
    {
      return periodicDofs;
    }

251 252
    /// Return true, if the given DOF is owned by the rank. If false, the DOF
    /// is in rank's partition, but is owned by some other rank.
253
    inline bool getIsRankDof(const FiniteElemSpace *feSpace, DegreeOfFreedom dof)
254
    {
255 256
      if (dofFeData[feSpace].isRankDof.count(dof))
	return dofFeData[feSpace].isRankDof[dof];
257 258

      return false;
259
    }
260

261
    inline DofIndexToBool& getIsRankDof(const FiniteElemSpace *feSpace)
262
    {
263
      return dofFeData[feSpace].isRankDof;
264 265
    }

266
    inline long getLastMeshChangeIndex()
267
    {
268
      return lastMeshChangeIndex;
269
    }
270

271
    inline int getMpiRank()
272
    {
273
      return mpiRank;
274
    }
275

Thomas Witkowski's avatar
Thomas Witkowski committed
276 277 278 279 280
    inline int getMpiSize()
    {
      return mpiSize;
    }

281 282 283
    inline MPI::Intracomm& getMpiComm()
    {
      return mpiComm;
284 285
    }

286 287 288 289 290
    inline bool isInitialized()
    {
      return initialized;
    }

291
    // Writes all data of this object to an output stream.
292
    void serialize(ostream &out);
293

294
    // Reads the object data from an input stream.
295
    void deserialize(istream &in);
296 297

    /** \brief
298 299 300 301
     * 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.
302
     *
303 304 305
     * 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.
306
     */    
307 308 309 310 311
    template<typename T>
    void synchVector(DOFVector<T> &vec) 
    {
      StdMpi<vector<T> > stdMpi(mpiComm);

312 313
      const FiniteElemSpace *fe = vec.getFeSpace();

314
      for (DofComm::Iterator it(sendDofs, fe); !it.end(); it.nextRank()) {
315
	vector<T> dofs;
316
	dofs.reserve(it.getDofs().size());
317
	
318 319
	for (; !it.endDofIter(); it.nextDof())
	  dofs.push_back(vec[it.getDofIndex()]);
320
	
321
	stdMpi.send(it.getRank(), dofs);
322
      }
323 324 325 326
	     
      for (DofComm::Iterator it(recvDofs); !it.end(); it.nextRank())
        stdMpi.recv(it.getRank());
	     
327
      stdMpi.startCommunication();
328 329 330 331 332

      for (DofComm::Iterator it(recvDofs, fe); !it.end(); it.nextRank())
	for (; !it.endDofIter(); it.nextDof())
	  vec[it.getDofIndex()] = 
	     stdMpi.getRecvData(it.getRank())[it.getDofCounter()];
333 334
    }
    
335
    /** \brief
336 337 338
     * 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.
339 340 341
     */
    void synchVector(SystemVector &vec);

342 343
    void check3dValidMesh();

Thomas Witkowski's avatar
Thomas Witkowski committed
344 345 346 347 348
    void setBoundaryDofRequirement(Flag flag)
    {
      createBoundaryDofFlag = flag;
    }

349 350
    BoundaryDofInfo& getBoundaryDofInfo(const FiniteElemSpace *feSpace, 
					int level = 0)
351
    {
352 353 354 355 356 357 358
      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];
359 360
    }

361 362
    void getAllBoundaryDofs(const FiniteElemSpace *feSpace, 
			    int level,
363
			    DofContainer& dofs);
364

365 366 367 368
    const ElementObjectDatabase& getElementObjectDb() 
    {
      return elObjDb;
    }
369 370 371

    /// Adds a stationary problem to the global mesh distributor objects.
    static void addProblemStatGlobal(ProblemStatSeq *probStat);
Thomas Witkowski's avatar
Thomas Witkowski committed
372 373 374 375 376 377

    MeshLevelData& getMeshLevelData() 
    {
      return levelData;
    }

378
  protected:
379 380
    void addProblemStat(ProblemStatSeq *probStat);

381 382
    /// Determines the interior boundaries, i.e. boundaries between ranks, and
    /// stores all information about them in \ref interiorBoundary.
383
    void createInteriorBoundaryInfo();
384

Thomas Witkowski's avatar
Thomas Witkowski committed
385 386 387 388 389
    void updateInteriorBoundaryInfo();

    void createMeshElementData();

    void createBoundaryData();
Thomas Witkowski's avatar
Thomas Witkowski committed
390

Thomas Witkowski's avatar
Thomas Witkowski committed
391 392
    void createBoundaryDofs();

393
    void createBoundaryDofs(const FiniteElemSpace *feSpace, int level);
394

395 396
    /// Removes all macro elements from the mesh that are not part of ranks 
    /// partition.
397 398
    void removeMacroElements();

399 400
    void updateLocalGlobalNumbering();

401 402
    /// Updates the local and global DOF numbering after the mesh has been 
    /// changed.
403
    void updateLocalGlobalNumbering(const FiniteElemSpace *feSpace);
404

405 406 407 408
    /// Calls \ref createPeriodicMap(feSpace) for all FE spaces that are
    /// handled by the mesh distributor.
    void createPeriodicMap();

409
    /** \brief
410 411 412 413
     * 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.
     */    
414
    void createPeriodicMap(const FiniteElemSpace *feSpace);
415

416 417 418 419 420 421 422 423
    /** \brief
     * 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.
     */
424 425
    void createMacroElementInfo();

426 427
    void updateMacroElementInfo();

428
    /** \brief
429 430 431 432 433 434
     * 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.
435
     *
436 437
     * \param[in] allBound   Defines a map from rank to interior boundaries 
     *                       which should be checked.
438
     *
439 440 441
     * \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.
442 443
     */
    bool checkAndAdaptBoundary(RankToBoundMap &allBound);
444
  
445 446
    /// Sets \ref isRankDof to all matrices and rhs vectors in a given 
    /// stationary problem.
447
    void setRankDofs(ProblemStatSeq *probStat);
448

449 450
    /// Sets \ref isRankDof to all matrices and rhs vectors in all 
    /// stationary problems.
451 452
    void setRankDofs();

453 454 455 456
    /// Removes all periodic boundary condition information from all matrices and
    /// vectors of all stationary problems and from the mesh itself.
    void removePeriodicBoundaryConditions();

457 458 459 460
    /// 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
461
    // Removes all periodic boundaries from a given boundary map.
462
    void removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
463

464 465
    void createMeshLevelStructure();

466
    /// Writes a vector of dof pointers to an output stream.
467
    void serialize(ostream &out, DofContainer &data);
468

469 470 471 472
    /// Writes a \ref RankToDofContainer to an output stream.
    void serialize(ostream &out, 
		   map<int, map<const FiniteElemSpace*, DofContainer> > &data);

473
    /// Reads a vector of dof pointers from an input stream.
474
    void deserialize(istream &in, DofContainer &data,
475
		     map<int, const DegreeOfFreedom*> &dofIndexMap);
476 477

    /// Reads a \ref RankToDofContainer from an input stream.
478 479
    void deserialize(istream &in, 
		     map<int, map<const FiniteElemSpace*, DofContainer> > &data,
480
		     map<const FiniteElemSpace*, map<int, const DegreeOfFreedom*> > &dofIndexMap);
481 482 483

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

488
      int mapSize = data.size();
489
      SerUtil::serialize(out, mapSize);
490
      for (typename map<const DegreeOfFreedom*, T>::iterator it = data.begin();
491 492 493
	   it != data.end(); ++it) {
	int v1 = (*(it->first));
	T v2 = it->second;
494 495
	SerUtil::serialize(out, v1);
	SerUtil::serialize(out, v2);
496 497 498 499 500
      }
    }

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

506
      int mapSize = 0;
507
      SerUtil::deserialize(in, mapSize);
508 509 510
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
511 512
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
513

514 515
	TEST_EXIT_DBG(dofIndexMap.count(v1) != 0)
	  ("Cannot find DOF %d in map!\n", v1);
516

517
	data[dofIndexMap[v1]] = v2;
518 519
      }
    }
520

521
  protected:
522 523
    /// List of all stationary problems that are managed by this mesh 
    /// distributor.
524
    vector<ProblemStatSeq*> problemStat;
Thomas Witkowski's avatar
Thomas Witkowski committed
525

526 527 528
    /// If true, the mesh distributor is already initialized;
    bool initialized;

529 530 531 532 533 534
    /// The rank of the current process.
    int mpiRank;

    /// Overall number of processes.
    int mpiSize;

535 536
    /// MPI communicator collected all processes, which should be used for
    /// calculation. The Debug procces is not included in this communicator.
537 538 539
    MPI::Intracomm mpiComm;

    /// Name of the problem (as used in the init files)
540
    string name;
541

542 543
    /// Finite element spaces of the problem.
    vector<const FiniteElemSpace*> feSpaces;
544

545 546 547
    /// Mesh of the problem.
    Mesh *mesh;

548 549 550
    /// 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.    
551 552
    RefinementManager *refineManager;

553 554 555
    /// Info level.
    int info;

556 557
    /// Pointer to a mesh partitioner that is used to partition the mesh to 
    /// the ranks.
558
    MeshPartitioner *partitioner;
559

560 561
    /// Weights for the elements, i.e., the number of leaf elements within 
    /// this element.
562
    map<int, double> elemWeights;
563

564 565
    /// Stores to every macro element index the number of the rank that owns this
    /// macro element.
566
    map<int, int> partitionMap;
567

568
    map<const FiniteElemSpace*, DofData> dofFeData;
569

570 571
    ParallelDofMapping dofMap;

572
    /// Database to store and query all sub-objects of all elements of the 
573
    /// macro mesh.
574
    ElementObjectDatabase elObjDb;
Thomas Witkowski's avatar
Thomas Witkowski committed
575

576
    /// Maps to each macro element index a pointer to the corresponding element.
577
    map<int, Element*> macroElIndexMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
578
    
579
    /// Maps to each macro element index the type of this element.
580
    map<int, int> macroElIndexTypeMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
581

582 583 584 585
    /// Defines the interior boundaries of the domain that result from 
    /// partitioning the whole mesh. Contains only the boundaries, which are 
    /// owned by the rank, i.e., the object gives for every neighbour rank i 
    /// the boundaries this rank owns and shares with rank i.
586
    InteriorBoundary rankIntBoundary;
Thomas Witkowski's avatar
Thomas Witkowski committed
587
    
588 589 590 591
    /// Defines the interior boundaries of the domain that result from 
    /// partitioning the whole mesh. Contains only the boundaries, which are 
    /// not owned by the rank, i.e., the object gives for every neighbour rank 
    /// i the boundaries that are owned by rank i and are shared with this rank.
Thomas Witkowski's avatar
Thomas Witkowski committed
592
    InteriorBoundary otherIntBoundary;
Thomas Witkowski's avatar
Thomas Witkowski committed
593

594 595
    /// Defines the periodic boundaries with other ranks. Periodic boundaries
    /// have no owner, as it is the case of interior boundaries.
596 597
    InteriorBoundary periodicBoundary;

598 599
    /// This map contains for each rank the list of DOFs the current rank must 
    /// end to exchange solution DOFs at the interior boundaries.
600
    DofComm sendDofs;
601

602 603 604
    /// This map contains on each rank the list of DOFs from which the current 
    /// rank will receive DOF values (i.e., this are all DOFs at an interior 
    /// boundary). The DOF indices are given in rank's local numbering.
605
    DofComm recvDofs;
606

607 608 609 610
    /// This map contains on each rank a list of DOFs along the interior bound-
    /// aries to communicate with other ranks. The DOF indices are given in rank's
    /// local numbering. Periodic boundaries within one subdomain are not 
    /// considered here. 
611 612
    DofComm periodicDofs;

613
    PeriodicMap periodicMap;
614

615 616 617 618
    /// This set of values must be interchanged between ranks when the mesh is 
    /// repartitioned.
    vector<DOFVector<double>*> interchangeVectors;
		        
619 620 621 622
    /// 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.
623
    bool deserialized;
624

625 626 627
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

628 629 630
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;

631 632
    /// Stores the number of mesh changes that must lie in between to 
    /// repartitionings.
633 634
    int repartitionIthChange;

635 636
    /// Counts the number of mesh changes after the last mesh repartitioning 
    /// was done.
637
    int nMeshChangesAfterLastRepartitioning;
638

639 640 641
    /// Countes the number of mesh repartitions that were done. Till now, this 
    /// variable is used only for debug outputs.
    int repartitioningCounter;
642

643
    /// Directory name where all debug output files should be written to.
644
    string debugOutputDir;
645

646 647
    /// Stores the mesh change index. This is used to recognize changes in the
    /// mesh structure (e.g. through refinement or coarsening managers).
648
    long lastMeshChangeIndex;
649

650 651 652 653
    /// 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.
654
    map<int, vector<int> > macroElementNeighbours;
655

656 657
    /// Store all macro elements of the overall mesh, i.e., before the
    /// mesh is redistributed for the first time.
658
    vector<MacroElement*> allMacroElements;
659

Thomas Witkowski's avatar
Thomas Witkowski committed
660 661
    Flag createBoundaryDofFlag;

662 663 664
    /// Stores on each mesh level for all FE spaces the information about
    /// all boundary DOFs.
    vector<map<const FiniteElemSpace*, BoundaryDofInfo> > boundaryDofInfo;
665

666 667
    MeshLevelData levelData;

Thomas Witkowski's avatar
Thomas Witkowski committed
668
  public:
669 670
    bool sebastianMode;

671 672 673
    /// 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
674 675
    static const Flag BOUNDARY_SUBOBJ_SORTED;

676 677 678 679 680 681 682 683 684
    /// 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
685

686 687
    static MeshDistributor *globalMeshDistributor;

688
    friend class ParallelDebug;
689 690 691
  };
}

692
#endif // AMDIS_MESHDISTRIBUTOR_H