Liebe Gitlab-Nutzer, lieber Gitlab-Nutzer, es ist nun möglich sich mittels des ZIH-Logins/LDAP an unserem Dienst anzumelden. Ein Anmelden über dieses erzeugt ein neues Konto. Das alte Konto ist ü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. Logging in via this will create a new account. The old account can be accessed via the "Standard" tab. The administrators

MeshDistributor.h 22.1 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
    virtual ~MeshDistributor() {}
64

65
  public:
66
    void initParallelization();
67

68
    void exitParallelization();
69

70 71 72
    /// Adds a DOFVector to the set of \ref interchangeVecs. Thus, this vector 
    /// will be automatically interchanged between ranks when mesh is 
    /// repartitioned.
73 74 75 76 77
    void addInterchangeVector(DOFVector<double> *vec)
    {
      interchangeVectors.push_back(vec);
    }

78 79 80 81 82 83 84
    /// 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));
    }
    
85
    /** \brief
86 87 88 89 90
     * 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.
91
     *
92 93 94 95 96
     * \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.
97
     */
98
    void checkMeshChange(bool tryRepartition = true);
99

100 101 102 103 104 105 106 107 108 109
    /** \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();

110
    /** \brief
111 112 113 114
     * 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.
115 116
     */
    void testForMacroMesh();
117

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

122
    inline virtual string getName() 
123 124 125
    { 
      return name; 
    }
126

Thomas Witkowski's avatar
Thomas Witkowski committed
127 128 129 130 131
    inline Mesh* getMesh()
    {
      return mesh;
    }

132 133
    /// Returns an FE space from \ref feSpaces.
    inline const FiniteElemSpace* getFeSpace(unsigned int i = 0)
134
    {
135 136 137 138 139
      FUNCNAME("MeshDistributor::getFeSpace()");

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

      return feSpaces[i];
140
    }
141 142 143 144 145 146 147

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

148 149
    /// Returns the number of DOFs in rank's domain for a given FE space.
    inline int getNumberRankDofs(const FiniteElemSpace *feSpace) 
150
    {
151
      return dofMap[feSpace].nRankDofs;
152
    }
153

154 155 156 157 158 159
    /// 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;
160 161
      for (unsigned int i = 0; i < feSpaces.size(); i++)
	result += dofMap[feSpaces[i]].nRankDofs;
162 163 164

      return result;
    }
165

166
    /// Returns the first global DOF index of an FE space, owned by rank.
167
    inline int getStartDofs(const FiniteElemSpace *feSpace)
168
    {
169
      return dofMap[feSpace].rStartDofs;
170 171
    }

172 173 174 175 176 177
    /// 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;
178 179
      for (unsigned int i = 0; i < feSpaces.size(); i++)
	result += dofMap[feSpaces[i]].rStartDofs;
180 181 182 183

      return result;
    }

184 185
    ///  Returns the global number of DOFs for a given FE space.
    inline int getNumberOverallDofs(const FiniteElemSpace *feSpace)
186
    {
187
      return dofMap[feSpace].nOverallDofs;
188
    }
189

190 191 192 193 194 195
    /// 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;
196 197
      for (unsigned int i = 0; i < feSpaces.size(); i++)
	result += dofMap[feSpaces[i]].nOverallDofs;
198 199 200 201

      return result;
    }

202
    inline map<DegreeOfFreedom, MultiIndex>& getMapDofToGlobal(const FiniteElemSpace *feSpace)
Thomas Witkowski's avatar
Thomas Witkowski committed
203
    {
204
      return dofMap[feSpace].getMap();
Thomas Witkowski's avatar
Thomas Witkowski committed
205 206
    }

207
    /// Maps a local DOF to its global index.
208 209
    inline DegreeOfFreedom mapDofToGlobal(const FiniteElemSpace *feSpace,
					  DegreeOfFreedom dof)
210
    {
211
      return dofMap[feSpace][dof].global;
212
    }
213

214 215
    /// 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
Thomas Witkowski's avatar
Thomas Witkowski committed
216 217
    /// search for it in \ref dofMap. This is not very efficient and this 
    /// function should thus be used for debugging only.
218 219
    DegreeOfFreedom mapGlobalToLocal(const FiniteElemSpace *feSpace,
				     DegreeOfFreedom dof);
220

