MeshDistributor.h 21.5 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);

Thomas Witkowski's avatar
Thomas Witkowski committed
80
81
82
83
84
85
86
    /** \brief
     * Removes a registered DOF mapping from the mesh distributor.
     *
     * \param[in] dofMap   Parallel DOF mapping object to be removed.
     */
    void removeDofMap(ParallelDofMapping &dofMap);

87
88
89
    /// Adds a DOFVector to the set of \ref interchangeVecs. Thus, this vector 
    /// will be automatically interchanged between ranks when mesh is 
    /// repartitioned.
90
91
92
93
94
    void addInterchangeVector(DOFVector<double> *vec)
    {
      interchangeVectors.push_back(vec);
    }

95
96
97
98
99
100
101
    /// 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));
    }
    
102
    /** \brief
103
104
105
106
107
     * 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.
108
     *
109
110
111
112
113
     * \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.
114
     */
115
    void checkMeshChange(bool tryRepartition = true);
116

Thomas Witkowski's avatar
Thomas Witkowski committed
117
118
119
    /// 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.
120
121
    void repartitionMesh();
    
Thomas Witkowski's avatar
Thomas Witkowski committed
122
123
124
125
126
127
128
    void getImbalanceFactor(double &imbalance, 
			    int &minDofs, 
			    int &maxDofs,
			    int &sumDofs);

    double getImbalanceFactor();

129
130
131
    /// Calculates the imbalancing factor and prints it to screen.
    void printImbalanceFactor();

Thomas Witkowski's avatar
Thomas Witkowski committed
132
133
134
135
    /// 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.
136
    void testForMacroMesh();
137

Thomas Witkowski's avatar
Thomas Witkowski committed
138
    inline string getName() 
139
140
141
    { 
      return name; 
    }
142

Thomas Witkowski's avatar
Thomas Witkowski committed
143
144
145
146
147
    inline Mesh* getMesh()
    {
      return mesh;
    }

148
149
    /// Returns the periodic mapping handler, \ref periodicMap.
    inline PeriodicMap& getPeriodicMap()
150
    {
151
      return periodicMap;
152
    }
153

154
    DofComm& getDofComm()
155
    {
156
      return dofComm;
157
158
    }

159
160
161
162
163
    DofComm& getDofCommSd()
    {
      return dofCommSd;
    }

164
165
166
167
168
    InteriorBoundary& getIntBoundary()
    {
      return intBoundary;
    }

169
170
171
172
173
    InteriorBoundary& getIntBoundarySd()
    {
      return intBoundarySd;
    }

174
    inline long getLastMeshChangeIndex()
175
    {
176
      return lastMeshChangeIndex;
177
    }
178

179
    inline int getMpiRank()
180
    {
181
      return mpiRank;
182
    }
183

Thomas Witkowski's avatar
Thomas Witkowski committed
184
185
186
187
188
    inline int getMpiSize()
    {
      return mpiSize;
    }

189
190
191
    inline MPI::Intracomm& getMpiComm()
    {
      return mpiComm;
192
193
    }

194
195
196
197
198
    inline bool isInitialized()
    {
      return initialized;
    }

199
    // Writes all data of this object to an output stream.
200
    void serialize(ostream &out);
201

202
    // Reads the object data from an input stream.
203
    void deserialize(istream &in);
204
205

    /** \brief
206
207
208
209
     * 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.
210
     *
211
212
213
     * 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.
214
     */    
215
216
217
218
219
    template<typename T>
    void synchVector(DOFVector<T> &vec) 
    {
      StdMpi<vector<T> > stdMpi(mpiComm);

220
221
      const FiniteElemSpace *fe = vec.getFeSpace();

222
223
      for (DofComm::Iterator it(dofComm.getSendDofs(), fe); 
	   !it.end(); it.nextRank()) {
224
	vector<T> dofs;
225
	dofs.reserve(it.getDofs().size());
226
	
227
228
	for (; !it.endDofIter(); it.nextDof())
	  dofs.push_back(vec[it.getDofIndex()]);
229
	
230
	stdMpi.send(it.getRank(), dofs);
231
      }
232
	     
233
234
      for (DofComm::Iterator it(dofComm.getRecvDofs()); 
	   !it.end(); it.nextRank())
235
236
        stdMpi.recv(it.getRank());
	     
237
      stdMpi.startCommunication();
238

239
240
      for (DofComm::Iterator it(dofComm.getRecvDofs(), fe); 
	   !it.end(); it.nextRank())
241
242
243
	for (; !it.endDofIter(); it.nextDof())
	  vec[it.getDofIndex()] = 
	     stdMpi.getRecvData(it.getRank())[it.getDofCounter()];
244
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
245
   
Thomas Witkowski's avatar
Blub  
Thomas Witkowski committed
246
247
248
249
    /// 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);
250

Thomas Witkowski's avatar
Thomas Witkowski committed
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
279
280
281
282
283
284
285
    /// 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);
    }

286
287
288
289
290
291
    /// 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.
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
    void fix3dMeshRefinement();

    /** \brief Is used only within \ref fix3dMeshRefinement.
     * 
     * \param[in]  elems            Set of macro element indices.
     * \param[in]  edgeNoInEl       Maps from each element index in elems to a
     *                              local edge number.
     * \param[out] disconnectedEls  On output, this vector contains sets of
     *                              element indices. The union is equal to elems.
     *                              Each set contains all element indices, which
     *                              are reachable among each other by neighbour
     *                              relations. Elements within two different sets
     *                              cannot be reached via neigbourhood relation.
     */
    void helpToFix(std::set<int> &elems, 
		   map<int, int> &edgeNoInEl,
		   vector<std::set<int> > &disconnectedEls);
