MeshDistributor.h 20.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
	          
  public:
Thomas Witkowski's avatar
Thomas Witkowski committed
64 65
    ~MeshDistributor();

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

Thomas Witkowski's avatar
Thomas Witkowski committed
100 101 102
    /// 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.
103 104
    void repartitionMesh();
    
Thomas Witkowski's avatar
Thomas Witkowski committed
105 106 107 108 109 110 111
    void getImbalanceFactor(double &imbalance, 
			    int &minDofs, 
			    int &maxDofs,
			    int &sumDofs);

    double getImbalanceFactor();

112 113 114
    /// Calculates the imbalancing factor and prints it to screen.
    void printImbalanceFactor();

Thomas Witkowski's avatar
Thomas Witkowski committed
115 116 117 118
    /// 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.
119
    void testForMacroMesh();
120

121 122
    /// Set for each element on the partitioning level the number of 
    /// leaf elements.
123
    void setInitialElementWeights();
124

Thomas Witkowski's avatar
Thomas Witkowski committed
125
    inline string getName() 
126 127 128
    { 
      return name; 
    }
129

Thomas Witkowski's avatar
Thomas Witkowski committed
130 131 132 133 134
    inline Mesh* getMesh()
    {
      return mesh;
    }

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

140
      TEST_EXIT_DBG(i < feSpaces.size())
141
	("Try to access FE space %d, but have only %d FE spaces!\n", 
142
	 i, feSpaces.size());
143

144
      return feSpaces[i];
145
    }
146 147 148 149

    /// Returns all FE spaces, thus \ref feSpaces.
    inline vector<const FiniteElemSpace*>& getFeSpaces()
    {
150
      return feSpaces;
Thomas Witkowski's avatar
Thomas Witkowski committed
151 152
    }

153
    inline const FiniteElemSpace* getComponentSpace(unsigned int i = 0)
Thomas Witkowski's avatar
Thomas Witkowski committed
154 155 156 157 158 159 160 161
    {
      FUNCNAME("MeshDistributor::getFeSpace()");

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

      return componentSpaces[i];
    }

162
    inline vector<const FiniteElemSpace*>& getComponentSpaces()
Thomas Witkowski's avatar
Thomas Witkowski committed
163 164
    {
      return componentSpaces;
165 166
    }

167 168
    /// Returns the DOF mapping object, \ref dofMap.
    inline ParallelDofMapping& getDofMap()
Thomas Witkowski's avatar
Thomas Witkowski committed
169
    {
170
      return dofMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
171 172
    }

173 174 175 176 177
    inline ParallelDofMapping& getDofMapSd()
    {
      return dofMapSd;
    }

178 179
    /// Returns the periodic mapping handler, \ref periodicMap.
    inline PeriodicMap& getPeriodicMap()
180
    {
181
      return periodicMap;
182
    }
183

184
    DofComm& getDofComm()
185
    {
186
      return dofComm;
187 188
    }

189 190 191 192 193
    DofComm& getDofCommSd()
    {
      return dofCommSd;
    }

194 195 196 197 198
    InteriorBoundary& getIntBoundary()
    {
      return intBoundary;
    }

199 200 201 202 203
    InteriorBoundary& getIntBoundarySd()
    {
      return intBoundarySd;
    }

204
    inline long getLastMeshChangeIndex()
205
    {
206
      return lastMeshChangeIndex;
207
    }
208

209
    inline int getMpiRank()
210
    {
211
      return mpiRank;
212
    }
213

Thomas Witkowski's avatar
Thomas Witkowski committed
214 215 216 217 218
    inline int getMpiSize()
    {
      return mpiSize;
    }

219 220 221
    inline MPI::Intracomm& getMpiComm()
    {
      return mpiComm;
222 223
    }

224 225 226 227 228
    inline bool isInitialized()
    {
      return initialized;
    }

229
    // Writes all data of this object to an output stream.
230
    void serialize(ostream &out);
231

232
    // Reads the object data from an input stream.
233
    void deserialize(istream &in);
234 235

    /** \brief
236 237 238 239
     * 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.
240
     *
241 242 243
     * 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.
244
     */    
