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 23.9 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/PeriodicMap.h"
35
#include "parallel/StdMpi.h"
36
#include "AMDiS_fwd.h"
37
#include "Containers.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
38
#include "Global.h"
39 40
#include "ProblemTimeInterface.h"
#include "ProblemIterationInterface.h"
41
#include "FiniteElemSpace.h"
42
#include "Serializer.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
43
#include "BoundaryManager.h"
44
#include "SystemVector.h"
45

46
namespace AMDiS {
47 48

  using namespace std;
Thomas Witkowski's avatar
Thomas Witkowski committed
49 50 51 52


  struct BoundaryDofInfo
  {
53
    map<GeoIndex, DofContainerSet> geoDofs;
Thomas Witkowski's avatar
Thomas Witkowski committed
54 55
  };

56 57 58 59 60 61 62 63 64 65 66 67

  struct DofData
  {
    /// Number of DOFs in the rank mesh.
    int nRankDofs;

    /// Is the index of the first global DOF index, which is owned by the rank.
    int rStartDofs;

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

68 69 70
    /// 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.
71 72 73
    DofIndexToBool isRankDof;

    /// Maps local to global dof indices.
Thomas Witkowski's avatar
Thomas Witkowski committed
74
    DofMap mapDofToGlobal;
75 76

    /// Maps local dof indices to real dof indices.
Thomas Witkowski's avatar
Thomas Witkowski committed
77
    DofMap mapLocalToDof;
78
  };
79 80


81
  class MeshDistributor
82
  {
83
  private:
84
    MeshDistributor();
85
	          
86
    virtual ~MeshDistributor() {}
87

88
  public:
89
    void initParallelization();
90

91
    void exitParallelization();
92

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

101 102 103 104 105 106 107
    /// 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));
    }
    
108
    /** \brief
109 110 111 112 113
     * 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.
114
     *
115 116 117 118 119
     * \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.
120
     */
121
    void checkMeshChange(bool tryRepartition = true);
122

123 124 125 126 127 128 129 130 131 132
    /** \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();

133
    /** \brief
134 135 136 137
     * 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.
138 139
     */
    void testForMacroMesh();
140

141 142
    /// Set for each element on the partitioning level the number of 
    /// leaf elements.
143
    void setInitialElementWeights();
144

145
    inline virtual string getName() 
146 147 148
    { 
      return name; 
    }
149

Thomas Witkowski's avatar
Thomas Witkowski committed
150 151 152 153 154
    inline Mesh* getMesh()
    {
      return mesh;
    }

155 156
    /// Returns an FE space from \ref feSpaces.
    inline const FiniteElemSpace* getFeSpace(unsigned int i = 0)
157
    {
158 159 160 161 162
      FUNCNAME("MeshDistributor::getFeSpace()");

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

      return feSpaces[i];
163
    }
164 165 166 167 168 169 170

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

171 172
    /// Returns the number of DOFs in rank's domain for a given FE space.
    inline int getNumberRankDofs(const FiniteElemSpace *feSpace) 
173
    {
174 175 176 177
      FUNCNAME("MeshDistributor::getNumberRankDofs()");

      TEST_EXIT_DBG(dofFeData.count(feSpace))("Should not happen!\n");

178
      return dofFeData[feSpace].nRankDofs;
179
    }
180

181 182 183 184 185 186 187 188 189 190 191 192 193
    /// 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;
      for (unsigned int i = 0; i < feSpaces.size(); i++) {
	TEST_EXIT_DBG(dofFeData.count(feSpaces[i]))("Should not happen!\n");
	result += dofFeData[feSpaces[i]].nRankDofs;
      }

      return result;
    }
194

195
    /// Returns the first global DOF index of an FE space, owned by rank.
196
    inline int getStartDofs(const FiniteElemSpace *feSpace)
197
    {
198 199 200 201
      FUNCNAME("MeshDistributor::getStartDofs()");

      TEST_EXIT_DBG(dofFeData.count(feSpace))("Should not happen!\n");

202
      return dofFeData[feSpace].rStartDofs;
203 204
    }

