MeshDistributor.h 21.8 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/ParallelTypes.h"
29
#include "parallel/MeshPartitioner.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
30
#include "parallel/InteriorBoundary.h"
31
#include "parallel/StdMpi.h"
32
#include "AMDiS_fwd.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
33
#include "Global.h"
34 35
#include "ProblemTimeInterface.h"
#include "ProblemIterationInterface.h"
36
#include "FiniteElemSpace.h"
37
#include "Serializer.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
38
#include "BoundaryManager.h"
39
#include "ElementObjectData.h"
40
#include "SystemVector.h"
41

42
namespace AMDiS {
43 44

  using namespace std;
Thomas Witkowski's avatar
Thomas Witkowski committed
45 46 47 48


  struct BoundaryDofInfo
  {
49
    map<GeoIndex, DofContainerSet> geoDofs;
Thomas Witkowski's avatar
Thomas Witkowski committed
50
  };
51
  
Thomas Witkowski's avatar
Thomas Witkowski committed
52

53
  class MeshDistributor
54
  {
55
  private:
56
    MeshDistributor();
57
	          
58
    virtual ~MeshDistributor() {}
59

60
  public:
61
    void initParallelization();
62

63
    void exitParallelization();
64

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

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

95 96 97 98 99 100 101 102 103 104
    /** \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();

105
    /** \brief
106 107 108 109
     * 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.
110 111
     */
    void testForMacroMesh();
112

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

117
    inline virtual string getName() 
118 119 120
    { 
      return name; 
    }
121

Thomas Witkowski's avatar
Thomas Witkowski committed
122 123 124 125 126
    inline Mesh* getMesh()
    {
      return mesh;
    }

127 128 129 130 131
    /// Returns \ref feSpace.
    inline const FiniteElemSpace* getFeSpace()
    {
      return feSpace;
    }
132 133 134
    
    /// Returns \ref nRankDOFs, the number of DOFs in the rank mesh.
    inline int getNumberRankDofs() 
135
    {
136
      return nRankDofs;
137
    }
138

139
    /// Returns \ref nOverallDofs, the global number of DOFs.
140
    inline int getNumberOverallDofs()
141
    {
142
      return nOverallDofs;
143
    }
144

Thomas Witkowski's avatar
Thomas Witkowski committed
145 146 147 148 149
    inline DofMapping& getMapLocalGlobalDofs()
    {
      return mapLocalGlobalDofs;
    }

150
    /// Maps a local DOF to its global index.
151
    inline DegreeOfFreedom mapLocalToGlobal(DegreeOfFreedom dof)
152
    {
153
      return mapLocalGlobalDofs[dof];
154
    }
155

156 157
    DegreeOfFreedom mapGlobalToLocal(DegreeOfFreedom dof);

158
    /// Maps a local DOF to its local index.
159 160 161 162 163
    inline DegreeOfFreedom mapLocalToDofIndex(DegreeOfFreedom dof)
    {
      return mapLocalDofIndex[dof];
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
164 165 166 167 168 169
    /// Returns the periodic mapping for all boundary DOFs in rank.
    inline PeriodicDofMap& getPeriodicMapping()
    {
      return periodicDof;
    }

170 171
    /// Returns for a global dof index its periodic mapping for a given 
    /// boundary type.
172
    inline int getPeriodicMapping(int globalDofIndex, BoundaryType type)
173
    {
Thomas Witkowski's avatar
Thomas Witkowski committed
174 175
      FUNCNAME("MeshDistributor::getPeriodicMapping()");

176
      TEST_EXIT_DBG(periodicDof[type].count(globalDofIndex) == 1)
Thomas Witkowski's avatar
Thomas Witkowski committed
177 178
	("There is no periodic association for global DOF %d for boundary type %d!\n",
	 globalDofIndex, type);
179 180 181 182

      return periodicDof[type][globalDofIndex];
    }

183
    /// For a given global DOF index, this function returns the set of periodic
184 185
    /// associations, i.e., the boundary types the DOF is associated to, for 
    /// this DOF.
186
    inline std::set<BoundaryType>& getPerDofAssociations(int globalDofIndex)
187
    {      
188 189 190
      TEST_EXIT_DBG(periodicDofAssociations.count(globalDofIndex)) 
 	("Should not happen!\n"); 

191
      return periodicDofAssociations[globalDofIndex];
192
    }
193

194
    /// Returns true, if the DOF (global index) is a periodic DOF.
195
    inline bool isPeriodicDof(int globalDofIndex)
196
    {
197 198
      return (periodicDofAssociations.count(globalDofIndex) > 0 &&
	       periodicDofAssociations[globalDofIndex].size() > 0);
199 200
    }

201 202 203
    /// Returns true, if the DOF (global index) is a periodic DOF for the given
    /// boundary type.
    inline bool isPeriodicDof(int globalDofIndex, BoundaryType type)
204 205
    {
      return (periodicDof[type].count(globalDofIndex) > 0);
206 207
    }

208 209
    /// 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.
210 211
    inline bool getIsRankDof(DegreeOfFreedom dof)
    {
212 213 214 215
      if (isRankDof.count(dof))
	return isRankDof[dof];

      return false;
216
    }
217

218 219 220 221 222
    inline DofIndexToBool& getIsRankDof()
    {
      return isRankDof;
    }

223
    inline long getLastMeshChangeIndex()
224
    {
225
      return lastMeshChangeIndex;
226
    }
227

228 229 230 231
    inline int getRstart()
    {
      return rstart;
    }
232

233
    inline int getMpiRank()
234
    {
235
      return mpiRank;
236
    }
237

Thomas Witkowski's avatar
Thomas Witkowski committed
238 239 240 241 242
    inline int getMpiSize()
    {
      return mpiSize;
    }

243 244 245
    inline MPI::Intracomm& getMpiComm()
    {
      return mpiComm;
246 247
    }

248
    inline RankToDofContainer& getSendDofs()
249
    {
250
      return sendDofs;
251 252
    }

253
    inline RankToDofContainer& getRecvDofs()
254
    {
255
      return recvDofs;
256
    }
257

258 259 260 261
    /// Creates a set of all DOFs that are on interior boundaries of rank's
    /// domain. Thus, it creates the union of \ref sendDofs and \ref recvDofs.
    void createBoundaryDofs(std::set<DegreeOfFreedom> &boundaryDofs);

262
    // Writes all data of this object to an output stream.
263
    void serialize(ostream &out);
264

265
    // Reads the object data from an input stream.
266
    void deserialize(istream &in);
267 268

    /** \brief
269 270 271 272
     * 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.
273
     *
274 275 276
     * 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.
277
     */    
278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306
    template<typename T>
    void synchVector(DOFVector<T> &vec) 
    {
      StdMpi<vector<T> > stdMpi(mpiComm);

      for (RankToDofContainer::iterator sendIt = sendDofs.begin();
	   sendIt != sendDofs.end(); ++sendIt) {
	vector<T> dofs;
	int nSendDofs = sendIt->second.size();
	dofs.reserve(nSendDofs);
	
	for (int i = 0; i < nSendDofs; i++)
	  dofs.push_back(vec[*((sendIt->second)[i])]);
	
	stdMpi.send(sendIt->first, dofs);
      }
      
      for (RankToDofContainer::iterator recvIt = recvDofs.begin();
	   recvIt != recvDofs.end(); ++recvIt)
	stdMpi.recv(recvIt->first, recvIt->second.size());
      
      stdMpi.startCommunication();
      
      for (RankToDofContainer::iterator recvIt = recvDofs.begin();
	   recvIt != recvDofs.end(); ++recvIt)
	for (unsigned int i = 0; i < recvIt->second.size(); i++)
	  vec[*(recvIt->second)[i]] = stdMpi.getRecvData(recvIt->first)[i];      
    }
    
307
    /** \brief
308 309 310
     * 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.
311 312 313
     */
    void synchVector(SystemVector &vec);

314 315
    void check3dValidMesh();

Thomas Witkowski's avatar
Thomas Witkowski committed
316 317 318 319 320
    void setBoundaryDofRequirement(Flag flag)
    {
      createBoundaryDofFlag = flag;
    }

321 322 323 324 325
    BoundaryDofInfo& getBoundaryDofInfo()
    {
      return boundaryDofInfo;
    }

326 327
    void getAllBoundaryDofs(DofContainer& dofs);

328 329 330 331 332 333

  public:
    /// Adds a stationary problem to the global mesh distributor objects.
    static void addProblemStatGlobal(ProblemStatSeq *probStat);

    
334
  protected:
335 336
    void addProblemStat(ProblemStatSeq *probStat);

337 338
    /// Determines the interior boundaries, i.e. boundaries between ranks, and
    /// stores all information about them in \ref interiorBoundary.
339
    void createInteriorBoundaryInfo();
340

Thomas Witkowski's avatar
Thomas Witkowski committed
341 342 343 344 345
    void updateInteriorBoundaryInfo();

    void createMeshElementData();

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

Thomas Witkowski's avatar
Thomas Witkowski committed
347 348
    void createBoundaryDofs();

349 350
    /// Removes all macro elements from the mesh that are not part of ranks 
    /// partition.
351 352
    void removeMacroElements();

353 354
    /// Updates the local and global DOF numbering after the mesh has been 
    /// changed.
355
    void updateLocalGlobalNumbering();
356

357
    /** \brief
358 359 360
     * Creates 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 periodicDof.
361
     */
362 363
    void createPeriodicMap();

364 365 366 367 368 369 370 371
    /** \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.
     */
372 373
    void createMacroElementInfo();

374 375
    void updateMacroElementInfo();

376
    /** \brief
377 378 379 380 381 382
     * 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.
383
     *
384 385
     * \param[in] allBound   Defines a map from rank to interior boundaries 
     *                       which should be checked.
386
     *
387 388 389
     * \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.
390 391
     */
    bool checkAndAdaptBoundary(RankToBoundMap &allBound);
392
  
393 394
    /// Sets \ref isRankDof to all matrices and rhs vectors in a given 
    /// stationary problem.
395
    void setRankDofs(ProblemStatSeq *probStat);
396

397 398
    /// Sets \ref isRankDof to all matrices and rhs vectors in all 
    /// stationary problems.
399 400
    void setRankDofs();

401 402 403 404
    /// Removes all periodic boundary condition information from all matrices and
    /// vectors of all stationary problems and from the mesh itself.
    void removePeriodicBoundaryConditions();

Thomas Witkowski's avatar
Thomas Witkowski committed
405
    // Removes all periodic boundaries from a given boundary map.
406
    void removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
407

408
    /// Writes a vector of dof pointers to an output stream.
409
    void serialize(ostream &out, DofContainer &data);
410 411

    /// Reads a vector of dof pointers from an input stream.
412 413
    void deserialize(istream &in, DofContainer &data,
		     map<int, const DegreeOfFreedom*> &dofMap);
414 415

    /// Writes a \ref RankToDofContainer to an output stream.
416
    void serialize(ostream &out, RankToDofContainer &data);
417 418

    /// Reads a \ref RankToDofContainer from an input stream.
419 420
    void deserialize(istream &in, RankToDofContainer &data,
		     map<int, const DegreeOfFreedom*> &dofMap);
421

422
    /// Writes a periodic dof mapping to an output stream.
423
    void serialize(ostream &out, PeriodicDofMap &data);
424

425
    void serialize(ostream &out, map<int, std::set<int> >& data);
426

427
    /// Reads a periodic dof mapping from an input stream.
428
    void deserialize(istream &in, PeriodicDofMap &data);
429

430
    void deserialize(istream &in, map<int, std::set<int> >& data);
431

432 433
    /// Writes a mapping from dof pointers to some values to an output stream.
    template<typename T>
434
    void serialize(ostream &out, map<const DegreeOfFreedom*, T> &data)
435
    {
436 437
      FUNCNAME("ParallelDomainBase::serialize()");

438
      int mapSize = data.size();
439
      SerUtil::serialize(out, mapSize);
440
      for (typename map<const DegreeOfFreedom*, T>::iterator it = data.begin();
441 442 443
	   it != data.end(); ++it) {
	int v1 = (*(it->first));
	T v2 = it->second;
444 445
	SerUtil::serialize(out, v1);
	SerUtil::serialize(out, v2);
446 447 448 449 450
      }
    }

    /// Reads a mapping from dof pointer to some values from an input stream.
    template<typename T>
451 452
    void deserialize(istream &in, map<const DegreeOfFreedom*, T> &data,
		     map<int, const DegreeOfFreedom*> &dofMap)
453
    {
454 455
      FUNCNAME("ParallelDomainBase::deserialize()");

456
      int mapSize = 0;
457
      SerUtil::deserialize(in, mapSize);
458 459 460
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
461 462
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
463 464 465

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

466 467 468
	data[dofMap[v1]] = v2;
      }
    }
469

470
  protected:
471 472
    /// List of all stationary problems that are managed by this mesh 
    /// distributor.
473
    vector<ProblemStatSeq*> problemStat;
Thomas Witkowski's avatar
Thomas Witkowski committed
474

475 476 477
    /// If true, the mesh distributor is already initialized;
    bool initialized;

478 479 480 481 482 483
    /// The rank of the current process.
    int mpiRank;

    /// Overall number of processes.
    int mpiSize;

484 485
    /// MPI communicator collected all processes, which should be used for
    /// calculation. The Debug procces is not included in this communicator.
486 487 488
    MPI::Intracomm mpiComm;

    /// Name of the problem (as used in the init files)
489
    string name;
490

491 492 493
    /// Finite element space of the problem.
    FiniteElemSpace *feSpace;

494 495 496
    /// Mesh of the problem.
    Mesh *mesh;

497
    /** \brief
498 499 500
     * 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.
501 502 503
     */    
    RefinementManager *refineManager;

504 505 506
    /// Info level.
    int info;

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

511 512
    /// Weights for the elements, i.e., the number of leaf elements within 
    /// this element.
513
    map<int, double> elemWeights;
514 515

    /** \brief
516 517
     * Stores to every macro element index the number of the rank that owns this
     * macro element.
518
     */
519
    map<int, int> partitionMap;
520

521
    /// Number of DOFs in the rank mesh.
522
    int nRankDofs;
Thomas Witkowski's avatar
Thomas Witkowski committed
523

524
    /// Number of DOFs in the whole domain.
525 526
    int nOverallDofs;

527 528
    /// Data structure to store all sub-objects of all elements of the 
    /// macro mesh.
Thomas Witkowski's avatar
Thomas Witkowski committed
529 530
    ElementObjects elObjects;

531
    /// Maps to each macro element index a pointer to the corresponding element.
532
    map<int, Element*> macroElIndexMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
533
    
534
    /// Maps to each macro element index the type of this element.
535
    map<int, int> macroElIndexTypeMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
536

Thomas Witkowski's avatar
Thomas Witkowski committed
537
    /** \brief 
538 539 540 541
     * 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.
Thomas Witkowski's avatar
Thomas Witkowski committed
542 543 544 545
     */
    InteriorBoundary myIntBoundary;
    
    /** \brief
546 547 548 549
     * 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
550
     */
Thomas Witkowski's avatar
Thomas Witkowski committed
551
    InteriorBoundary otherIntBoundary;
Thomas Witkowski's avatar
Thomas Witkowski committed
552

553
    /** \brief
554 555
     * Defines the periodic boundaries with other ranks. Periodic boundaries
     * have no owner, as it is the case of interior boundaries.
556 557 558
     */
    InteriorBoundary periodicBoundary;

559
    /** \brief
560 561
     * This map contains for each rank the list of DOFs the current rank must 
     * send to exchange solution DOFs at the interior boundaries.
562
     */
Thomas Witkowski's avatar
Thomas Witkowski committed
563
    RankToDofContainer sendDofs;
564 565

    /** \brief
566 567 568
     * 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.
569
     */
Thomas Witkowski's avatar
Thomas Witkowski committed
570
    RankToDofContainer recvDofs;
571 572

    /// Maps local to global dof indices.
573
    DofMapping mapLocalGlobalDofs;
574

Thomas Witkowski's avatar
Thomas Witkowski committed
575
    /// Maps local dof indices to real dof indices.
576
    DofMapping mapLocalDofIndex;  
577 578

    /** \brief
579 580 581
     * 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.
582
     */
583 584
    DofIndexToBool isRankDof;

585
    /** \brief
586 587 588 589
     * If periodic boundaries are used, this map stores, for each periodic 
     * boundary type, for all DOFs in rank's partition (that are on periodic 
     * boundaries), the corresponding mapped periodic DOFs. The mapping is 
     * defined by using global DOF indices.
590
     */
591
    PeriodicDofMap periodicDof;
592 593
    
    /** \brief
594 595 596 597 598
     * If periodic boundaries are used, this map stores to each periodic DOF in 
     * rank's partition the set of periodic boundaries the DOF is associated to.
     * In 2D, most DOFs are only on one periodic boundary. Only, e.g., in a box 
     * with all boundaries being periodic, the four corners are associated by 
     * two different boundaries.
599
     */
600
    map<int, std::set<BoundaryType> > periodicDofAssociations;
601

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
    /// Is the index of the first row of the linear system, which is owned by 
    /// the rank.
Thomas Witkowski's avatar
n  
Thomas Witkowski committed
609
    int rstart;
610

611 612 613
    /** \brief
     * 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
614 615
     * initialization function, if the problem definition has already been read
     * from a serialization file.
616 617
     */
    bool deserialized;
618

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

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

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

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

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

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

640
    /** \brief
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 644
     */
    long lastMeshChangeIndex;
645

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

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

Thomas Witkowski's avatar
Thomas Witkowski committed
656 657 658
    Flag createBoundaryDofFlag;

    BoundaryDofInfo boundaryDofInfo;
659

Thomas Witkowski's avatar
Thomas Witkowski committed
660
  public:
661 662 663
    /// 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
664 665
    static const Flag BOUNDARY_SUBOBJ_SORTED;

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

676 677
    static MeshDistributor *globalMeshDistributor;

678
    friend class ParallelDebug;
679 680 681
  };
}

682
#endif // AMDIS_MESHDISTRIBUTOR_H