245 246 247 248 249
    template<typename T>
    void synchVector(DOFVector<T> &vec) 
    {
      StdMpi<vector<T> > stdMpi(mpiComm);

250 251
      const FiniteElemSpace *fe = vec.getFeSpace();

252 253
      for (DofComm::Iterator it(dofComm.getSendDofs(), fe); 
	   !it.end(); it.nextRank()) {
254
	vector<T> dofs;
255
	dofs.reserve(it.getDofs().size());
256
	
257 258
	for (; !it.endDofIter(); it.nextDof())
	  dofs.push_back(vec[it.getDofIndex()]);
259
	
260
	stdMpi.send(it.getRank(), dofs);
261
      }
262
	     
263 264
      for (DofComm::Iterator it(dofComm.getRecvDofs()); 
	   !it.end(); it.nextRank())
265 266
        stdMpi.recv(it.getRank());
	     
267
      stdMpi.startCommunication();
268

269 270
      for (DofComm::Iterator it(dofComm.getRecvDofs(), fe); 
	   !it.end(); it.nextRank())
271 272 273
	for (; !it.endDofIter(); it.nextDof())
	  vec[it.getDofIndex()] = 
	     stdMpi.getRecvData(it.getRank())[it.getDofCounter()];
274
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
275
   
Thomas Witkowski's avatar
Blub  
Thomas Witkowski committed
276 277 278 279
    /// 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.
    void synchVector(SystemVector &vec, int level = 0);
280

Thomas Witkowski's avatar
Thomas Witkowski committed
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 307 308 309 310 311 312 313 314 315
    /// Works quite similar to the function \ref synchVector, but instead the 
    /// values of subdomain vectors are add along the boundaries.
    template<typename T>
    void synchAddVector(DOFVector<T> &vec)
    {
      StdMpi<vector<T> > stdMpi(mpiComm);

      const FiniteElemSpace *fe = vec.getFeSpace();

      for (DofComm::Iterator it(dofComm.getRecvDofs(), fe);
	   !it.end(); it.nextRank()) {
	vector<T> dofs;
	dofs.reserve(it.getDofs().size());
	
	for (; !it.endDofIter(); it.nextDof())
	  dofs.push_back(vec[it.getDofIndex()]);
	
	stdMpi.send(it.getRank(), dofs);
      }

      for (DofComm::Iterator it(dofComm.getSendDofs()); 
	   !it.end(); it.nextRank())
        stdMpi.recv(it.getRank());
	     
      stdMpi.startCommunication();

      for (DofComm::Iterator it(dofComm.getSendDofs(), fe); 
	   !it.end(); it.nextRank())
	for (; !it.endDofIter(); it.nextDof())
	  vec[it.getDofIndex()] += 
	     stdMpi.getRecvData(it.getRank())[it.getDofCounter()];

      synchVector(vec);
    }

316 317 318 319 320 321
    /// In 3D, a subdomain may not be a valid AMDiS mesh if it contains two
    /// parts which are only connected by an edge. In this case, the standard
    /// refinement algorithm does not work correctly, as two elements connected
    /// only on one edge are not neighours by definition. This functions checks
    /// for this situation and fix the problem. For this, the mesh is search for
    /// all edges connecting two elements that are otherwise not connected.
322 323
    void check3dValidMesh();

Thomas Witkowski's avatar
Thomas Witkowski committed
324 325 326 327 328
    void setBoundaryDofRequirement(Flag flag)
    {
      createBoundaryDofFlag = flag;
    }

329 330
    BoundaryDofInfo& getBoundaryDofInfo(const FiniteElemSpace *feSpace,
					int level)
331
    {
332 333 334 335 336 337 338
      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];
339 340
    }

341 342
    void getAllBoundaryDofs(const FiniteElemSpace *feSpace, 
			    int level,
343
			    DofContainer& dofs);
344

345 346 347 348
    const ElementObjectDatabase& getElementObjectDb() 
    {
      return elObjDb;
    }
349 350 351

    /// Adds a stationary problem to the global mesh distributor objects.
    static void addProblemStatGlobal(ProblemStatSeq *probStat);
Thomas Witkowski's avatar
Thomas Witkowski committed
352 353 354 355 356 357

    MeshLevelData& getMeshLevelData() 
    {
      return levelData;
    }