205 206 207 208 209 210 211 212 213 214 215 216 217 218 219
    /// 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;
      for (unsigned int i = 0; i < feSpaces.size(); i++) {
	TEST_EXIT_DBG(dofFeData.count(feSpaces[i]))("Should not happen!\n");

	result += dofFeData[feSpaces[i]].rStartDofs;
      }

      return result;
    }

220 221
    ///  Returns the global number of DOFs for a given FE space.
    inline int getNumberOverallDofs(const FiniteElemSpace *feSpace)
222
    {
223 224 225 226
      FUNCNAME("MeshDistributor::getNumberOverallDofs()");

      TEST_EXIT_DBG(dofFeData.count(feSpace))("Should not happen!\n");

227
      return dofFeData[feSpace].nOverallDofs;
228
    }
229

230 231 232 233 234 235 236 237 238 239 240 241 242 243 244
    /// 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;
      for (unsigned int i = 0; i < feSpaces.size(); i++) {
	TEST_EXIT_DBG(dofFeData.count(feSpaces[i]))("Should not happen!\n");

	result += dofFeData[feSpaces[i]].nOverallDofs;
      }

      return result;
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
245
    inline DofMap& getMapDofToGlobal(const FiniteElemSpace *feSpace)
Thomas Witkowski's avatar
Thomas Witkowski committed
246
    {
247
      FUNCNAME("MeshDistributor::getMapDofToGlobal()");
248 249 250

      TEST_EXIT_DBG(dofFeData.count(feSpace))("Should not happen!\n");

251
      return dofFeData[feSpace].mapDofToGlobal;
Thomas Witkowski's avatar
Thomas Witkowski committed
252 253
    }

254
    /// Maps a local DOF to its global index.
255 256
    inline DegreeOfFreedom mapDofToGlobal(const FiniteElemSpace *feSpace,
					  DegreeOfFreedom dof)
257
    {
258
      FUNCNAME("MeshDistributor::mapDofToGlobal()");
259 260 261 262

      TEST_EXIT_DBG(dofFeData.count(feSpace))
	("No DOF data for FE space at addr %p!\n", feSpace);

263
      return dofFeData[feSpace].mapDofToGlobal[dof];
264
    }
265

266 267 268 269
    /// 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.
270 271
    DegreeOfFreedom mapGlobalToLocal(const FiniteElemSpace *feSpace,
				     DegreeOfFreedom dof);
272

273
    /// Maps a local DOF to its local index.
274 275
    inline DegreeOfFreedom mapLocalToDof(const FiniteElemSpace *feSpace,
					 DegreeOfFreedom dof)
276
    {
277
      FUNCNAME("MeshDistributor::mapLocalToDof()");
278 279 280 281

      TEST_EXIT_DBG(dofFeData.count(feSpace))
	("No DOF data for FE space at addr %p!\n", feSpace);

282
      return dofFeData[feSpace].mapLocalToDof[dof];
283 284
    }

285 286
    /// Returns the periodic mapping handler, \ref periodicMap.
    inline PeriodicMap& getPeriodicMap()
Thomas Witkowski's avatar
Thomas Witkowski committed
287
    {
288
      return periodicMap;
289 290
    }

291
    DofComm& getSendDofs()
292 293 294 295
    {
      return sendDofs;
    }

296
    DofComm& getRecvDofs()
297 298 299 300
    {
      return recvDofs;
    }

301 302 303 304 305
    DofComm& getPeriodicDofs()
    {
      return periodicDofs;
    }

306 307
    /// 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.
308
    inline bool getIsRankDof(const FiniteElemSpace *feSpace, DegreeOfFreedom dof)
309
    {
310 311
      if (dofFeData[feSpace].isRankDof.count(dof))
	return dofFeData[feSpace].isRankDof[dof];
312 313

      return false;
314
    }
315

316
    inline DofIndexToBool& getIsRankDof(const FiniteElemSpace *feSpace)
317
    {
318
      return dofFeData[feSpace].isRankDof;
319 320
    }

321
    inline long getLastMeshChangeIndex()