Thomas Witkowski's avatar
Thomas Witkowski committed
221 222 223 224 225 226 227
    /// Maps a local DOF to its local index.
    inline DegreeOfFreedom mapLocalToDof(const FiniteElemSpace *feSpace,
					 DegreeOfFreedom dof)
    {
      return dofMap[feSpace][dof].local;
    }

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

234
    DofComm& getSendDofs()
235 236 237 238
    {
      return sendDofs;
    }

239
    DofComm& getRecvDofs()
240 241 242 243
    {
      return recvDofs;
    }

244 245 246 247 248
    DofComm& getPeriodicDofs()
    {
      return periodicDofs;
    }

249 250
    /// 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.
251
    inline bool getIsRankDof(const FiniteElemSpace *feSpace, DegreeOfFreedom dof)
252
    {
Thomas Witkowski's avatar
Thomas Witkowski committed
253
      return dofMap[feSpace].isRankDof(dof);
254 255
    }

256
    inline long getLastMeshChangeIndex()
257
    {
258
      return lastMeshChangeIndex;
259
    }
260

261
    inline int getMpiRank()
262
    {
263
      return mpiRank;
264
    }
265

Thomas Witkowski's avatar
Thomas Witkowski committed
266 267 268 269 270
    inline int getMpiSize()
    {
      return mpiSize;
    }

271 272 273
    inline MPI::Intracomm& getMpiComm()
    {
      return mpiComm;
274 275
    }

276 277 278 279 280
    inline bool isInitialized()
    {
      return initialized;
    }

281
    // Writes all data of this object to an output stream.
282
    void serialize(ostream &out);
283

284
    // Reads the object data from an input stream.
285
    void deserialize(istream &in);
286 287

    /** \brief
288 289 290 291
     * 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.
292
     *
293 294 295
     * 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.
296
     */    
297 298 299 300 301
    template<typename T>
    void synchVector(DOFVector<T> &vec) 
    {
      StdMpi<vector<T> > stdMpi(mpiComm);

302 303
      const FiniteElemSpace *fe = vec.getFeSpace();

304
      for (DofComm::Iterator it(sendDofs, fe); !it.end(); it.nextRank()) {
305
	vector<T> dofs;
306
	dofs.reserve(it.getDofs().size());
307
	
308 309
	for (; !it.endDofIter(); it.nextDof())
	  dofs.push_back(vec[it.getDofIndex()]);
310
	
311
	stdMpi.send(it.getRank(), dofs);
312
      }
313 314 315 316
	     
      for (DofComm::Iterator it(recvDofs); !it.end(); it.nextRank())
        stdMpi.recv(it.getRank());
	     
317
      stdMpi.startCommunication();
318 319 320 321 322

      for (DofComm::Iterator it(recvDofs, fe); !it.end(); it.nextRank())
	for (; !it.endDofIter(); it.nextDof())
	  vec[it.getDofIndex()] = 
	     stdMpi.getRecvData(it.getRank())[it.getDofCounter()];
323 324
    }
    
325
    /** \brief
326 327 328
     * 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.
329 330 331
     */
    void synchVector(SystemVector &vec);

332 333
    void check3dValidMesh();

Thomas Witkowski's avatar
Thomas Witkowski committed
334 335 336 337 338
    void setBoundaryDofRequirement(Flag flag)
    {
      createBoundaryDofFlag = flag;
    }

339 340
    BoundaryDofInfo& getBoundaryDofInfo(const FiniteElemSpace *feSpace, 
					int level = 0)
341
    {
342 343 344 345 346 347 348
      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];
349 350
    }

351 352
    void getAllBoundaryDofs(const FiniteElemSpace *feSpace, 
			    int level,
353
			    DofContainer& dofs);
354

355 356 357 358
    const ElementObjectDatabase& getElementObjectDb() 
    {
      return elObjDb;
    }
359 360 361

    /// Adds a stationary problem to the global mesh distributor objects.
    static void addProblemStatGlobal(ProblemStatSeq *probStat);
Thomas Witkowski's avatar
Thomas Witkowski committed
362 363 364 365 366 367

    MeshLevelData& getMeshLevelData() 
    {
      return levelData;
    }

368
  protected:
369 370
    void addProblemStat(ProblemStatSeq *probStat);

371 372
    /// Determines the interior boundaries, i.e. boundaries between ranks, and
    /// stores all information about them in \ref interiorBoundary.
373
    void createInteriorBoundaryInfo();
374

