MeshDistributor.h 20.4 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
    /// Initialization of mesh distributor.
67
    void initParallelization();
68

69
    /// Clean up procedure for the mesh distributor and attached objects.
70
    void exitParallelization();
71

72 73 74 75 76 77 78 79
    /** \brief
     * Register a parallel DOF mapping. This DOF mapping object will than 
     * automatically updated by the mesh distributer after mesh changes.
     *
     * \param[in]  dofMap   Parallel DOF mapping object.
     */
    void registerDofMap(ParallelDofMapping &dofMap);

80 81 82
    /// Adds a DOFVector to the set of \ref interchangeVecs. Thus, this vector 
    /// will be automatically interchanged between ranks when mesh is 
    /// repartitioned.
83 84 85 86 87
    void addInterchangeVector(DOFVector<double> *vec)
    {
      interchangeVectors.push_back(vec);
    }

88 89 90 91 92 93 94
    /// 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));
    }
    
95
    /** \brief
96 97 98 99 100
     * 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.
101
     *
102 103 104 105 106
     * \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.
107
     */
108
    void checkMeshChange(bool tryRepartition = true);
109

Thomas Witkowski's avatar
Thomas Witkowski committed
110 111 112
    /// 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.
113 114
    void repartitionMesh();
    
Thomas Witkowski's avatar
Thomas Witkowski committed
115 116 117 118 119 120 121
    void getImbalanceFactor(double &imbalance, 
			    int &minDofs, 
			    int &maxDofs,
			    int &sumDofs);

    double getImbalanceFactor();

122 123 124
    /// Calculates the imbalancing factor and prints it to screen.
    void printImbalanceFactor();

Thomas Witkowski's avatar
Thomas Witkowski committed
125 126 127 128
    /// 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.
129
    void testForMacroMesh();
130

Thomas Witkowski's avatar
Thomas Witkowski committed
131
    inline string getName() 
132 133 134
    { 
      return name; 
    }
135

Thomas Witkowski's avatar
Thomas Witkowski committed
136 137 138 139 140
    inline Mesh* getMesh()
    {
      return mesh;
    }

141 142
    /// Returns the periodic mapping handler, \ref periodicMap.
    inline PeriodicMap& getPeriodicMap()
143
    {
144
      return periodicMap;
145
    }
146

147
    DofComm& getDofComm()
148
    {
149
      return dofComm;
150 151
    }

152 153 154 155 156
    DofComm& getDofCommSd()
    {
      return dofCommSd;
    }

157 158 159 160 161
    InteriorBoundary& getIntBoundary()
    {
      return intBoundary;
    }

162 163 164 165 166
    InteriorBoundary& getIntBoundarySd()
    {
      return intBoundarySd;
    }

167
    inline long getLastMeshChangeIndex()
168
    {
169
      return lastMeshChangeIndex;
170
    }
171

172
    inline int getMpiRank()
173
    {
174
      return mpiRank;
175
    }
176

Thomas Witkowski's avatar
Thomas Witkowski committed
177 178 179 180 181
    inline int getMpiSize()
    {
      return mpiSize;
    }

182 183 184
    inline MPI::Intracomm& getMpiComm()
    {
      return mpiComm;
185 186
    }

187 188 189 190 191
    inline bool isInitialized()
    {
      return initialized;
    }

192
    // Writes all data of this object to an output stream.
193
    void serialize(ostream &out);
194

195
    // Reads the object data from an input stream.
196
    void deserialize(istream &in);
197 198

    /** \brief
199 200 201 202
     * 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.
203
     *
204 205 206
     * 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.
207
     */    
208 209 210 211 212
    template<typename T>
    void synchVector(DOFVector<T> &vec) 
    {
      StdMpi<vector<T> > stdMpi(mpiComm);

213 214
      const FiniteElemSpace *fe = vec.getFeSpace();

215 216
      for (DofComm::Iterator it(dofComm.getSendDofs(), fe); 
	   !it.end(); it.nextRank()) {
217
	vector<T> dofs;
218
	dofs.reserve(it.getDofs().size());
219
	
220 221
	for (; !it.endDofIter(); it.nextDof())
	  dofs.push_back(vec[it.getDofIndex()]);
222
	
223
	stdMpi.send(it.getRank(), dofs);
224
      }
225
	     
226 227
      for (DofComm::Iterator it(dofComm.getRecvDofs()); 
	   !it.end(); it.nextRank())
228 229
        stdMpi.recv(it.getRank());
	     
230
      stdMpi.startCommunication();
231

232 233
      for (DofComm::Iterator it(dofComm.getRecvDofs(), fe); 
	   !it.end(); it.nextRank())
234 235 236
	for (; !it.endDofIter(); it.nextDof())
	  vec[it.getDofIndex()] = 
	     stdMpi.getRecvData(it.getRank())[it.getDofCounter()];
237
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
238
   
Thomas Witkowski's avatar
Blub  
Thomas Witkowski committed
239 240 241 242
    /// 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);
243

Thomas Witkowski's avatar
Thomas Witkowski committed
244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278
    /// 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);
    }