322
    {
323
      return lastMeshChangeIndex;
324
    }
325

326
    inline int getMpiRank()
327
    {
328
      return mpiRank;
329
    }
330

Thomas Witkowski's avatar
Thomas Witkowski committed
331 332 333 334 335
    inline int getMpiSize()
    {
      return mpiSize;
    }

336 337 338
    inline MPI::Intracomm& getMpiComm()
    {
      return mpiComm;
339 340
    }

341 342 343 344 345
    inline bool isInitialized()
    {
      return initialized;
    }

346
    // Writes all data of this object to an output stream.
347
    void serialize(ostream &out);
348

349
    // Reads the object data from an input stream.
350
    void deserialize(istream &in);
351 352

    /** \brief
353 354 355 356
     * 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.
357
     *
358 359 360
     * 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.
361
     */    
362 363 364 365 366
    template<typename T>
    void synchVector(DOFVector<T> &vec) 
    {
      StdMpi<vector<T> > stdMpi(mpiComm);

367 368
      const FiniteElemSpace *fe = vec.getFeSpace();

369
      for (DofComm::Iterator it(sendDofs, fe); !it.end(); it.nextRank()) {
370
	vector<T> dofs;
371
	dofs.reserve(it.getDofs().size());
372
	
373 374
	for (; !it.endDofIter(); it.nextDof())
	  dofs.push_back(vec[it.getDofIndex()]);
375
	
376
	stdMpi.send(it.getRank(), dofs);
377
      }
378 379 380 381
	     
      for (DofComm::Iterator it(recvDofs); !it.end(); it.nextRank())
        stdMpi.recv(it.getRank());
	     
382
      stdMpi.startCommunication();
383 384 385 386 387

      for (DofComm::Iterator it(recvDofs, fe); !it.end(); it.nextRank())
	for (; !it.endDofIter(); it.nextDof())
	  vec[it.getDofIndex()] = 
	     stdMpi.getRecvData(it.getRank())[it.getDofCounter()];
388 389
    }
    
390
    /** \brief
391 392 393
     * 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.
394 395 396
     */
    void synchVector(SystemVector &vec);

397 398
    void check3dValidMesh();

Thomas Witkowski's avatar
Thomas Witkowski committed
399 400 401 402 403
    void setBoundaryDofRequirement(Flag flag)
    {
      createBoundaryDofFlag = flag;
    }

404 405
    BoundaryDofInfo& getBoundaryDofInfo(const FiniteElemSpace *feSpace, 
					int level = 0)
406
    {
407 408 409 410 411 412 413
      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];
414 415
    }

416 417
    void getAllBoundaryDofs(const FiniteElemSpace *feSpace, 
			    int level,
418
			    DofContainer& dofs);
419

420 421 422 423
    const ElementObjectDatabase& getElementObjectDb() 
    {
      return elObjDb;
    }
424 425 426

    /// Adds a stationary problem to the global mesh distributor objects.
    static void addProblemStatGlobal(ProblemStatSeq *probStat);
Thomas Witkowski's avatar
Thomas Witkowski committed
427 428 429 430 431 432

    MeshLevelData& getMeshLevelData() 
    {
      return levelData;
    }

433
  protected:
434 435
    void addProblemStat(ProblemStatSeq *probStat);

436 437
    /// Determines the interior boundaries, i.e. boundaries between ranks, and
    /// stores all information about them in \ref interiorBoundary.
438
    void createInteriorBoundaryInfo();
439

Thomas Witkowski's avatar
Thomas Witkowski committed
440 441 442 443 444
    void updateInteriorBoundaryInfo();

    void createMeshElementData();

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

Thomas Witkowski's avatar
Thomas Witkowski committed
446 447
    void createBoundaryDofs();

448
    void createBoundaryDofs(const FiniteElemSpace *feSpace, int level);
449

450 451
    /// Removes all macro elements from the mesh that are not part of ranks 
    /// partition.
452 453
    void removeMacroElements();

454 455
    void updateLocalGlobalNumbering();

456 457
    /// Updates the local and global DOF numbering after the mesh has been 
    /// changed.