Thomas Witkowski's avatar
Thomas Witkowski committed
375 376 377 378 379
    void updateInteriorBoundaryInfo();

    void createMeshElementData();

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

Thomas Witkowski's avatar
Thomas Witkowski committed
381 382
    void createBoundaryDofs();

383
    void createBoundaryDofs(const FiniteElemSpace *feSpace, int level);
384

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

389 390
    void updateLocalGlobalNumbering();

391 392
    /// Updates the local and global DOF numbering after the mesh has been 
    /// changed.
393
    void updateLocalGlobalNumbering(const FiniteElemSpace *feSpace);
394

395 396 397 398
    /// Calls \ref createPeriodicMap(feSpace) for all FE spaces that are
    /// handled by the mesh distributor.
    void createPeriodicMap();

399
    /** \brief
400 401 402 403
     * 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.
     */    
404
    void createPeriodicMap(const FiniteElemSpace *feSpace);
405

406 407 408 409 410 411 412 413
    /** \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.
     */
414 415
    void createMacroElementInfo();

416 417
    void updateMacroElementInfo();

418
    /** \brief
419 420 421 422 423 424
     * 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.
425
     *
426 427
     * \param[in] allBound   Defines a map from rank to interior boundaries 
     *                       which should be checked.
428
     *
429 430 431
     * \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.
432 433
     */
    bool checkAndAdaptBoundary(RankToBoundMap &allBound);
434
  
435 436
    /// Sets \ref isRankDof to all matrices and rhs vectors in a given 
    /// stationary problem.
437
    void setRankDofs(ProblemStatSeq *probStat);
438

439 440
    /// Sets \ref isRankDof to all matrices and rhs vectors in all 
    /// stationary problems.
441 442
    void setRankDofs();

443 444 445 446
    /// Removes all periodic boundary condition information from all matrices and
    /// vectors of all stationary problems and from the mesh itself.
    void removePeriodicBoundaryConditions();

447 448 449 450
    /// 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
451
    // Removes all periodic boundaries from a given boundary map.
452
    void removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
453

454 455
    void createMeshLevelStructure();

456
    /// Writes a vector of dof pointers to an output stream.
457
    void serialize(ostream &out, DofContainer &data);
458

459 460 461 462
    /// Writes a \ref RankToDofContainer to an output stream.
    void serialize(ostream &out, 
		   map<int, map<const FiniteElemSpace*, DofContainer> > &data);

463
    /// Reads a vector of dof pointers from an input stream.
464
    void deserialize(istream &in, DofContainer &data,
465
		     map<int, const DegreeOfFreedom*> &dofIndexMap);
466 467

    /// Reads a \ref RankToDofContainer from an input stream.
468 469
    void deserialize(istream &in, 
		     map<int, map<const FiniteElemSpace*, DofContainer> > &data,
470
		     map<const FiniteElemSpace*, map<int, const DegreeOfFreedom*> > &dofIndexMap);
471 472 473

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

478
      int mapSize = data.size();
479
      SerUtil::serialize(out, mapSize);
480
      for (typename map<const DegreeOfFreedom*, T>::iterator it = data.begin();
481 482 483
	   it != data.end(); ++it) {
	int v1 = (*(it->first));
	T v2 = it->second;
484 485
	SerUtil::serialize(out, v1);
	SerUtil::serialize(out, v2);
486 487 488 489 490
      }
    }

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

496
      int mapSize = 0;
497
      SerUtil::deserialize(in, mapSize);
498 499 500
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
501 502
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
503

504 505
	TEST_EXIT_DBG(dofIndexMap.count(v1) != 0)
	  ("Cannot find DOF %d in map!\n", v1);
506

507
	data[dofIndexMap[v1]] = v2;
508 509
      }
    }
510

511
  protected:
512 513
    /// List of all stationary problems that are managed by this mesh 
    /// distributor.
514
    vector<ProblemStatSeq*> problemStat;
Thomas Witkowski's avatar
Thomas Witkowski committed
515

516 517 518
    /// If true, the mesh distributor is already initialized;
    bool initialized;

519 520 521 522 523 524
    /// The rank of the current process.
    int mpiRank;

    /// Overall number of processes.
    int mpiSize;

525 526
    /// MPI communicator collected all processes, which should be used for
    /// calculation. The Debug procces is not included in this communicator.
527 528 529
    MPI::Intracomm mpiComm;

    /// Name of the problem (as used in the init files)