358 359 360 361 362 363 364 365
    void updateLocalGlobalNumbering();

    /// Updates the local and global DOF numbering after the mesh has been 
    /// changed.
    void updateLocalGlobalNumbering(ParallelDofMapping &dmap,
				    DofComm &dcom,
				    const FiniteElemSpace *feSpace);

366
  protected:
367 368
    void addProblemStat(ProblemStatSeq *probStat);

369 370
    /// Determines the interior boundaries, i.e. boundaries between ranks, and
    /// stores all information about them in \ref interiorBoundary.
371
    void createInteriorBoundary(bool firstCall);
Thomas Witkowski's avatar
Thomas Witkowski committed
372

Thomas Witkowski's avatar
Thomas Witkowski committed
373 374
    void createBoundaryDofs();

375 376
    /// Removes all macro elements from the mesh that are not part of ranks 
    /// partition.
377 378
    void removeMacroElements();

379 380 381 382
    /// Calls \ref createPeriodicMap(feSpace) for all FE spaces that are
    /// handled by the mesh distributor.
    void createPeriodicMap();

383 384 385
    /// 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.  
386
    void createPeriodicMap(const FiniteElemSpace *feSpace);
387

388 389 390 391 392 393
    /// 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.
394 395
    void createMacroElementInfo();

396 397
    void updateMacroElementInfo();

398
    /** \brief
399 400 401 402 403 404
     * 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.
405
     *
406 407
     * \param[in] allBound   Defines a map from rank to interior boundaries 
     *                       which should be checked.
408
     *
409 410 411
     * \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.
412 413
     */
    bool checkAndAdaptBoundary(RankToBoundMap &allBound);
414
  
415 416 417 418
    /// Removes all periodic boundary condition information from all matrices and
    /// vectors of all stationary problems and from the mesh itself.
    void removePeriodicBoundaryConditions();

419 420 421 422
    /// 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
423
    // Removes all periodic boundaries from a given boundary map.
424
    void removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
425

426 427
    void createMeshLevelStructure();

428
    /// Writes a vector of dof pointers to an output stream.
429
    void serialize(ostream &out, DofContainer &data);
430

431 432 433 434
    /// Writes a \ref RankToDofContainer to an output stream.
    void serialize(ostream &out, 
		   map<int, map<const FiniteElemSpace*, DofContainer> > &data);

435
    /// Reads a vector of dof pointers from an input stream.
436
    void deserialize(istream &in, DofContainer &data,
437
		     map<int, const DegreeOfFreedom*> &dofIndexMap);
438 439

    /// Reads a \ref RankToDofContainer from an input stream.
440 441
    void deserialize(istream &in, 
		     map<int, map<const FiniteElemSpace*, DofContainer> > &data,
442
		     map<const FiniteElemSpace*, map<int, const DegreeOfFreedom*> > &dofIndexMap);
443 444 445

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

450
      int mapSize = data.size();
451
      SerUtil::serialize(out, mapSize);
452
      for (typename map<const DegreeOfFreedom*, T>::iterator it = data.begin();
453 454 455
	   it != data.end(); ++it) {
	int v1 = (*(it->first));
	T v2 = it->second;
456 457
	SerUtil::serialize(out, v1);
	SerUtil::serialize(out, v2);
458 459 460 461 462
      }
    }

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

468
      int mapSize = 0;
469
      SerUtil::deserialize(in, mapSize);
470 471 472
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
473 474
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
475

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

479
	data[dofIndexMap[v1]] = v2;
480 481
      }
    }
482

483
  protected:
484 485
    /// List of all stationary problems that are managed by this mesh 
    /// distributor.
486
    vector<ProblemStatSeq*> problemStat;
Thomas Witkowski's avatar
Thomas Witkowski committed
487

488 489 490
    /// If true, the mesh distributor is already initialized;
    bool initialized;

491 492 493 494 495 496
    /// The rank of the current process.
    int mpiRank;

    /// Overall number of processes.
    int mpiSize;

497 498
    /// MPI communicator collected all processes, which should be used for
    /// calculation. The Debug procces is not included in this communicator.
499 500 501
    MPI::Intracomm mpiComm;

    /// Name of the problem (as used in the init files)
502
    string name;
503

504
    /// Finite element spaces of the problem.
505
    vector<const FiniteElemSpace*> componentSpaces;
Thomas Witkowski's avatar
Thomas Witkowski committed
506