458
    void updateLocalGlobalNumbering(const FiniteElemSpace *feSpace);
459

460 461 462 463
    /// Calls \ref createPeriodicMap(feSpace) for all FE spaces that are
    /// handled by the mesh distributor.
    void createPeriodicMap();

464
    /** \brief
465 466 467 468
     * 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.
     */    
469
    void createPeriodicMap(const FiniteElemSpace *feSpace);
470

471 472 473 474 475 476 477 478
    /** \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.
     */
479 480
    void createMacroElementInfo();

481 482
    void updateMacroElementInfo();

483
    /** \brief
484 485 486 487 488 489
     * 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.
490
     *
491 492
     * \param[in] allBound   Defines a map from rank to interior boundaries 
     *                       which should be checked.
493
     *
494 495 496
     * \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.
497 498
     */
    bool checkAndAdaptBoundary(RankToBoundMap &allBound);
499
  
500 501
    /// Sets \ref isRankDof to all matrices and rhs vectors in a given 
    /// stationary problem.
502
    void setRankDofs(ProblemStatSeq *probStat);
503

504 505
    /// Sets \ref isRankDof to all matrices and rhs vectors in all 
    /// stationary problems.
506 507
    void setRankDofs();

508 509 510 511
    /// Removes all periodic boundary condition information from all matrices and
    /// vectors of all stationary problems and from the mesh itself.
    void removePeriodicBoundaryConditions();

512 513 514 515
    /// 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
516
    // Removes all periodic boundaries from a given boundary map.
517
    void removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
518

519 520
    void createMeshLevelStructure();

521
    /// Writes a vector of dof pointers to an output stream.
522
    void serialize(ostream &out, DofContainer &data);
523

524 525 526 527
    /// Writes a \ref RankToDofContainer to an output stream.
    void serialize(ostream &out, 
		   map<int, map<const FiniteElemSpace*, DofContainer> > &data);

528
    /// Reads a vector of dof pointers from an input stream.
529 530
    void deserialize(istream &in, DofContainer &data,
		     map<int, const DegreeOfFreedom*> &dofMap);
531 532

    /// Reads a \ref RankToDofContainer from an input stream.
533 534 535
    void deserialize(istream &in, 
		     map<int, map<const FiniteElemSpace*, DofContainer> > &data,
		     map<const FiniteElemSpace*, map<int, const DegreeOfFreedom*> > &dofMap);
536 537 538

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

543
      int mapSize = data.size();
544
      SerUtil::serialize(out, mapSize);
545
      for (typename map<const DegreeOfFreedom*, T>::iterator it = data.begin();
546 547 548
	   it != data.end(); ++it) {
	int v1 = (*(it->first));
	T v2 = it->second;
549 550
	SerUtil::serialize(out, v1);
	SerUtil::serialize(out, v2);
551 552 553 554 555
      }
    }

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

561
      int mapSize = 0;
562
      SerUtil::deserialize(in, mapSize);
563 564 565
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
566 567
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
568 569 570

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

571 572 573
	data[dofMap[v1]] = v2;
      }
    }
574

575
  protected:
576 577
    /// List of all stationary problems that are managed by this mesh 
    /// distributor.
578
    vector<ProblemStatSeq*> problemStat;
Thomas Witkowski's avatar
Thomas Witkowski committed
579

580 581 582
    /// If true, the mesh distributor is already initialized;
    bool initialized;

583 584 585 586 587 588
    /// The rank of the current process.
    int mpiRank;

    /// Overall number of processes.
    int mpiSize;

589 590
    /// MPI communicator collected all processes, which should be used for
    /// calculation. The Debug procces is not included in this communicator.
591 592 593
    MPI::Intracomm mpiComm;

    /// Name of the problem (as used in the init files)
594
    string name;
595

596 597
    /// Finite element spaces of the problem.
    vector<const FiniteElemSpace*> feSpaces;
598

599 600 601
    /// Mesh of the problem.
    Mesh *mesh;

602 603 604
    /// 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.    
605 606
    RefinementManager *refineManager;

