MeshDistributor.h 20.2 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()");

Thomas Witkowski's avatar
Thomas Witkowski committed
140
      TEST_EXIT_DBG(i < uniqueFeSpaces.size())("Should not happen!\n");
141

Thomas Witkowski's avatar
Thomas Witkowski committed
142
      return uniqueFeSpaces[i];
143
    }
144 145 146 147

    /// Returns all FE spaces, thus \ref feSpaces.
    inline vector<const FiniteElemSpace*>& getFeSpaces()
    {
Thomas Witkowski's avatar
Thomas Witkowski committed
148 149 150 151 152 153 154 155 156 157 158 159 160 161 162
      return uniqueFeSpaces;
    }

    inline const FiniteElemSpace* getComponentFeSpace(unsigned int i = 0)
    {
      FUNCNAME("MeshDistributor::getFeSpace()");

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

      return componentSpaces[i];
    }

    inline vector<const FiniteElemSpace*>& getComponentFeSpaces()
    {
      return componentSpaces;
163 164
    }

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

171 172 173 174 175
    inline ParallelDofMapping& getDofMapSd()
    {
      return dofMapSd;
    }

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

182
    DofComm& getDofComm()
183
    {
184
      return dofComm;
185 186
    }

187 188 189 190 191
    DofComm& getDofCommSd()
    {
      return dofCommSd;
    }

192 193 194 195 196
    InteriorBoundary& getIntBoundary()
    {
      return intBoundary;
    }

197 198 199 200 201
    InteriorBoundary& getIntBoundarySd()
    {
      return intBoundarySd;
    }

202
    inline long getLastMeshChangeIndex()
203
    {
204
      return lastMeshChangeIndex;
205
    }
206

207
    inline int getMpiRank()
208
    {
209
      return mpiRank;
210
    }
211

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

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

222 223 224 225 226
    inline bool isInitialized()
    {
      return initialized;
    }

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

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

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

248 249
      const FiniteElemSpace *fe = vec.getFeSpace();

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

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

Thomas Witkowski's avatar
Thomas Witkowski committed
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 307 308 309 310 311 312 313
    /// 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);
    }

314 315 316 317 318 319
    /// 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.
320 321
    void check3dValidMesh();

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

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

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

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

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

    MeshLevelData& getMeshLevelData() 
    {
      return levelData;
    }

356 357 358 359 360 361 362 363
    void updateLocalGlobalNumbering();

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

364
  protected:
365 366
    void addProblemStat(ProblemStatSeq *probStat);

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

Thomas Witkowski's avatar
Thomas Witkowski committed
371 372
    void createBoundaryDofs();

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

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

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

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

394 395
    void updateMacroElementInfo();

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

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

424 425
    void createMeshLevelStructure();

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

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

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

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

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

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

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

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

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

477
	data[dofIndexMap[v1]] = v2;
478 479
      }
    }
480

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

486 487 488
    /// If true, the mesh distributor is already initialized;
    bool initialized;

489 490 491 492 493 494
    /// The rank of the current process.
    int mpiRank;

    /// Overall number of processes.
    int mpiSize;

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

    /// Name of the problem (as used in the init files)
500
    string name;
501

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

505 506
    vector<const FiniteElemSpace*> uniqueFeSpaces;
    
507

508 509 510
    /// Mesh of the problem.
    Mesh *mesh;

511 512 513
    /// 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.    
514 515
    RefinementManager *refineManager;

516 517 518
    /// Info level.
    int info;

519 520
    /// Pointer to a mesh partitioner that is used to partition the mesh to 
    /// the ranks.
521
    MeshPartitioner *partitioner;
522

523 524
    /// Weights for the elements, i.e., the number of leaf elements within 
    /// this element.
525
    map<int, double> elemWeights;
526

527 528
    /// Stores to every macro element index the number of the rank that owns this
    /// macro element.
529
    map<int, int> partitionMap;
530

531
    /// Mapping object to map from local DOF indices to global ones.
532 533
    ParallelDofMapping dofMap;

534 535
    ParallelDofMapping dofMapSd;

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

540
    /// Defines the interior boundaries of the domain that result from 
541 542
    /// partitioning the whole mesh. 
    InteriorBoundary intBoundary;
543

544 545
    InteriorBoundary intBoundarySd;

546
    DofComm dofComm;
547

548 549
    DofComm dofCommSd;

550
    PeriodicMap periodicMap;
551

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

562 563 564
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

565 566 567
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;

568 569
    /// Stores the number of mesh changes that must lie in between to 
    /// repartitionings.
570 571
    int repartitionIthChange;

572 573
    /// Counts the number of mesh changes after the last mesh repartitioning 
    /// was done.
574
    int nMeshChangesAfterLastRepartitioning;
575

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

580 581 582 583 584
    /// 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;

585
    /// Directory name where all debug output files should be written to.
586
    string debugOutputDir;
587

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

592 593 594 595
    /// 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.
596
    map<int, vector<int> > macroElementNeighbours;
597

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

Thomas Witkowski's avatar
Thomas Witkowski committed
602 603
    Flag createBoundaryDofFlag;

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

608 609
    MeshLevelData levelData;

Thomas Witkowski's avatar
bla  
Thomas Witkowski committed
610 611 612 613 614 615
    /// 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
616
  public:
617 618
    static bool sebastianMode;

619 620 621
    /// 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
622 623
    static const Flag BOUNDARY_SUBOBJ_SORTED;

624 625 626 627 628 629 630 631 632
    /// 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
633

634 635
    static MeshDistributor *globalMeshDistributor;

636
    friend class ParallelDebug;
637 638 639
  };
}

640
#endif // AMDIS_MESHDISTRIBUTOR_H