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.3 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 230 231 232 233
    /// Returns the DOF mapping object, \ref dofMap.
    inline ParallelDofMapping& getDofMap()
    {
      return dofMap;
    }

234 235
    /// Returns the periodic mapping handler, \ref periodicMap.
    inline PeriodicMap& getPeriodicMap()
Thomas Witkowski's avatar
Thomas Witkowski committed
236
    {
237
      return periodicMap;
238 239
    }

240
    DofComm& getSendDofs()
241 242 243 244
    {
      return sendDofs;
    }

245
    DofComm& getRecvDofs()
246 247 248 249
    {
      return recvDofs;
    }

250 251 252 253 254
    DofComm& getPeriodicDofs()
    {
      return periodicDofs;
    }

255 256
    /// 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.
257
    inline bool getIsRankDof(const FiniteElemSpace *feSpace, DegreeOfFreedom dof)
258
    {
Thomas Witkowski's avatar
Thomas Witkowski committed
259
      return dofMap[feSpace].isRankDof(dof);
260 261
    }

262
    inline long getLastMeshChangeIndex()
263
    {
264
      return lastMeshChangeIndex;
265
    }
266

267
    inline int getMpiRank()
268
    {
269
      return mpiRank;
270
    }
271

Thomas Witkowski's avatar
Thomas Witkowski committed
272 273 274 275 276
    inline int getMpiSize()
    {
      return mpiSize;
    }

277 278 279
    inline MPI::Intracomm& getMpiComm()
    {
      return mpiComm;
280 281
    }

282 283 284 285 286
    inline bool isInitialized()
    {
      return initialized;
    }

287
    // Writes all data of this object to an output stream.
288
    void serialize(ostream &out);
289

290
    // Reads the object data from an input stream.
291
    void deserialize(istream &in);
292 293

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

308 309
      const FiniteElemSpace *fe = vec.getFeSpace();

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

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

338 339
    void check3dValidMesh();

Thomas Witkowski's avatar
Thomas Witkowski committed
340 341 342 343 344
    void setBoundaryDofRequirement(Flag flag)
    {
      createBoundaryDofFlag = flag;
    }

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

357 358
    void getAllBoundaryDofs(const FiniteElemSpace *feSpace, 
			    int level,
359
			    DofContainer& dofs);
360

361 362 363 364
    const ElementObjectDatabase& getElementObjectDb() 
    {
      return elObjDb;
    }
365 366 367

    /// Adds a stationary problem to the global mesh distributor objects.
    static void addProblemStatGlobal(ProblemStatSeq *probStat);
Thomas Witkowski's avatar
Thomas Witkowski committed
368 369 370 371 372 373

    MeshLevelData& getMeshLevelData() 
    {
      return levelData;
    }

374
  protected:
375 376
    void addProblemStat(ProblemStatSeq *probStat);

377 378
    /// Determines the interior boundaries, i.e. boundaries between ranks, and
    /// stores all information about them in \ref interiorBoundary.
379
    void createInteriorBoundaryInfo();
380

Thomas Witkowski's avatar
Thomas Witkowski committed
381 382 383 384 385
    void updateInteriorBoundaryInfo();

    void createMeshElementData();

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

Thomas Witkowski's avatar
Thomas Witkowski committed
387 388
    void createBoundaryDofs();

389
    void createBoundaryDofs(const FiniteElemSpace *feSpace, int level);
390

391 392
    /// Removes all macro elements from the mesh that are not part of ranks 
    /// partition.
393 394
    void removeMacroElements();

395 396
    void updateLocalGlobalNumbering();

397 398
    /// Updates the local and global DOF numbering after the mesh has been 
    /// changed.
399
    void updateLocalGlobalNumbering(const FiniteElemSpace *feSpace);
400

401 402 403 404
    /// Calls \ref createPeriodicMap(feSpace) for all FE spaces that are
    /// handled by the mesh distributor.
    void createPeriodicMap();

405
    /** \brief
406 407 408 409
     * 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.
     */    
410
    void createPeriodicMap(const FiniteElemSpace *feSpace);
411

412 413 414 415 416 417 418 419
    /** \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.
     */
420 421
    void createMacroElementInfo();

422 423
    void updateMacroElementInfo();

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

445 446
    /// Sets \ref isRankDof to all matrices and rhs vectors in all 
    /// stationary problems.
447 448
    void setRankDofs();

449 450 451 452
    /// Removes all periodic boundary condition information from all matrices and
    /// vectors of all stationary problems and from the mesh itself.
    void removePeriodicBoundaryConditions();

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

460 461
    void createMeshLevelStructure();

462
    /// Writes a vector of dof pointers to an output stream.
463
    void serialize(ostream &out, DofContainer &data);
464

465 466 467 468
    /// Writes a \ref RankToDofContainer to an output stream.
    void serialize(ostream &out, 
		   map<int, map<const FiniteElemSpace*, DofContainer> > &data);

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

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

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

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

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

502
      int mapSize = 0;
503
      SerUtil::deserialize(in, mapSize);
504 505 506
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
507 508
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
509

510 511
	TEST_EXIT_DBG(dofIndexMap.count(v1) != 0)
	  ("Cannot find DOF %d in map!\n", v1);
