MeshDistributor.h 25.2 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
/******************************************************************************
 *
 * AMDiS - Adaptive multidimensional simulations
 *
 * Copyright (C) 2013 Dresden University of Technology. All Rights Reserved.
 * Web: https://fusionforge.zih.tu-dresden.de/projects/amdis
 *
 * Authors: 
 * Simon Vey, Thomas Witkowski, Andreas Naumann, Simon Praetorius, et al.
 *
 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
 *
 *
 * This file is part of AMDiS
 *
 * See also license.opensource.txt in the distribution.
 * 
 ******************************************************************************/
20
21


22

23
/** \file MeshDistributor.h */
24

25
26
#ifndef AMDIS_MESHDISTRIBUTOR_H
#define AMDIS_MESHDISTRIBUTOR_H
27
28


Thomas Witkowski's avatar
Thomas Witkowski committed
29
#include <mpi.h>
30
#include "parallel/DofComm.h"
31
#include "parallel/ElementObjectDatabase.h"
32
#include "parallel/ParallelTypes.h"
33
#include "parallel/MeshLevelData.h"
34
#include "parallel/MeshPartitioner.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
35
#include "parallel/InteriorBoundary.h"
36
#include "parallel/ParallelDofMapping.h"
37
#include "parallel/PeriodicMap.h"
38
#include "parallel/StdMpi.h"
39
#include "AMDiS_fwd.h"
40
#include "Containers.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
41
#include "Global.h"
42
43
#include "ProblemTimeInterface.h"
#include "ProblemIterationInterface.h"
44
#include "FiniteElemSpace.h"
45
#include "Serializer.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
46
#include "BoundaryManager.h"
47
48
49
#include <string>

#include "operations/functors.hpp"
50

51
namespace AMDiS { namespace Parallel {
52

Thomas Witkowski's avatar
Thomas Witkowski committed
53
54
55