279 280 281 282 283 284
    /// 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.
285 286
    void check3dValidMesh();

Thomas Witkowski's avatar
Thomas Witkowski committed
287 288
    void setBoundaryDofRequirement(Flag flag)
    {
289
      createBoundaryDofFlag |= flag;
Thomas Witkowski's avatar
Thomas Witkowski committed
290 291
    }

292 293
    BoundaryDofInfo& getBoundaryDofInfo(const FiniteElemSpace *feSpace,
					int level)
294
    {
295 296 297 298 299 300 301
      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];
302 303
    }

304 305
    void getAllBoundaryDofs(const FiniteElemSpace *feSpace, 
			    int level,
306
			    DofContainer& dofs);
307

Thomas Witkowski's avatar
Thomas Witkowski committed
308
    ElementObjectDatabase& getElementObjectDb() 
309 310 311
    {
      return elObjDb;
    }
312 313 314

    /// Adds a stationary problem to the global mesh distributor objects.
    static void addProblemStatGlobal(ProblemStatSeq *probStat);
Thomas Witkowski's avatar
Thomas Witkowski committed
315 316 317 318 319 320

    MeshLevelData& getMeshLevelData() 
    {
      return levelData;
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
321 322 323
    /// Updates all registered parallel DOF mappings, see \ref dofMaps.
    void updateParallelDofMappings();

324 325 326 327 328 329 330
    void updateLocalGlobalNumbering();

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

331
  protected:
Thomas Witkowski's avatar
Thomas Witkowski committed
332 333 334 335 336 337 338 339
    /// Creates an initial paritioning of the mesh.
    void createInitialPartitioning();

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

    ///
340 341
    void addProblemStat(ProblemStatSeq *probStat);

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

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 355 356
    /// Calls \ref createPeriodicMap(feSpace) for all FE spaces that are
    /// handled by the mesh distributor.
    void createPeriodicMap();

357 358 359
    /// 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.  
360
    void createPeriodicMap(const FiniteElemSpace *feSpace);
361

362 363 364 365 366 367
    /// 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.
368 369
    void createMacroElementInfo();

370 371
    void updateMacroElementInfo();

372
    /** \brief
373 374 375 376 377 378
     * 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.
379
     *
380 381
     * \param[in] allBound   Defines a map from rank to interior boundaries 
     *                       which should be checked.
382
     *
383 384 385
     * \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.
386 387
     */
    bool checkAndAdaptBoundary(RankToBoundMap &allBound);
388
  
389 390 391 392
    /// Removes all periodic boundary condition information from all matrices and
    /// vectors of all stationary problems and from the mesh itself.
    void removePeriodicBoundaryConditions();

393 394 395 396
    /// 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
397
    // Removes all periodic boundaries from a given boundary map.
398
    void removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
399

400 401
    void createMeshLevelStructure();

402
    /// Writes a vector of dof pointers to an output stream.
403
    void serialize(ostream &out, DofContainer &data);
404

405 406 407 408
    /// Writes a \ref RankToDofContainer to an output stream.
    void serialize(ostream &out, 
		   map<int, map<const FiniteElemSpace*, DofContainer> > &data);

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

    /// Reads a \ref RankToDofContainer from an input stream.
414 415
    void deserialize(istream &in, 
		     map<int, map<const FiniteElemSpace*, DofContainer> > &data,
416
		     map<const FiniteElemSpace*, map<int, const DegreeOfFreedom*> > &dofIndexMap);
417 418 419

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

424
      int mapSize = data.size();
425
      SerUtil::serialize(out, mapSize);
426
      for (typename map<const DegreeOfFreedom*, T>::iterator it = data.begin();
427 428 429
	   it != data.end(); ++it) {
	int v1 = (*(it->first));
	T v2 = it->second;
430 431
	SerUtil::serialize(out, v1);
	SerUtil::serialize(out, v2);
432 433 434 435 436
      }
    }

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

442
      int mapSize = 0;
443
      SerUtil::deserialize(in, mapSize);
444 445 446
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
447 448
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
449

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

453
	data[dofIndexMap[v1]] = v2;
454 455
      }
    }
456

457
  protected:
458 459
    /// List of all stationary problems that are managed by this mesh 
    /// distributor.
460
    vector<ProblemStatSeq*> problemStat;
Thomas Witkowski's avatar
Thomas Witkowski committed
461

462 463 464
    /// If true, the mesh distributor is already initialized;
    bool initialized;