607 608 609
    /// Info level.
    int info;

610 611
    /// Pointer to a mesh partitioner that is used to partition the mesh to 
    /// the ranks.
612
    MeshPartitioner *partitioner;
613

614 615
    /// Weights for the elements, i.e., the number of leaf elements within 
    /// this element.
616
    map<int, double> elemWeights;
617

618 619
    /// Stores to every macro element index the number of the rank that owns this
    /// macro element.
620
    map<int, int> partitionMap;
621

622
    map<const FiniteElemSpace*, DofData> dofFeData;
623

624
    /// Database to store and query all sub-objects of all elements of the 
625
    /// macro mesh.
626
    ElementObjectDatabase elObjDb;
Thomas Witkowski's avatar
Thomas Witkowski committed
627

628
    /// Maps to each macro element index a pointer to the corresponding element.
629
    map<int, Element*> macroElIndexMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
630
    
631
    /// Maps to each macro element index the type of this element.
632
    map<int, int> macroElIndexTypeMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
633

634 635 636 637
    /// 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.
638
    InteriorBoundary rankIntBoundary;
Thomas Witkowski's avatar
Thomas Witkowski committed
639
    
640 641 642 643
    /// 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
644
    InteriorBoundary otherIntBoundary;
Thomas Witkowski's avatar
Thomas Witkowski committed
645

646 647
    /// Defines the periodic boundaries with other ranks. Periodic boundaries
    /// have no owner, as it is the case of interior boundaries.
648 649
    InteriorBoundary periodicBoundary;

650 651
    /// This map contains for each rank the list of DOFs the current rank must 
    /// end to exchange solution DOFs at the interior boundaries.
652
    DofComm sendDofs;
653

654 655 656
    /// 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.
657
    DofComm recvDofs;
658

659 660 661 662
    /// 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. 
663 664
    DofComm periodicDofs;

665
    PeriodicMap periodicMap;
666

667 668 669 670
    /// This set of values must be interchanged between ranks when the mesh is 
    /// repartitioned.
    vector<DOFVector<double>*> interchangeVectors;
		        
671 672 673 674
    /// 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.
675
    bool deserialized;
676

677 678 679
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

680 681 682
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;

683 684
    /// Stores the number of mesh changes that must lie in between to 
    /// repartitionings.
685 686
    int repartitionIthChange;

687 688
    /// Counts the number of mesh changes after the last mesh repartitioning 
    /// was done.
689
    int nMeshChangesAfterLastRepartitioning;
690

691 692 693
    /// Countes the number of mesh repartitions that were done. Till now, this 
    /// variable is used only for debug outputs.
    int repartitioningCounter;
694

695
    /// Directory name where all debug output files should be written to.
696
    string debugOutputDir;
697

698 699
    /// Stores the mesh change index. This is used to recognize changes in the
    /// mesh structure (e.g. through refinement or coarsening managers).
700
    long lastMeshChangeIndex;
701

702 703 704 705
    /// 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.
706
    map<int, vector<int> > macroElementNeighbours;
707

708 709
    /// Store all macro elements of the overall mesh, i.e., before the
    /// mesh is redistributed for the first time.
710
    vector<MacroElement*> allMacroElements;
711

Thomas Witkowski's avatar
Thomas Witkowski committed
712 713
    Flag createBoundaryDofFlag;

714 715 716
    /// Stores on each mesh level for all FE spaces the information about
    /// all boundary DOFs.
    vector<map<const FiniteElemSpace*, BoundaryDofInfo> > boundaryDofInfo;
717

718 719
    MeshLevelData levelData;

Thomas Witkowski's avatar
Thomas Witkowski committed
720
  public:
721 722
    bool sebastianMode;

723 724 725
    /// 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
726 727
    static const Flag BOUNDARY_SUBOBJ_SORTED;

728 729 730 731 732 733 734 735 736
    /// 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
737

738 739
    static MeshDistributor *globalMeshDistributor;

740
    friend class ParallelDebug;
741 742 743
  };
}

744
#endif // AMDIS_MESHDISTRIBUTOR_H