MeshDistributor.h 18.7 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
27


#include <map>
28
#include <set>
29
#include <vector>
Thomas Witkowski's avatar
Thomas Witkowski committed
30
#include <mpi.h>
31

Thomas Witkowski's avatar
Thomas Witkowski committed
32
#include "parallel/InteriorBoundary.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
33
#include "Global.h"
34
35
#include "ProblemTimeInterface.h"
#include "ProblemIterationInterface.h"
36
#include "FiniteElemSpace.h"
37
#include "Serializer.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
38
#include "BoundaryManager.h"
39
#include "ElementObjectData.h"
40
41
#include "AMDiS_fwd.h"

42
namespace AMDiS {
43
44

  using namespace std;
45
  
46
47
  class ParMetisPartitioner;

48
  class MeshDistributor
49
  {
50
  protected:
Thomas Witkowski's avatar
Thomas Witkowski committed
51
    /// Defines a mapping type from DOFs to rank numbers.
52
    typedef map<const DegreeOfFreedom*, int> DofToRank;
Thomas Witkowski's avatar
Thomas Witkowski committed
53
54

    /// Defines a mapping type from DOFs to a set of rank numbers.
55
    typedef map<const DegreeOfFreedom*, std::set<int> > DofToPartitions;
Thomas Witkowski's avatar
Thomas Witkowski committed
56
57

    /// Defines a mapping type from rank numbers to sets of DOFs.
58
    typedef map<int, DofContainer> RankToDofContainer;
Thomas Witkowski's avatar
Thomas Witkowski committed
59
60

    /// Defines a mapping type from DOF indices to DOF indices.
61
    typedef map<DegreeOfFreedom, DegreeOfFreedom> DofMapping;
Thomas Witkowski's avatar
Thomas Witkowski committed
62

63
    /// Defines a mapping type from DOFs to boolean values.
64
    typedef map<const DegreeOfFreedom*, bool> DofToBool;
65

Thomas Witkowski's avatar
Thomas Witkowski committed
66
    /// Defines a mapping type from DOF indices to boolean values.
67
    typedef map<DegreeOfFreedom, bool> DofIndexToBool;
Thomas Witkowski's avatar
Thomas Witkowski committed
68

Thomas Witkowski's avatar
Thomas Witkowski committed
69
70
71
    /// Forward type (it maps rank numbers to the interior boundary objects).
    typedef InteriorBoundary::RankToBoundMap RankToBoundMap;

72
    typedef map<const DegreeOfFreedom*, DegreeOfFreedom> DofIndexMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
73

74
75
    /// Mapps a boundar type, i.e., a boundary identifier index, to a periodic 
    /// dof mapping.
76
77
78
    typedef map<BoundaryType, DofMapping> PeriodicDofMap;

    typedef vector<MeshStructure> MeshCodeVec;
79

80
  public:
81
    MeshDistributor(string str);
82
83
		          
    virtual ~MeshDistributor() {}
84

85
    void initParallelization();
86

87
    void exitParallelization();
88
89

    void addProblemStat(ProblemVec *probVec);
90

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

98
99
100
101
102
103
104
105
106
    /** \brief
     * 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.
     */
    void checkMeshChange();

107
108
109
110
111
112
113
    /** \brief
     * 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.
     */
    void testForMacroMesh();
114
115

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

118
    inline virtual string getName() 
119
120
121
    { 
      return name; 
    }
122

Thomas Witkowski's avatar
Thomas Witkowski committed
123
124
125
126
127
    inline Mesh* getMesh()
    {
      return mesh;
    }

128
129
130
131
132
    /// Returns \ref feSpace.
    inline const FiniteElemSpace* getFeSpace()
    {
      return feSpace;
    }
133
134
135
    
    /// Returns \ref nRankDOFs, the number of DOFs in the rank mesh.
    inline int getNumberRankDofs() 
136
    {
137
      return nRankDofs;
138
    }
139

140
    /// Returns \ref nOverallDofs, the global number of DOFs.
141
    inline int getNumberOverallDofs()
142
    {
143
      return nOverallDofs;
144
    }
145

Thomas Witkowski's avatar
Thomas Witkowski committed
146
147
148
149
150
    inline DofMapping& getMapLocalGlobalDofs()
    {
      return mapLocalGlobalDofs;
    }

151
    /// Maps a local dof to its global index.
152
    inline DegreeOfFreedom mapLocalToGlobal(DegreeOfFreedom dof)
153
    {
154
      return mapLocalGlobalDofs[dof];
155
    }
156

157
158
    DegreeOfFreedom mapGlobalToLocal(DegreeOfFreedom dof);

159
    /// Maps a local dof to its local index.
160
161
162
163
164
    inline DegreeOfFreedom mapLocalToDofIndex(DegreeOfFreedom dof)
    {
      return mapLocalDofIndex[dof];
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
165
166
167
168
169
170
    /// Returns the periodic mapping for all boundary DOFs in rank.
    inline PeriodicDofMap& getPeriodicMapping()
    {
      return periodicDof;
    }

171
    /// Returns for a global dof index its periodic mapping for a given boundary type.
172
    inline int getPeriodicMapping(int globalDofIndex, BoundaryType type)
173
    {
Thomas Witkowski's avatar
Thomas Witkowski committed
174
175
      FUNCNAME("MeshDistributor::getPeriodicMapping()");

176
      TEST_EXIT_DBG(periodicDof[type].count(globalDofIndex) == 1)
Thomas Witkowski's avatar
Thomas Witkowski committed
177
178
	("There is no periodic association for global DOF %d for boundary type %d!\n",
	 globalDofIndex, type);
179
180
181
182

      return periodicDof[type][globalDofIndex];
    }

183
184
185
    /// For a given global DOF index, this function returns the set of periodic
    /// associations, i.e., the boundary types the DOF is associated to, for this DOF.
    inline std::set<BoundaryType>& getPerDofAssociations(int globalDofIndex)
186
    {      
187
188
189
      TEST_EXIT_DBG(periodicDofAssociations.count(globalDofIndex)) 
 	("Should not happen!\n"); 

190
      return periodicDofAssociations[globalDofIndex];
191
    }
192

193
    /// Returns true, if the DOF (global index) is a periodic DOF.
194
    inline bool isPeriodicDof(int globalDofIndex)
195
    {
196
197
      return (periodicDofAssociations.count(globalDofIndex) > 0 &&
	       periodicDofAssociations[globalDofIndex].size() > 0);
198
199
    }

200
201
202
    /// Returns true, if the DOF (global index) is a periodic DOF for the given
    /// boundary type.
    inline bool isPeriodicDof(int globalDofIndex, BoundaryType type)
203
204
    {
      return (periodicDof[type].count(globalDofIndex) > 0);
205
206
    }

207
208
    /// Return true, if the given DOF is owned by the rank. If false, the DOF is in
    /// rank's partition, but is owned by some other rank.
209
210
    inline bool getIsRankDof(DegreeOfFreedom dof)
    {
211
212
213
214
      if (isRankDof.count(dof))
	return isRankDof[dof];

      return false;
215
    }
216

217
    inline long getLastMeshChangeIndex()
218
    {
219
      return lastMeshChangeIndex;
220
    }
221

222
223
224
225
    inline int getRstart()
    {
      return rstart;
    }
226

227
    inline int getMpiRank()
228
    {
229
      return mpiRank;
230
    }
231

Thomas Witkowski's avatar
Thomas Witkowski committed
232
233
234
235
236
    inline int getMpiSize()
    {
      return mpiSize;
    }

237
238
239
    inline MPI::Intracomm& getMpiComm()
    {
      return mpiComm;
240
241
    }

242
    inline RankToDofContainer& getSendDofs()
243
    {
244
      return sendDofs;
245
246
    }

247
    inline RankToDofContainer& getRecvDofs()
248
    {
249
      return recvDofs;
250
    }
251

252
    // Writes all data of this object to an output stream.
253
    void serialize(ostream &out);
254

255
    // Reads the object data from an input stream.
256
    void deserialize(istream &in);
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276

    /** \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 bounday, to all other ranks also
     * having these DOFs.
     *
     * 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.
     */    
    void synchVector(DOFVector<double> &vec);

    /** \brief
     * 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);

277
278
    void check3dValidMesh();

279
  protected:
280
    /** \brief
Thomas Witkowski's avatar
Thomas Witkowski committed
281
     * Determines the interior boundaries, i.e. boundaries between ranks, and stores
282
283
     * all information about them in \ref interiorBoundary.
     */
284
    void createInteriorBoundaryInfo();
285

Thomas Witkowski's avatar
Thomas Witkowski committed
286
287
288
289
290
    void updateInteriorBoundaryInfo();

    void createMeshElementData();

    void createBoundaryData();
Thomas Witkowski's avatar
Thomas Witkowski committed
291

292
293
294
    /// Removes all macro elements from the mesh that are not part of ranks partition.
    void removeMacroElements();

295
    /// Updates the local and global DOF numbering after the mesh has been changed.
296
    void updateLocalGlobalNumbering();
297

298
299
300
301
302
    /** \brief
     * Creates 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 periodicDof.
     */
303
304
    void createPeriodicMap();

305
306
    void createMacroElementInfo();

307
308
    void updateMacroElementInfo();

309
310
311
312
313
314
315
316
317
    /** \brief
     * 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.
     *
     * \param[in] allBound   Defines a map from rank to interior boundaries which 
     *                       should be checked.
318
319
320
321
     *
     * \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.
322
323
     */
    bool checkAndAdaptBoundary(RankToBoundMap &allBound);
324
325
326
327
328
329
330
331
  
    /** \brief
     * 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.
     */
    void repartitionMesh();

332
333
334
    /// Sets \ref isRankDof to all matrices and rhs vectors in all stationary problems.
    void setRankDofs();

335
336
337
338
    /// Removes all periodic boundary condition information from all matrices and
    /// vectors of all stationary problems and from the mesh itself.
    void removePeriodicBoundaryConditions();

Thomas Witkowski's avatar
Thomas Witkowski committed
339
    // Removes all periodic boundaries from a given boundary map.
340
    void removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
341

342
    /// Writes a vector of dof pointers to an output stream.
343
    void serialize(ostream &out, DofContainer &data);
344
345

    /// Reads a vector of dof pointers from an input stream.
346
347
    void deserialize(istream &in, DofContainer &data,
		     map<int, const DegreeOfFreedom*> &dofMap);
348
349

    /// Writes a \ref RankToDofContainer to an output stream.
350
    void serialize(ostream &out, RankToDofContainer &data);
351
352

    /// Reads a \ref RankToDofContainer from an input stream.
353
354
    void deserialize(istream &in, RankToDofContainer &data,
		     map<int, const DegreeOfFreedom*> &dofMap);
355

356
    /// Writes a periodic dof mapping to an output stream.
357
    void serialize(ostream &out, PeriodicDofMap &data);
358

359
    void serialize(ostream &out, map<int, std::set<int> >& data);
360

361
    /// Reads a periodic dof mapping from an input stream.
362
    void deserialize(istream &in, PeriodicDofMap &data);
363

364
    void deserialize(istream &in, map<int, std::set<int> >& data);
365

366
367
    /// Writes a mapping from dof pointers to some values to an output stream.
    template<typename T>
368
    void serialize(ostream &out, map<const DegreeOfFreedom*, T> &data)
369
    {
370
371
      FUNCNAME("ParallelDomainBase::serialize()");

372
      int mapSize = data.size();
373
      SerUtil::serialize(out, mapSize);
374
      for (typename map<const DegreeOfFreedom*, T>::iterator it = data.begin();
375
376
377
	   it != data.end(); ++it) {
	int v1 = (*(it->first));
	T v2 = it->second;
378
379
	SerUtil::serialize(out, v1);
	SerUtil::serialize(out, v2);
380
381
382
383
384
      }
    }

    /// Reads a mapping from dof pointer to some values from an input stream.
    template<typename T>
385
386
    void deserialize(istream &in, map<const DegreeOfFreedom*, T> &data,
		     map<int, const DegreeOfFreedom*> &dofMap)
387
    {
388
389
      FUNCNAME("ParallelDomainBase::deserialize()");

390
      int mapSize = 0;
391
      SerUtil::deserialize(in, mapSize);
392
393
394
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
395
396
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
397
398
399

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

400
401
402
	data[dofMap[v1]] = v2;
      }
    }
403

404
  protected:
Thomas Witkowski's avatar
Thomas Witkowski committed
405
    ///
406
    vector<ProblemVec*> probStat;
Thomas Witkowski's avatar
Thomas Witkowski committed
407

408
409
410
411
412
413
414
415
416
417
418
419
420
421
    /// The rank of the current process.
    int mpiRank;

    /// Overall number of processes.
    int mpiSize;

    /** \brief
     * MPI communicator collected all processes, which should
     * be used for calculation. The Debug procces is not included
     * in this communicator.
     */
    MPI::Intracomm mpiComm;

    /// Name of the problem (as used in the init files)
422
    string name;
423

424
425
426
    /// Finite element space of the problem.
    FiniteElemSpace *feSpace;

427
428
429
    /// Mesh of the problem.
    Mesh *mesh;

430
431
432
433
434
435
436
    /** \brief
     * 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.
     */    
    RefinementManager *refineManager;

437
438
439
    /// Info level.
    int info;

440
441
442
443
    /// Pointer to the paritioner which is used to devide a mesh into partitions.
    ParMetisPartitioner *partitioner;

    /// Weights for the elements, i.e., the number of leaf elements within this element.
444
    map<int, double> elemWeights;
445
446

    /** \brief
447
448
     * Stores to every macro element index the number of the rank that owns this
     * macro element.
449
     */
450
    map<int, int> partitionVec;
451
452

    /** \brief
453
454
     * Stores an old partitioning of elements. To every macro element index the
     * number of the rank it corresponds to is stored.
455
     */
456
    map<int, int> oldPartitionVec;    
457
   
458
    /// Number of DOFs in the rank mesh.
459
    int nRankDofs;
Thomas Witkowski's avatar
Thomas Witkowski committed
460

461
    /// Number of DOFs in the whole domain.
462
463
    int nOverallDofs;

Thomas Witkowski's avatar
Thomas Witkowski committed
464
465
466
467
    // Data structure to store all sub-objects of all elements of the macro mesh.
    ElementObjects elObjects;

    // Maps to each macro element index a pointer to the corresponding element.
468
    map<int, Element*> macroElIndexMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
469
470
    
    // Maps to each macro element index the type of this element.
471
    map<int, int> macroElIndexTypeMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
472

Thomas Witkowski's avatar
Thomas Witkowski committed
473
    /** \brief 
Thomas Witkowski's avatar
Thomas Witkowski committed
474
475
476
477
478
479
480
481
482
483
484
485
     * Defines the interior boundaries of the domain that result from partitioning
     * the whole mesh. Contains only the boundaries, which are owned by the rank, i.e.,
     * the object gives for every neighbour rank i the boundaries this rank owns and 
     * shares with rank i.
     */
    InteriorBoundary myIntBoundary;
    
    /** \brief
     * Defines the interior boundaries of the domain that result from partitioning
     * the whole mesh. Contains only the boundaries, which are not owned by the rank,
     * i.e., the object gives for every neighbour rank i the boundaries that are
     * owned by rank i and are shared with this rank.
Thomas Witkowski's avatar
Thomas Witkowski committed
486
     */
Thomas Witkowski's avatar
Thomas Witkowski committed
487
    InteriorBoundary otherIntBoundary;
Thomas Witkowski's avatar
Thomas Witkowski committed
488

489
    /** \brief
490
491
     * Defines the periodic boundaries with other ranks. Periodic boundaries have
     * no owner, as it is the case of interior boundaries.
492
493
494
     */
    InteriorBoundary periodicBoundary;

495
496
497
498
    /** \brief
     * This map contains for each rank the list of dofs the current rank must send
     * to exchange solution dofs at the interior boundaries.
     */
Thomas Witkowski's avatar
Thomas Witkowski committed
499
    RankToDofContainer sendDofs;
500
501

    /** \brief
502
503
504
     * This map contains for each rank the list of DOFs from which the current rank 
     * will receive DOF values (i.e., this are all DOFs at an interior boundary). The
     * DOF indices are given in rank's local numbering.
505
     */
Thomas Witkowski's avatar
Thomas Witkowski committed
506
    RankToDofContainer recvDofs;
507
508

    /// Maps local to global dof indices.
509
    DofMapping mapLocalGlobalDofs;
510

Thomas Witkowski's avatar
Thomas Witkowski committed
511
    /// Maps local dof indices to real dof indices.
512
    DofMapping mapLocalDofIndex;  
513
514
515
516
517
518

    /** \brief
     * Maps all DOFs in ranks partition to a bool value. If it is true, the DOF is
     * owned by the rank. Otherwise, its an interior boundary DOF that is owned by
     * another rank.
     */
519
520
    DofIndexToBool isRankDof;

521
    /** \brief
522
523
524
525
     * If periodic boundaries are used, this map stores, for each periodic boundary
     * type, for all DOFs in rank's partition (that are on periodic boundaries), the 
     * corresponding mapped periodic DOFs. The mapping is defined by using global 
     * dof indices.
526
     */
527
    PeriodicDofMap periodicDof;
528
529
530
531
532
    
    /** \brief
     * If periodic boundaries are used, this map stores to each periodic DOF in rank's
     * partition the set of periodic boundaries the DOF is associated to. In 2D, most
     * DOFs are only on one periodic boundary. Only, e.g., in a box with all boundaries
533
     * being periodic, the four corners are associated by two different boundaries.
534
     */
535
    map<int, std::set<BoundaryType> > periodicDofAssociations;
536

537
538
539
540
541
    
    /// This set of values must be interchanged between ranks when the mesh is 
    /// repartitioned.
    vector<DOFVector<double>*> interchangeVectors;
		        
542
    /// Is the index of the first row of the linear system, which is owned by the rank.
Thomas Witkowski's avatar
n  
Thomas Witkowski committed
543
    int rstart;
544

545
546
547
548
549
550
551
    /** \brief
     * 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.
     */
    bool deserialized;
552

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

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

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

562
563
    /// Counts the number of mesh changes after the last mesh repartitioning was done.
    int nMeshChangesAfterLastRepartitioning;
564

565
566
567
    /// Countes the number of mesh repartitions that were done. Till now, this 
    /// variable is used only for debug outputs.
    int repartitioningCounter;
568

569
    /// Directory name where all debug output files should be written to.
570
    string debugOutputDir;
571

572
573
574
575
576
    /** \brief
     * Stores the mesh change index. This is used to recognize changes in the mesh 
     * structure (e.g. through refinement or coarsening managers).
     */
    long lastMeshChangeIndex;
577

578
    map<int, vector<int> > macroElementNeighbours;
579

580
581
    /// Store all macro elements of the overall mesh, i.e., before the macro mesh is
    /// redistributed for the first time.
582
    vector<MacroElement*> allMacroElements;
583

584
    friend class ParallelDebug;
585
586
587
  };
}

588
#endif // AMDIS_MESHDISTRIBUTOR_H