  struct BoundaryDofInfo
  {
56
    std::map<GeoIndex, DofContainerSet> geoDofs;
Thomas Witkowski's avatar
Thomas Witkowski committed
57
58
  };

59

60
  class MeshDistributor
61
  {
62
  private:
63
    MeshDistributor();
64
65
	          
  public:
Thomas Witkowski's avatar
Thomas Witkowski committed
66
67
    ~MeshDistributor();

68
    /// Initialization of mesh distributor.
69
    void initParallelization();
70

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

74
75
76
77
78
79
80
81
    /** \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
82
83
84
85
86
87
88
    /** \brief
     * Removes a registered DOF mapping from the mesh distributor.
     *
     * \param[in] dofMap   Parallel DOF mapping object to be removed.
     */
    void removeDofMap(ParallelDofMapping &dofMap);

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

99
100
101
102
103
104
105
106
107
108
109
110
    /// Removes the pointer to DOFVector @param vec from the
    /// set of interchange vectors.
    template< typename T >
    void removeInterchangeVector(DOFVector<T> *vec) {}
    void removeInterchangeVector(DOFVector< double >* vec)
    {
      std::vector< DOFVector< double >* >::iterator it;
      it = std::find(interchangeVectors.begin(), interchangeVectors.end(), vec);
      if ( it != interchangeVectors.end())
        interchangeVectors.erase(it);
    }

111
    /// Adds all DOFVectors of a SystemVector to \ref interchangeVecs.
112
    void addInterchangeVector(SystemVector *vec);
113
114
115

    /// The same as for DOFVectors
    void removeInterchangeVector(SystemVector* vec);
116
    
117
    /** \brief
118
     * This function checks if the mesh has changed on at least one rank. In 
119
120
121
122
     * 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.
123
     *
124
125
126
127
128
     * \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.
129
     */
130
    void checkMeshChange(bool tryRepartition = true);
131

Thomas Witkowski's avatar
Thomas Witkowski committed
132
133
134
    /// 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.
Siqi Ling's avatar
Siqi Ling committed
135
    bool repartitionMesh();
136
    
137
    
Thomas Witkowski's avatar
Thomas Witkowski committed
138
139
140
141
142
143
144
    void getImbalanceFactor(double &imbalance, 
			    int &minDofs, 
			    int &maxDofs,
			    int &sumDofs);

    double getImbalanceFactor();

145
146
147
    /// Calculates the imbalancing factor and prints it to screen.
    void printImbalanceFactor();

Thomas Witkowski's avatar
Thomas Witkowski committed
148
149
150
151
    /// 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.
152
    void testForMacroMesh();
153

154
    inline std::string getName() 
155
156
157
    { 
      return name; 
    }
158

159
160
161
162
163
164
    inline Mesh* getMacroMesh()
    {
      return macroMesh;
    }
    
    inline Mesh* getMesh(int i = 0)
Thomas Witkowski's avatar
Thomas Witkowski committed
165
    {
166
167
168
169
170
171
      return meshes[i];
    }
    
    inline int getNumberOfMeshes()
    {
      return meshes.size();
Thomas Witkowski's avatar
Thomas Witkowski committed
172
173
    }

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

180
    DofComm& getDofComm(int level)
181
    {
182
      return dofComm[level];
183
    }
184
185
186
187
188
189
190
191
192
193
    
    DofComm& getDofComm(Mesh* mesh, int level)
    {
      return dofComms[mesh][level];
    }
    
    std::map<Mesh*, MultiLevelDofComm>& getDofComms()
    {
      return dofComms;
    }
194

195
    InteriorBoundary& getIntBoundary(int level)
196
    {
197
      return intBoundary[level];
198
    }
199
200
201
202
203
    
    std::map<int, int>& getPartitionMap()
    {
      return partitionMap;
    }
204

205
    inline long getLastMeshChangeIndex()
206
    {
207
208
209
210
211
212
213
214
215
216
      int overallMeshChangeIndex = 0;
      for(size_t i = 0; i < meshes.size(); i++) {
	overallMeshChangeIndex += lastMeshChangeIndexs[meshes[i]];
      }
      return overallMeshChangeIndex;
    }
    
    inline long getLastMeshChangeIndex(Mesh* m)
    {
      return lastMeshChangeIndexs[m];
217
    }
218

219
    inline int getMpiRank()
220
    {
221
      return mpiRank;
222
    }
223

224
    inline int getMpiSize(int level)
Thomas Witkowski's avatar
Thomas Witkowski committed
225
    {
226
      return levelData.getMpiComm(level).Get_size();
Thomas Witkowski's avatar
Thomas Witkowski committed
227
228
    }

229
    inline MPI::Intracomm& getMpiComm(int level)
230
    {
231
      return levelData.getMpiComm(level);
232
233
    }

234
235
236
237
238
    inline bool isInitialized()
    {
      return initialized;
    }

239
    // Writes all data of this object to an output stream.
240
    void serialize(std::ostream &out);
241

242
    // Reads the object data from an input stream.
243
    void deserialize(std::istream &in);
244
245
246
247
248
249
    
    /// Works quite similar to the function \ref synchVector, but instead the 
    /// values of subdomain vectors are combined along the boundaries, by a
    /// binary functor. 
    template<typename T, typename Operator>
    void synchVector(DOFVector<T> &vec, Operator op)
250
    {
251
252
      const FiniteElemSpace *fe = vec.getFeSpace();

253
254
      int nLevels = levelData.getNumberOfLevels();
      for (int level = nLevels - 1; level >= 0; level--) {
255
	StdMpi<std::vector<T> > stdMpi(levelData.getMpiComm(level));
256

257
	for (DofComm::Iterator it(dofComm[level].getRecvDofs(), fe);
258
	     !it.end(); it.nextRank()) {
259
	  std::vector<T> dofs;
260
261
262
263
264
265
266
267
	  dofs.reserve(it.getDofs().size());
	  
	  for (; !it.endDofIter(); it.nextDof())
	    dofs.push_back(vec[it.getDofIndex()]);
	  
	  stdMpi.send(it.getRank(), dofs);
	}
	
268
	for (DofComm::Iterator it(dofComm[level].getSendDofs()); 
269
270
	     !it.end(); it.nextRank())
	  stdMpi.recv(it.getRank());
271
	
272
	stdMpi.startCommunication();
273
	
274
	for (DofComm::Iterator it(dofComm[level].getSendDofs(), fe); 
275
276
	     !it.end(); it.nextRank())
	  for (; !it.endDofIter(); it.nextDof())
277
278
	    op(vec[it.getDofIndex()],
	       stdMpi.getRecvData(it.getRank())[it.getDofCounter()]);
279
      }
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
      if (!boost::is_same<Operator, functors::assign<T> >::value)
	synchVector(vec);
    }
    
    /** \brief
     * 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 
     * boundary, to all other ranks also having these DOFs.
     *
     * This function must be used, for example, after the linear system is
     * solved, or after the DOFVector is set by some user defined functions, 
     * e.g., initial solution functions.
     */    
    template<typename T>
    void synchVector(DOFVector<T> &vec) 
    {
      synchVector(vec, functors::assign<T>());
298
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
299
   
Thomas Witkowski's avatar
Blub  
Thomas Witkowski committed
300
301
302
    /// 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.
303
    void synchVector(SystemVector &vec);
304
    
305
306
    /// Works quite similar to the function \ref synchVector, but instead the 
    /// values of subdomain vectors are add along the boundaries.
Thomas Witkowski's avatar
Thomas Witkowski committed
307
308
309
    template<typename T>
    void synchAddVector(DOFVector<T> &vec)
    {
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
      const FiniteElemSpace *fe = vec.getFeSpace();

      int nLevels = levelData.getNumberOfLevels();
      for (int level = nLevels - 1; level >= 0; level--) {
	StdMpi<std::vector<T> > stdMpi(levelData.getMpiComm(level));

	for (DofComm::Iterator it(dofComm[level].getRecvDofs(), fe);
	     !it.end(); it.nextRank()) {
	  std::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[level].getSendDofs()); 
	     !it.end(); it.nextRank())
	  stdMpi.recv(it.getRank());
	
	stdMpi.startCommunication();
	
	for (DofComm::Iterator it(dofComm[level].getSendDofs(), fe); 
	     !it.end(); it.nextRank())
	  for (; !it.endDofIter(); it.nextDof())
	    vec[it.getDofIndex()] += 
	      stdMpi.getRecvData(it.getRank())[it.getDofCounter()];
      }

      synchVector(vec);
Thomas Witkowski's avatar
Thomas Witkowski committed
341
342
    }

343
344
345
346
347
348
    /// 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.
349
350
351
352
353
354
355
356
357
358
359
360
361
    void fix3dMeshRefinement();

    /** \brief Is used only within \ref fix3dMeshRefinement.
     * 
     * \param[in]  elems            Set of macro element indices.
     * \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, 
362
		   std::vector<std::set<int> > &disconnectedEls);
363

Thomas Witkowski's avatar
Thomas Witkowski committed
364
365
    void setBoundaryDofRequirement(Flag flag)
    {
366
      createBoundaryDofFlag |= flag;
Thomas Witkowski's avatar
Thomas Witkowski committed
367
368
    }

369
370
    BoundaryDofInfo& getBoundaryDofInfo(const FiniteElemSpace *feSpace,
					int level)
371
    {
372
373
374
375
376
377
378
      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];
379
380
    }

381
382
    void getAllBoundaryDofs(const FiniteElemSpace *feSpace, 
			    int level,
383
			    DofContainer& dofs);
384

Thomas Witkowski's avatar
Thomas Witkowski committed
385
    ElementObjectDatabase& getElementObjectDb() 
386
387
388
    {
      return elObjDb;
    }
389
390
391

    /// Adds a stationary problem to the global mesh distributor objects.
    static void addProblemStatGlobal(ProblemStatSeq *probStat);
Thomas Witkowski's avatar
Thomas Witkowski committed
392
393
394
395
396

    MeshLevelData& getMeshLevelData() 
    {
      return levelData;
    }
397
398
399
400
401
402
403
404
    
    /// Update dof communicators, boundary dof info and the parallel dof mappings.
    /// If it is called for all meshes, \ref updateLocalGlobalNumbering is automatically
    /// called inside. If it is used for each mesh seperately, please don't forget to 
    /// add \ref updateLocalGlobalNumbering to update the global matrix index.
    void updateDofRelatedStruct();
    
    void updateDofRelatedStruct(Mesh* mesh);
Thomas Witkowski's avatar
Thomas Witkowski committed
405

406
    void updateLocalGlobalNumbering();
407
408
409
410
411
412
    
    /// set variable \ref repartitioningAllowed
    void setRepartitioningAllowed(bool allowed)
    {
      repartitioningAllowed = allowed;
    }
Siqi Ling's avatar
Siqi Ling committed
413
414
415
416
417
    
    void setElementWeights(std::map<int, double>& elWgts)
    {
      elemWeights = elWgts;
    }
418

419
  protected:
420
421
422
423
424
425
426
427
428
429
430
431
    /// Rebuild only part of the mesh domain, which is necessary
    void quickRepartition(Mesh* mesh);
    
    /// Rebuild whole mesh domain
    void fullRepartition(Mesh* mesh);
    
    /// Updates all registered parallel DOF mappings, see \ref dofMaps.
    void updateDofsToDofMapping(Mesh* mesh = NULL);

    /// Updates the DOF after the mesh has been changed, see \ref dofMaps.
    void updateDofsToDofMapping(ParallelDofMapping &dmap,
				    const FiniteElemSpace *feSpace);
432
433
434
435
    
    /// Checks if repartition is needed.
    bool isRepartitionNecessary();
    
436
    /// Creates an initial partitioning of the mesh.
Thomas Witkowski's avatar
Thomas Witkowski committed
437
438
439
440
441
    void createInitialPartitioning();

    /// Set for each element on the partitioning level the number of 
    /// leaf elements.
    void setInitialElementWeights();
442
443
444
445
    
    /// Calculates \ref elemWeights with the gloabl max weight and 
    /// global sum of weight.
    void calculateElemWeights();
Thomas Witkowski's avatar
Thomas Witkowski committed
446
447

    ///
448
449
    void addProblemStat(ProblemStatSeq *probStat);

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

Thomas Witkowski's avatar
Thomas Witkowski committed
454
    ///
455
    void createBoundaryDofs(Mesh* mesh = NULL);
Thomas Witkowski's avatar
Thomas Witkowski committed
456

457
458
    /// Removes all macro elements from the mesh that are not part of ranks 
    /// partition.
459
460
    void removeMacroElements();

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

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

470
471
472
473
474
475
    /// 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.
476
477
    void createMacroElementInfo();

478
479
    void updateMacroElementInfo();

480
    /** \brief
481
482
483
484
485
486
     * 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.
487
     *
488
489
     * \param[in] allBound   Defines a map from rank to interior boundaries 
     *                       which should be checked.
490
     * \param[in] mesh       The mesh the interior boundaries belong to.
491
     *
492
493
494
     * \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.
495
     */
496
    bool checkAndAdaptBoundary(RankToBoundMap &allBound, Mesh* mesh);
497
  
498
499
500
501
    /// Removes all periodic boundary condition information from all matrices and
    /// vectors of all stationary problems and from the mesh itself.
    void removePeriodicBoundaryConditions();

502
503
504
505
    /// 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
506
    // Removes all periodic boundaries from a given boundary map.
507
    void removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
508

509
510
    void createMeshLevelStructure();

511
    /// Writes a vector of dof pointers to an output stream.
512
    void serialize(std::ostream &out, DofContainer &data);
513

514
    /// Writes a \ref RankToDofContainer to an output stream.
515
516
    void serialize(std::ostream &out, 
		   std::map<int, std::map<const FiniteElemSpace*, DofContainer> > &data);
517

518
    /// Reads a vector of dof pointers from an input stream.
519
520
    void deserialize(std::istream &in, DofContainer &data,
		     std::map<int, const DegreeOfFreedom*> &dofIndexMap);
521
522

    /// Reads a \ref RankToDofContainer from an input stream.
523
524
525
    void deserialize(std::istream &in, 
		     std::map<int, std::map<const FiniteElemSpace*, DofContainer> > &data,
		     std::map<const FiniteElemSpace*, std::map<int, const DegreeOfFreedom*> > &dofIndexMap);
526
527
528

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

533
      int mapSize = data.size();
534
      SerUtil::serialize(out, mapSize);
535
      for (typename std::map<const DegreeOfFreedom*, T>::iterator it = data.begin();
536
537
538
	   it != data.end(); ++it) {
	int v1 = (*(it->first));
	T v2 = it->second;
539
540
	SerUtil::serialize(out, v1);
	SerUtil::serialize(out, v2);
541
542
543
544
545
      }
    }