530
    string name;
531

532 533
    /// Finite element spaces of the problem.
    vector<const FiniteElemSpace*> feSpaces;
534

535 536 537
    /// Mesh of the problem.
    Mesh *mesh;

538 539 540
    /// 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.    
541 542
    RefinementManager *refineManager;

543 544 545
    /// Info level.
    int info;

546 547
    /// Pointer to a mesh partitioner that is used to partition the mesh to 
    /// the ranks.
548
    MeshPartitioner *partitioner;
549

550 551
    /// Weights for the elements, i.e., the number of leaf elements within 
    /// this element.
552
    map<int, double> elemWeights;
553

554 555
    /// Stores to every macro element index the number of the rank that owns this
    /// macro element.
556
    map<int, int> partitionMap;
557

558 559
    ParallelDofMapping dofMap;

560
    /// Database to store and query all sub-objects of all elements of the 
561
    /// macro mesh.
562
    ElementObjectDatabase elObjDb;
Thomas Witkowski's avatar
Thomas Witkowski committed
563

564
    /// Maps to each macro element index a pointer to the corresponding element.
565
    map<int, Element*> macroElIndexMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
566
    
567
    /// Maps to each macro element index the type of this element.
568
    map<int, int> macroElIndexTypeMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
569

570 571 572 573
    /// 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.
574
    InteriorBoundary rankIntBoundary;
Thomas Witkowski's avatar
Thomas Witkowski committed
575
    
576 577 578 579
    /// 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
580
    InteriorBoundary otherIntBoundary;
Thomas Witkowski's avatar
Thomas Witkowski committed
581

582 583
    /// Defines the periodic boundaries with other ranks. Periodic boundaries
    /// have no owner, as it is the case of interior boundaries.
584 585
    InteriorBoundary periodicBoundary;

586 587
    /// This map contains for each rank the list of DOFs the current rank must 
    /// end to exchange solution DOFs at the interior boundaries.
588
    DofComm sendDofs;
589

590 591 592
    /// 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.
593
    DofComm recvDofs;
594

595 596 597 598
    /// 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. 
599 600
    DofComm periodicDofs;

601
    PeriodicMap periodicMap;
602

603 604 605 606
    /// This set of values must be interchanged between ranks when the mesh is 
    /// repartitioned.
    vector<DOFVector<double>*> interchangeVectors;
		        
607 608 609 610
    /// 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.
611
    bool deserialized;
612

613 614 615
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

616 617 618
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;

619 620
    /// Stores the number of mesh changes that must lie in between to 
    /// repartitionings.
621 622
    int repartitionIthChange;

623 624
    /// Counts the number of mesh changes after the last mesh repartitioning 
    /// was done.
625
    int nMeshChangesAfterLastRepartitioning;
626

627 628 629
    /// Countes the number of mesh repartitions that were done. Till now, this 
    /// variable is used only for debug outputs.
    int repartitioningCounter;
630

631
    /// Directory name where all debug output files should be written to.
632
    string debugOutputDir;
633

634 635
    /// Stores the mesh change index. This is used to recognize changes in the
    /// mesh structure (e.g. through refinement or coarsening managers).
636
    long lastMeshChangeIndex;
637

638 639 640 641
    /// 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.
642
    map<int, vector<int> > macroElementNeighbours;
643

644 645
    /// Store all macro elements of the overall mesh, i.e., before the
    /// mesh is redistributed for the first time.
646
    vector<MacroElement*> allMacroElements;
647

Thomas Witkowski's avatar
Thomas Witkowski committed
648 649
    Flag createBoundaryDofFlag;

650 651 652
    /// Stores on each mesh level for all FE spaces the information about
    /// all boundary DOFs.
    vector<map<const FiniteElemSpace*, BoundaryDofInfo> > boundaryDofInfo;
653

654 655
    MeshLevelData levelData;

Thomas Witkowski's avatar
Thomas Witkowski committed
656
  public:
657 658
    bool sebastianMode;

659 660 661
    /// 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
662 663
    static const Flag BOUNDARY_SUBOBJ_SORTED;

664 665 666 667 668 669 670 671 672
    /// 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
673

674 675
    static MeshDistributor *globalMeshDistributor;

676
    friend class ParallelDebug;
677 678 679
  };
}

680
#endif // AMDIS_MESHDISTRIBUTOR_H