507 508
    /// Set of all different FE spaces.
    vector<const FiniteElemSpace*> feSpaces;
509
    
510

511 512 513
    /// Mesh of the problem.
    Mesh *mesh;

514 515 516
    /// 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.    
517 518
    RefinementManager *refineManager;

519 520 521
    /// Info level.
    int info;

522 523
    /// Pointer to a mesh partitioner that is used to partition the mesh to 
    /// the ranks.
524
    MeshPartitioner *partitioner;
525

526 527
    /// Weights for the elements, i.e., the number of leaf elements within 
    /// this element.
528
    map<int, double> elemWeights;
529

530 531
    /// Stores to every macro element index the number of the rank that owns this
    /// macro element.
532
    map<int, int> partitionMap;
533

534
    /// Mapping object to map from local DOF indices to global ones.
535 536
    ParallelDofMapping dofMap;

537 538
    ParallelDofMapping dofMapSd;

539
    /// Database to store and query all sub-objects of all elements of the 
540
    /// macro mesh.
541
    ElementObjectDatabase elObjDb;
Thomas Witkowski's avatar
Thomas Witkowski committed
542

543
    /// Defines the interior boundaries of the domain that result from 
544 545
    /// partitioning the whole mesh. 
    InteriorBoundary intBoundary;
546

547 548
    InteriorBoundary intBoundarySd;

549
    DofComm dofComm;
550

551 552
    DofComm dofCommSd;

553
    PeriodicMap periodicMap;
554

555 556 557 558
    /// This set of values must be interchanged between ranks when the mesh is 
    /// repartitioned.
    vector<DOFVector<double>*> interchangeVectors;
		        
559 560 561 562
    /// 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.
563
    bool deserialized;
564

565 566 567
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

568 569 570
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;

571 572
    /// Stores the number of mesh changes that must lie in between to 
    /// repartitionings.
573 574
    int repartitionIthChange;

575 576
    /// Counts the number of mesh changes after the last mesh repartitioning 
    /// was done.
577
    int nMeshChangesAfterLastRepartitioning;
578

579 580 581
    /// Countes the number of mesh repartitions that were done. Till now, this 
    /// variable is used only for debug outputs.
    int repartitioningCounter;
582

583 584 585 586 587
    /// If repartitioning of the mesh fail, this variable has a positive value
    /// that gives the number of mesh changes the mesh distributer will wait
    /// before trying new mesh repartitioning.
    int repartitioningFailed;

588
    /// Directory name where all debug output files should be written to.
589
    string debugOutputDir;
590

591 592
    /// Stores the mesh change index. This is used to recognize changes in the
    /// mesh structure (e.g. through refinement or coarsening managers).
593
    long lastMeshChangeIndex;
594

595 596 597 598
    /// 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.
599
    map<int, vector<int> > macroElementNeighbours;
600

601 602
    /// Store all macro elements of the overall mesh, i.e., before the
    /// mesh is redistributed for the first time.
603
    vector<MacroElement*> allMacroElements;
604

Thomas Witkowski's avatar
Thomas Witkowski committed
605 606
    Flag createBoundaryDofFlag;

607 608 609
    /// Stores on each mesh level for all FE spaces the information about
    /// all boundary DOFs.
    vector<map<const FiniteElemSpace*, BoundaryDofInfo> > boundaryDofInfo;
610

611 612
    MeshLevelData levelData;

Thomas Witkowski's avatar
bla  
Thomas Witkowski committed
613 614 615 616 617 618
    /// If there is no mesh adaptivity, the mesh distributor can remove some
    /// data structures which are only used if mesh changes or it must be
    /// redistributed due to some local adaptivity. By default, this variable
    /// is set to true, and thus no special assumption are made.
    bool meshAdaptivity;

Thomas Witkowski's avatar
Thomas Witkowski committed
619
  public:
620 621
    static bool sebastianMode;

622 623 624
    /// 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
625 626
    static const Flag BOUNDARY_SUBOBJ_SORTED;

627 628 629 630 631 632 633 634 635
    /// 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
636

637 638
    static MeshDistributor *globalMeshDistributor;

639
    friend class ParallelDebug;
640 641 642
  };
}

643
#endif // AMDIS_MESHDISTRIBUTOR_H