309

Thomas Witkowski's avatar
Thomas Witkowski committed
310
311
    void setBoundaryDofRequirement(Flag flag)
    {
312
      createBoundaryDofFlag |= flag;
Thomas Witkowski's avatar
Thomas Witkowski committed
313
314
    }

315
316
    BoundaryDofInfo& getBoundaryDofInfo(const FiniteElemSpace *feSpace,
					int level)
317
    {
318
319
320
321
322
323
324
      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];
325
326
    }

327
328
    void getAllBoundaryDofs(const FiniteElemSpace *feSpace, 
			    int level,
329
			    DofContainer& dofs);
330

Thomas Witkowski's avatar
Thomas Witkowski committed
331
    ElementObjectDatabase& getElementObjectDb() 
332
333
334
    {
      return elObjDb;
    }
335
336
337

    /// Adds a stationary problem to the global mesh distributor objects.
    static void addProblemStatGlobal(ProblemStatSeq *probStat);
Thomas Witkowski's avatar
Thomas Witkowski committed
338
339
340
341
342
343

    MeshLevelData& getMeshLevelData() 
    {
      return levelData;
    }

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

347
348
349
350
351
352
353
    void updateLocalGlobalNumbering();

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

354
  protected:
Thomas Witkowski's avatar
Thomas Witkowski committed
355
356
357
358
359
360
361
362
    /// Creates an initial paritioning of the mesh.
    void createInitialPartitioning();

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

    ///
363
364
    void addProblemStat(ProblemStatSeq *probStat);

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

Thomas Witkowski's avatar
Thomas Witkowski committed
369
    ///
Thomas Witkowski's avatar
Thomas Witkowski committed
370
371
    void createBoundaryDofs();

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

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

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

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

393
394
    void updateMacroElementInfo();

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

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

423
424
    void createMeshLevelStructure();

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

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

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

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

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

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

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

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

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

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

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

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

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

    /// Overall number of processes.
    int mpiSize;

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

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

501
502
    /// Set of all different FE spaces.
    vector<const FiniteElemSpace*> feSpaces;
503
    
504
505
506
    /// 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.
507
508
    Mesh *mesh;

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

514
515
    /// Pointer to a mesh partitioner that is used to partition the mesh to 
    /// the ranks.
516
    MeshPartitioner *partitioner;
517

518
519
    /// Weights for the elements, i.e., the number of leaf elements within 
    /// this element.
520
    map<int, double> elemWeights;
521

522
523
    /// Stores to every macro element index the number of the rank that owns this
    /// macro element.
524
    map<int, int> partitionMap;
525

526
    /// Database to store and query all sub-objects of all elements of the 
527
    /// macro mesh.
528
    ElementObjectDatabase elObjDb;
Thomas Witkowski's avatar
Thomas Witkowski committed
529

530
    /// Defines the interior boundaries of the domain that result from 
531
532
    /// partitioning the whole mesh. 
    InteriorBoundary intBoundary;
533

534
535
    InteriorBoundary intBoundarySd;

536
    DofComm dofComm;
537

538
539
    DofComm dofCommSd;

540
    PeriodicMap periodicMap;
541

542
543
544
545
    /// This set of values must be interchanged between ranks when the mesh is 
    /// repartitioned.
    vector<DOFVector<double>*> interchangeVectors;
		        
546
547
548
549
    /// 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.
550
    bool deserialized;
551

552
553
554
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

555
556
557
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;

558
559
    /// Stores the number of mesh changes that must lie in between to 
    /// repartitionings.
560
561
    int repartitionIthChange;

562
563
564
    ///
    int repartitioningWaitAfterFail;

565
566
    /// Counts the number of mesh changes after the last mesh repartitioning 
    /// was done.
567
    int nMeshChangesAfterLastRepartitioning;
568

569
570
571
    /// Countes the number of mesh repartitions that were done. Till now, this 
    /// variable is used only for debug outputs.
    int repartitioningCounter;
572

573
574
575
576
577
    /// 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;

578
    /// Directory name where all debug output files should be written to.
579
    string debugOutputDir;
580

581
582
    /// Stores the mesh change index. This is used to recognize changes in the
    /// mesh structure (e.g. through refinement or coarsening managers).
583
    long lastMeshChangeIndex;
584

585
586
587
588
    /// 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.
589
    map<int, vector<int> > macroElementNeighbours;
590

591
592
    /// Store all macro elements of the overall mesh, i.e., before the
    /// mesh is redistributed for the first time.
593
    vector<MacroElement*> allMacroElements;
594

Thomas Witkowski's avatar
Thomas Witkowski committed
595
596
    Flag createBoundaryDofFlag;

597
598
599
    /// Stores on each mesh level for all FE spaces the information about
    /// all boundary DOFs.
    vector<map<const FiniteElemSpace*, BoundaryDofInfo> > boundaryDofInfo;
600

601
602
    /// Stores information about hierarchical decomposition of the mesh levels.
    /// Is used to specify multi level solver methods.
603
604
    MeshLevelData levelData;

Thomas Witkowski's avatar
bla  
Thomas Witkowski committed
605
606
607
608
609
610
    /// 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;

611
612
613
614
615
    /// 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;

616
617
618
619
    /// 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
620
621
622
    /// If true, detailed timings for benchmarking are printed.
    bool printTimings;

Thomas Witkowski's avatar
Thomas Witkowski committed
623
  public:
624
625
626
    /// 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
627
628
    static const Flag BOUNDARY_SUBOBJ_SORTED;

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

639
640
    static MeshDistributor *globalMeshDistributor;

641
    friend class ParallelDebug;
642
643
644
  };
}

645
#endif // AMDIS_MESHDISTRIBUTOR_H