    /// Reads a mapping from dof pointer to some values from an input stream.
    template<typename T>
546
547
    void deserialize(std::istream &in, std::map<const DegreeOfFreedom*, T> &data,
		     std::map<int, const DegreeOfFreedom*> &dofIndexMap)
548
    {
549
550
      FUNCNAME("ParallelDomainBase::deserialize()");

551
      int mapSize = 0;
552
      SerUtil::deserialize(in, mapSize);
553
554
555
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
556
557
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
558

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

562
	data[dofIndexMap[v1]] = v2;
563
564
      }
    }
565

566
  protected:
567
568
    /// List of all stationary problems that are managed by this mesh 
    /// distributor.
569
    std::vector<ProblemStatSeq*> problemStat;
Thomas Witkowski's avatar
Thomas Witkowski committed
570

571
572
573
    /// If true, the mesh distributor is already initialized;
    bool initialized;

574
575
576
577
    /// The rank of the current process.
    int mpiRank;

    /// Name of the problem (as used in the init files)
578
    std::string name;
579

580
    /// Set of all different FE spaces.
581
    std::vector<const FiniteElemSpace*> feSpaces;
582
    
583
584
585
586
587
588
589
590
591
592
    /// Always equal to meshes[0] which is used as macro
    /// mesh. For example, passed to \ref meshPartitioner.
    Mesh *macroMesh;
    