465 466 467 468 469 470
    /// The rank of the current process.
    int mpiRank;

    /// Overall number of processes.
    int mpiSize;

471 472
    /// MPI communicator collected all processes, which should be used for
    /// calculation. The Debug procces is not included in this communicator.
473 474 475
    MPI::Intracomm mpiComm;

    /// Name of the problem (as used in the init files)
476
    string name;
477

478 479
    /// Set of all different FE spaces.
    vector<const FiniteElemSpace*> feSpaces;
480
    
481 482 483
    /// Pointer to the only mesh. Note that we do not yet support multi mesh
    /// method, thus even if we consider coupled problems, all problems must
    /// be defined on the same mesh.
484 485
    Mesh *mesh;

486 487 488
    /// 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.    
489 490
    RefinementManager *refineManager;

491 492
    /// Pointer to a mesh partitioner that is used to partition the mesh to 
    /// the ranks.
493
    MeshPartitioner *partitioner;
494

495 496
    /// Weights for the elements, i.e., the number of leaf elements within 
    /// this element.
497
    map<int, double> elemWeights;
498

499 500
    /// Stores to every macro element index the number of the rank that owns this
    /// macro element.
501
    map<int, int> partitionMap;
502

503
    /// Database to store and query all sub-objects of all elements of the 
504
    /// macro mesh.
505
    ElementObjectDatabase elObjDb;
Thomas Witkowski's avatar
Thomas Witkowski committed
506

507
    /// Defines the interior boundaries of the domain that result from 
508 509
    /// partitioning the whole mesh. 
    InteriorBoundary intBoundary;
510

511 512
    InteriorBoundary intBoundarySd;

513
    DofComm dofComm;
514

515 516
    DofComm dofCommSd;

517
    PeriodicMap periodicMap;
518

519 520 521 522
    /// This set of values must be interchanged between ranks when the mesh is 
    /// repartitioned.
    vector<DOFVector<double>*> interchangeVectors;
		        
523 524 525 526
    /// 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.
527
    bool deserialized;
528

529 530 531
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

532 533 534
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;

535 536
    /// Stores the number of mesh changes that must lie in between to 
    /// repartitionings.
537 538
    int repartitionIthChange;

539 540 541
    ///
    int repartitioningWaitAfterFail;

542 543
    /// Counts the number of mesh changes after the last mesh repartitioning 
    /// was done.
544
    int nMeshChangesAfterLastRepartitioning;
545

546 547 548
    /// Countes the number of mesh repartitions that were done. Till now, this 
    /// variable is used only for debug outputs.
    int repartitioningCounter;
549

550 551 552 553 554
    /// 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;

555
    /// Directory name where all debug output files should be written to.
556
    string debugOutputDir;
557

558 559
    /// Stores the mesh change index. This is used to recognize changes in the
    /// mesh structure (e.g. through refinement or coarsening managers).
560
    long lastMeshChangeIndex;
561

562 563 564 565
    /// 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.
566
    map<int, vector<int> > macroElementNeighbours;
567

568 569
    /// Store all macro elements of the overall mesh, i.e., before the
    /// mesh is redistributed for the first time.
570
    vector<MacroElement*> allMacroElements;
571

Thomas Witkowski's avatar
Thomas Witkowski committed
572 573
    Flag createBoundaryDofFlag;

574 575 576
    /// Stores on each mesh level for all FE spaces the information about
    /// all boundary DOFs.
    vector<map<const FiniteElemSpace*, BoundaryDofInfo> > boundaryDofInfo;
577

578 579
    /// Stores information about hierarchical decomposition of the mesh levels.
    /// Is used to specify multi level solver methods.
580 581
    MeshLevelData levelData;

Thomas Witkowski's avatar
bla  
Thomas Witkowski committed
582 583 584 585 586 587
    /// 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;

588 589 590 591 592
    /// Specifies whether the global domain has periodic boundaries. Thus, this
    /// variable is not related to rank's subdomain but to the global problem
    /// and therefore the value if the same on all ranks.
    bool hasPeriodicBoundary;

593 594 595 596
    /// Set of all parallel DOF mapping object that are registered by parallel
    /// solver objects and must be updated automatically after mesh change.
    vector<ParallelDofMapping*> dofMaps;

Thomas Witkowski's avatar
Thomas Witkowski committed
597 598 599
    /// If true, detailed timings for benchmarking are printed.
    bool printTimings;

Thomas Witkowski's avatar
Thomas Witkowski committed
600
  public:
601 602 603
    /// 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
604 605
    static const Flag BOUNDARY_SUBOBJ_SORTED;

606 607 608 609 610 611 612 613 614
    /// 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
615

616 617
    static MeshDistributor *globalMeshDistributor;

618
    friend class ParallelDebug;
619 620 621
  };
}

622
#endif // AMDIS_MESHDISTRIBUTOR_H