512

513
	data[dofIndexMap[v1]] = v2;
514 515
      }
    }
516

517
  protected:
518 519
    /// List of all stationary problems that are managed by this mesh 
    /// distributor.
520
    vector<ProblemStatSeq*> problemStat;
Thomas Witkowski's avatar
Thomas Witkowski committed
521

522 523 524
    /// If true, the mesh distributor is already initialized;
    bool initialized;

525 526 527 528 529 530
    /// The rank of the current process.
    int mpiRank;

    /// Overall number of processes.
    int mpiSize;

531 532
    /// MPI communicator collected all processes, which should be used for
    /// calculation. The Debug procces is not included in this communicator.
533 534 535
    MPI::Intracomm mpiComm;

    /// Name of the problem (as used in the init files)
536
    string name;
537

538 539
    /// Finite element spaces of the problem.
    vector<const FiniteElemSpace*> feSpaces;
540

541 542 543
    /// Mesh of the problem.
    Mesh *mesh;

544 545 546
    /// 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.    
547 548
    RefinementManager *refineManager;

549 550 551
    /// Info level.
    int info;

552 553
    /// Pointer to a mesh partitioner that is used to partition the mesh to 
    /// the ranks.
554
    MeshPartitioner *partitioner;
555

556 557
    /// Weights for the elements, i.e., the number of leaf elements within 
    /// this element.
558
    map<int, double> elemWeights;
559

560 561
    /// Stores to every macro element index the number of the rank that owns this
    /// macro element.
562
    map<int, int> partitionMap;
563

564
    /// Mapping object to map from local DOF indices to global ones.
565 566
    ParallelDofMapping dofMap;

567
    /// Database to store and query all sub-objects of all elements of the 
568
    /// macro mesh.
569
    ElementObjectDatabase elObjDb;
Thomas Witkowski's avatar
Thomas Witkowski committed
570

571
    /// Maps to each macro element index a pointer to the corresponding element.
572
    map<int, Element*> macroElIndexMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
573
    
574
    /// Maps to each macro element index the type of this element.
575
    map<int, int> macroElIndexTypeMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
576

577 578 579 580
    /// 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.
581
    InteriorBoundary rankIntBoundary;
Thomas Witkowski's avatar
Thomas Witkowski committed
582
    
583 584 585 586
    /// 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
587
    InteriorBoundary otherIntBoundary;
Thomas Witkowski's avatar
Thomas Witkowski committed
588

589 590
    /// Defines the periodic boundaries with other ranks. Periodic boundaries
    /// have no owner, as it is the case of interior boundaries.
591 592
    InteriorBoundary periodicBoundary;

593 594
    /// This map contains for each rank the list of DOFs the current rank must 
    /// end to exchange solution DOFs at the interior boundaries.
595
    DofComm sendDofs;
596

597 598 599
    /// 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.
600
    DofComm recvDofs;
601

602 603 604 605
    /// 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. 
606 607
    DofComm periodicDofs;

608
    PeriodicMap periodicMap;
609

610 611 612 613
    /// This set of values must be interchanged between ranks when the mesh is 
    /// repartitioned.
    vector<DOFVector<double>*> interchangeVectors;
		        
614 615 616 617
    /// 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.
618
    bool deserialized;
619

620 621 622
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

623 624 625
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;

626 627
    /// Stores the number of mesh changes that must lie in between to 
    /// repartitionings.
628 629
    int repartitionIthChange;

630 631
    /// Counts the number of mesh changes after the last mesh repartitioning 
    /// was done.
632
    int nMeshChangesAfterLastRepartitioning;
633

634 635 636
    /// Countes the number of mesh repartitions that were done. Till now, this 
    /// variable is used only for debug outputs.
    int repartitioningCounter;
637

638
    /// Directory name where all debug output files should be written to.
639
    string debugOutputDir;
640

641 642
    /// Stores the mesh change index. This is used to recognize changes in the
    /// mesh structure (e.g. through refinement or coarsening managers).
643
    long lastMeshChangeIndex;
644

645 646 647 648
    /// 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.
649
    map<int, vector<int> > macroElementNeighbours;
650

651 652
    /// Store all macro elements of the overall mesh, i.e., before the
    /// mesh is redistributed for the first time.
653
    vector<MacroElement*> allMacroElements;
654

Thomas Witkowski's avatar
Thomas Witkowski committed
655 656
    Flag createBoundaryDofFlag;

657 658 659
    /// Stores on each mesh level for all FE spaces the information about
    /// all boundary DOFs.
    vector<map<const FiniteElemSpace*, BoundaryDofInfo> > boundaryDofInfo;
660

661 662
    MeshLevelData levelData;

Thomas Witkowski's avatar
Thomas Witkowski committed
663
  public:
664 665
    bool sebastianMode;

666 667 668
    /// 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
669 670
    static const Flag BOUNDARY_SUBOBJ_SORTED;

671 672 673 674 675 676 677 678 679
    /// 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
680

681 682
    static MeshDistributor *globalMeshDistributor;

683
    friend class ParallelDebug;
684 685 686
  };
}

687
#endif // AMDIS_MESHDISTRIBUTOR_H