    /// Meshes to be managed for parallelization. Currently only two meshes
    /// are allowed since multi mesh method is limited to two meshes.
    std::vector<Mesh*> meshes;
    
    /// Stores the map of meshes and the corresponding FE spaces defined on them
    MeshToFeSpaces meshToFeSpaces;
593

594
595
596
    /// 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.    
597
598
    RefinementManager *refineManager;

599
600
    /// Pointer to a mesh partitioner that is used to partition the mesh to 
    /// the ranks.
601
    MeshPartitioner *partitioner;
602

603
604
605
606
607
608
    /// Pointer to a mesh partitioner that is used for the very first 
    /// partitioning of the mesh. In most cases, this pointer points to the
    /// same object as \ref partitioner, but this must not be the case in
    /// general.
    MeshPartitioner *initialPartitioner;

609
610
    /// Weights for the elements, i.e., the number of leaf elements within 
    /// this element.
611
    std::map<int, double> elemWeights;
612

613
614
    /// Stores to every macro element index the number of the rank that owns this
    /// macro element.
615
    std::map<int, int> partitionMap;
616

617
    /// Database to store and query all sub-objects of all elements of the 
618
    /// macro mesh.
619
    ElementObjectDatabase elObjDb;
Thomas Witkowski's avatar
Thomas Witkowski committed
620

621
    /// Defines the interior boundaries of the domain that result from 
622
    /// partitioning the whole mesh. 
623
    MultiLevelInteriorBoundary intBoundary;
624

625
    /// Dof communicator object // TODO: to be deleted
626
    MultiLevelDofComm dofComm;
627
628
629
    
    /// Dof communicator objects for each mesh
    std::map<Mesh*, MultiLevelDofComm> dofComms;
630

631
    PeriodicMap periodicMap;
632

633
634
    /// This set of values must be interchanged between ranks when the mesh is 
    /// repartitioned.
635
    std::vector<DOFVector<double>*> interchangeVectors;
636
		        
637
638
639
640
    /// 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.
641
    bool deserialized;
642

643
644
645
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

646
647
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;
648
649
650
    
    /// repartition the mesh (only) the first time repartitionMesh() is called
    bool repartitionOnlyOnce;
651

652
    /// Stores the number of mesh changes that must lie in between two 
653
    /// repartitionings.
654
655
    int repartitionIthChange;

656
657
658
    ///
    int repartitioningWaitAfterFail;

659
660
    /// Counts the number of mesh changes after the last mesh repartitioning 
    /// was done.
661
    int nMeshChangesAfterLastRepartitioning;
662

663
664
665
    /// Countes the number of mesh repartitions that were done. Till now, this 
    /// variable is used only for debug outputs.
    int repartitioningCounter;
666

667
668
669
670
671
    /// 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;

672
    /// Directory name where all debug output files should be written to.
673
    std::string debugOutputDir;
674

675
676
    /// Stores the mesh change index. This is used to recognize changes in the
    /// mesh structure (e.g. through refinement or coarsening managers).
677
    std::map<Mesh*, long> lastMeshChangeIndexs;
678

679
680
681
682
    /// 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.
683
    std::map<int, std::vector<int> > macroElementNeighbours;
684

685
686
    /// Store all macro elements of the overall mesh, i.e., before the
    /// mesh is redistributed for the first time.
687
688
689
    /// Store all macro elements of the overall mesh, i.e., before the
    /// mesh is redistributed for the first time.   
    std::map<Mesh*, std::vector<MacroElement*> > allMacroElements;
690

Thomas Witkowski's avatar
Thomas Witkowski committed
691
692
    Flag createBoundaryDofFlag;

693
694
    /// Stores on each mesh level for all FE spaces the information about
    /// all boundary DOFs.
695
    std::vector<std::map<const FiniteElemSpace*, BoundaryDofInfo> > boundaryDofInfo;
696

697
698
    /// Stores information about hierarchical decomposition of the mesh levels.
    /// Is used to specify multi level solver methods.
699
700
    MeshLevelData levelData;

Thomas Witkowski's avatar
bla  
Thomas Witkowski committed
701
702
703
704
705
706
    /// 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;

707
708
709
710
711
    /// 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;

712
713
    /// Set of all parallel DOF mapping object that are registered by parallel
    /// solver objects and must be updated automatically after mesh change.
714
    std::vector<ParallelDofMapping*> dofMaps;
715

Thomas Witkowski's avatar
Thomas Witkowski committed
716
717
718
    /// If true, detailed timings for benchmarking are printed.
    bool printTimings;

719
720
721
    /// If true, detailed information about memory usage are printed.
    bool printMemoryUsage;

Thomas Witkowski's avatar
Thomas Witkowski committed
722
  public:
723
724
725
    /// The boundary DOFs are sorted by subobject entities, i.e., first all
    /// face DOFs, edge DOFs and to the last vertex DOFs will be set to
    /// communication structure vectors, \ref sendDofs and \ref recvDofs.
Thomas Witkowski's avatar
Thomas Witkowski committed
726
727
    static const Flag BOUNDARY_SUBOBJ_SORTED;

728
729
730
731
732
733
734
735
736
    /// When boundary DOFs are created, \ref boundaryDofInfo is filled for
    /// all DOFs that this rank will send to other ranks (thus, rank 
    /// owned DOFs.
    static const Flag BOUNDARY_FILL_INFO_SEND_DOFS;

    /// When boundary DOFs are created, \ref boundaryDofInfo is filled for
    /// all DOFs that this rank will receive from other ranks (thus, DOFs
    /// that are owned by another rank).
    static const Flag BOUNDARY_FILL_INFO_RECV_DOFS;
Thomas Witkowski's avatar
Thomas Witkowski committed
737

738
739
    static MeshDistributor *globalMeshDistributor;

740
    friend class ParallelDebug;
741
  };
742
} }
743

744
#endif // AMDIS_MESHDISTRIBUTOR_H