ParallelDomainBase.h 19.5 KB
Newer Older
1
2
3
4
5
6
// ============================================================================
// ==                                                                        ==
// == AMDiS - Adaptive multidimensional simulations                          ==
// ==                                                                        ==
// ============================================================================
// ==                                                                        ==
7
// ==  TU Dresden                                                            ==
8
// ==                                                                        ==
9
10
11
// ==  Institut fr Wissenschaftliches Rechnen                               ==
// ==  Zellescher Weg 12-14                                                  ==
// ==  01069 Dresden                                                         ==
12
13
14
15
// ==  germany                                                               ==
// ==                                                                        ==
// ============================================================================
// ==                                                                        ==
16
// ==  https://gforge.zih.tu-dresden.de/projects/amdis/                      ==
17
18
19
// ==                                                                        ==
// ============================================================================

20
21
22
23
/** \file ParallelDomainBase.h */

#ifndef AMDIS_PARALLELDOMAINBASE_H
#define AMDIS_PARALLELDOMAINBASE_H
24
25
26


#include <map>
27
#include <set>
28
29
30
31
#include <vector>

#include "ProblemTimeInterface.h"
#include "ProblemIterationInterface.h"
32
#include "FiniteElemSpace.h"
33
#include "AdaptInfo.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
34
#include "InteriorBoundary.h"
35
#include "Serializer.h"
36
37
#include "AMDiS_fwd.h"

38
39
#include "petsc.h"
#include "petscsys.h"
40
#include "petscao.h"
41
42
#include "mpi.h"

43
44
#include "Global.h"

45
46
namespace AMDiS {

47
48
49
50
51
52
53
  struct DofPtrSortFct {
    bool operator() (const DegreeOfFreedom *dof0, const DegreeOfFreedom *dof1) 
    {
      return (*dof0 < *dof1);
    }
  };
   
54
55
  class ParMetisPartitioner;

56
  class ParallelDomainBase : public ProblemIterationInterface,
57
			     public ProblemTimeInterface
58
  {
Thomas Witkowski's avatar
Thomas Witkowski committed
59
60
61
62
63
64
65
66
67
68
69
70
71
  private:
    /// Defines a mapping type from DOFs to rank numbers.
    typedef std::map<const DegreeOfFreedom*, int> DofToRank;

    /// Defines a mapping type from DOFs to a set of rank numbers.
    typedef std::map<const DegreeOfFreedom*, std::set<int> > DofToPartitions;

    /// Defines a mapping type from rank numbers to sets of DOFs.
    typedef std::map<int, DofContainer> RankToDofContainer;

    /// Defines a mapping type from DOF indices to DOF indices.
    typedef std::map<DegreeOfFreedom, DegreeOfFreedom> DofMapping;

72
73
74
    /// Defines a mapping type from DOFs to boolean values.
    typedef std::map<const DegreeOfFreedom*, bool> DofToBool;

Thomas Witkowski's avatar
Thomas Witkowski committed
75
    /// Defines a mapping type from DOF indices to boolean values.
76
    typedef std::map<DegreeOfFreedom, bool> DofIndexToBool;
Thomas Witkowski's avatar
Thomas Witkowski committed
77

Thomas Witkowski's avatar
Thomas Witkowski committed
78
79
80
81
82
83
    /// Defines a mapping type from rank numbers to sets of coordinates.
    typedef std::map<int, std::vector<WorldVector<double> > > RankToCoords;

    /// Forward type (it maps rank numbers to the interior boundary objects).
    typedef InteriorBoundary::RankToBoundMap RankToBoundMap;

Thomas Witkowski's avatar
Thomas Witkowski committed
84
85
    typedef std::map<int, DofContainer> ElementIdxToDofs;

Thomas Witkowski's avatar
Thomas Witkowski committed
86
87
    typedef std::map<const DegreeOfFreedom*, DegreeOfFreedom> DofIndexMap;

88
89
    typedef std::map<DegreeOfFreedom, std::set<DegreeOfFreedom> > PeriodicDofMap;

90
  public:
91
    ParallelDomainBase(ProblemIterationInterface *iterationIF,
Thomas Witkowski's avatar
Thomas Witkowski committed
92
93
94
		       ProblemTimeInterface *timeIF,
		       FiniteElemSpace *feSpace,
		       RefinementManager *refineManager);
95

96
    virtual ~ParallelDomainBase() {}
97

98
    virtual void initParallelization(AdaptInfo *adaptInfo);
99

100
    virtual void exitParallelization(AdaptInfo *adaptInfo);
101

102
    void updateDofAdmins();    
103

104
105
106
107
108
109
110
    /** \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();
111
112
113
114
115
116

    /// Set for each element on the partitioning level the number of leaf elements.
    double setElemWeights(AdaptInfo *adaptInfo);

    void partitionMesh(AdaptInfo *adaptInfo);

117
118
119
120
121
    virtual void setTime(AdaptInfo *adaptInfo) 
    {
      if (timeIF) 
	timeIF->setTime(adaptInfo);      
    }
122

123
124
125
126
127
    virtual void initTimestep(AdaptInfo *adaptInfo) 
    {
      if (timeIF) 
	timeIF->initTimestep(adaptInfo);
    }
128

129
130
131
132
133
    virtual void closeTimestep(AdaptInfo *adaptInfo) 
    {
      if (timeIF) 
	timeIF->closeTimestep(adaptInfo);
    }
134

135
    virtual void solveInitialProblem(AdaptInfo *adaptInfo) 
136
    {     
137
138
139
      if (timeIF)
	timeIF->solveInitialProblem(adaptInfo);
    }
140
  
141
142
143
144
145
    virtual void transferInitialSolution(AdaptInfo *adaptInfo) 
    {
      if (timeIF) 
	timeIF->transferInitialSolution(adaptInfo);
    }
146

147
148
    virtual void beginIteration(AdaptInfo *adaptInfo) 
    {
149
150
151
      iterationIF->beginIteration(adaptInfo);
    }

152
    virtual Flag oneIteration(AdaptInfo *adaptInfo, Flag toDo = FULL_ITERATION);
153

154
155
    virtual Flag buildAndAdapt(AdaptInfo *adaptInfo, Flag toDo);

156
157
    virtual void endIteration(AdaptInfo *adaptInfo) 
    {
158
159
      iterationIF->endIteration(adaptInfo);
    }
160

161
162
    virtual void solve() {}

163
164
165
166
    virtual int getNumProblems() 
    {
      return 0;
    }
167

Thomas Witkowski's avatar
Thomas Witkowski committed
168
    inline virtual std::string getName() 
169
    { 
170
171
172
      return name; 
    }

173
    /// Returns \ref nRankDOFs, the number of DOFs in the rank mesh.
174
    int getNumberRankDofs() 
175
    {
176
      return nRankDofs;
177
178
    }

179
180
    void fillPetscMatrix(Matrix<DOFMatrix*> *mat, SystemVector *vec);

181
    void solvePetscMatrix(SystemVector &vec);
182

183
184
185
186
    virtual ProblemStatBase *getProblem(int number = 0) 
    {
      return NULL;
    }
187

188
    // Writes all data of this object to an output stream.
189
    virtual void serialize(std::ostream &out);
190

191
    // Reads the object data from an input stream.
192
    virtual void deserialize(std::istream &in);
193
194

  protected:
195
196
197
198
    /** \brief
     * Determine the interior boundaries, i.e. boundaries between ranks, and store
     * all information about them in \ref interiorBoundary.
     */
199
    void createInteriorBoundaryInfo();
200
201
202
203

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

204
205
206
207

    /** \brief
     * Creates from a macro mesh a correct local and global DOF index numbering.
     *
Thomas Witkowski's avatar
Thomas Witkowski committed
208
     * \param[out] rankDOFs      Returns all DOFs from the macro mesh, which are owned
209
     *                           by the rank after partitioning the macro mesh.
Thomas Witkowski's avatar
Thomas Witkowski committed
210
211
     * \param[out] nRankDOFs     Number of DOFs owned by rank.
     * \param[out] nOverallDOFs  Number of all DOFs in macro mesh.
212
     */
Thomas Witkowski's avatar
Thomas Witkowski committed
213
    void createLocalGlobalNumbering(DofContainer& rankDOFs,
214
215
216
217
				    int& nRankDOFs, 
				    int& nOverallDOFs);

    void updateLocalGlobalNumbering(int& nRankDOFs, int& nOverallDOFs);
218

219
220
221
222
223
    /** \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.
     */
224
225
    void createPeriodicMap();

226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
    /** \brief
     * This function create new mappings from local to global indices, 
     * \ref mapLocalGlobalDOFs, and from local to dof indices, \ref mapLocalToDofIndex.
     * Furthermore, using the first argument the dof indices in ranks partition are
     * changed.
     * 
     * \param[in] rankDofsNewLocalIndex       Map from dof pointers of all dofs in rank
     *                                        to new dof indices.
     * \param[in] rankOwnedDofsNewLocalIndex  Map from dof pointers of dofs owned by
     *                                        the rank to the new local index.
     * \param[in] rankDofsNewGlobalIndex      Map from dof pointers of all dofs in rank
     *                                        to the new global index.
     */
    void createLocalMappings(DofIndexMap &rankDofsNewLocalIndex,
			     DofIndexMap &rankOwnedDofsNewLocalIndex,
			     DofIndexMap &rankDofsNewGlobalIndex);

243
244
    /** \brief
     * This function traverses the whole mesh, i.e. before it is really partitioned,
Thomas Witkowski's avatar
Thomas Witkowski committed
245
246
247
     * and collects information about which DOF corresponds to which rank. Can only
     * be used, if \ref partitionVec is set correctly. This is only the case, when
     * the macro mesh is partitioned.
248
     *
Thomas Witkowski's avatar
Thomas Witkowski committed
249
     * \param[out] partionDOFs   Stores to each DOF pointer the set of ranks the DOF is
250
     *                           part of.
Thomas Witkowski's avatar
Thomas Witkowski committed
251
252
     * \param[out] rankDOFs      Stores all rank DOFs.
     * \param[out] boundaryDOFs  Stores all DOFs in ranks partition that are on an 
253
254
     *                           interior boundary but correspond to another rank.
     */
255
    void createDofMemberInfo(DofToPartitions& partitionDofs,
Thomas Witkowski's avatar
n    
Thomas Witkowski committed
256
257
			     DofContainer& rankOwnedDofs,
			     DofContainer& rankAllDofs,
258
259
			     DofToRank& boundaryDofs,
			     DofToBool& vertexDof);
Thomas Witkowski's avatar
Thomas Witkowski committed
260

261
    /// Takes a dof matrix and sends the values to the global petsc matrix.
262
263
264
    void setDofMatrix(DOFMatrix* mat, int dispMult = 1, 
		      int dispAddRow = 0, int dispAddCol = 0);

265
    /// Takes a dof vector and sends its values to a given petsc vector.
266
267
    void setDofVector(Vec& petscVec, DOFVector<double>* vec, 
		      int disMult = 1, int dispAdd = 0);
268

269
270
    void checkMeshChange();

271
    void dbgCreateElementMap(ElementIdxToDofs &elMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
272
    
273
    void dbgTestElementMap(ElementIdxToDofs &elMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
274

275
    void dbgTestInteriorBoundary();
276
     
Thomas Witkowski's avatar
Thomas Witkowski committed
277
278
279
280
281
    /** \brief
     * This function is used for debugging only. It traverses all interior boundaries
     * and compares the dof indices on them with the dof indices of the boundarys
     * neighbours. The function fails, when dof indices on an interior boundary does
     * not fit together.
282
283
284
     *
     * \param  printCoords   If true, the coords of all common dofs are printed to
     *                       the screen.
Thomas Witkowski's avatar
Thomas Witkowski committed
285
     */
286
    void dbgTestCommonDofs(bool printCoords = false);
287

288
289
290
291
292
293
    /** \brief
     * This function is used for debugging only. It prints all information from
     * the local to global dof mapping, see \ref mapLocalGlobalDOFs.
     *
     * \param  rank  If specified, only the information from the given rank is printed.
     */
294
    void printMapLocalGlobal(int rank = -1);
295
296
297
298
299
300
301

    /** \brief
     * This function is used for debugging only. It prints all information about
     * the periodic mapping of dofs, that are on periodic boundaries.
     *
     * \param  rank  If specified, only the information from the given rank is printed.
     */
302
303
304
305
306
307
308
309
310
311
312
313
    void printMapPeriodic(int rank = -1);

    /** \brief
     * This function is used for debugging only. It prints information about dofs
     * in rank's partition.
     *
     * \param  rank         If specified, only the information from the given 
     *                      rank is printed.
     * \param  rankDofs     List of all dofs in ranks partition that are owned by rank.
     * \param  rankAllDofs  List of all dofs in ranks partition.
     */
    void printRankDofs(int rank, DofContainer& rankDofs, DofContainer& rankAllDofs);
314

315
316
317
318
319
320
321
    /** \brief
     * This functions create a Paraview file with the macro mesh where the elements
     * are colored by the partition they are part of. This function can be used for
     * debugging.
     */
    void writePartitioningMesh(std::string filename);

322
323
324
325
326
327
328
329
330
331
332
333
    /** \brief
     * This function must be used if the values of a SystemVector 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 this DOF.
     *
     * This function must be used, for example, after the lineary system is solved, or
     * after the SystemVector is set by some user defined functions, e.g., initial
     * solution functions.
     */
    void synchVectors(SystemVector &vec);

334
335
336
337
338
339
340
341
342
343
344
345
346
    /// Writes a vector of dof pointers to an output stream.
    void serialize(std::ostream &out, DofContainer &data);

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

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

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

348
349
350
351
352
353
    /// Writes a periodic dof mapping to an output stream.
    void serialize(std::ostream &out, PeriodicDofMap &data);

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

354
355
356
357
358
    /// Writes a mapping from dof pointers to some values to an output stream.
    template<typename T>
    void serialize(std::ostream &out, std::map<const DegreeOfFreedom*, T> &data)
    {
      int mapSize = data.size();
359
      SerUtil::serialize(out, mapSize);
360
361
362
363
      for (typename std::map<const DegreeOfFreedom*, T>::iterator it = data.begin();
	   it != data.end(); ++it) {
	int v1 = (*(it->first));
	T v2 = it->second;
364
365
	SerUtil::serialize(out, v1);
	SerUtil::serialize(out, v2);
366
367
368
369
370
371
372
373
      }
    }

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

376
      int mapSize = 0;
377
      SerUtil::deserialize(in, mapSize);
378
379
380
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
381
382
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
383
384
385

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

386
387
388
389
	data[dofMap[v1]] = v2;
      }
    }
		        
390
391
    inline void orderDofs(const DegreeOfFreedom* dof0,
			  const DegreeOfFreedom* dof1,
Thomas Witkowski's avatar
Thomas Witkowski committed
392
393
394
			  const DegreeOfFreedom* dof2,
			  DofContainer &vec)
    {
395
      DofPtrSortFct dofPtrSort;
Thomas Witkowski's avatar
Thomas Witkowski committed
396
      vec.resize(3);
397
398
399
400
401
      vec[0] = dof0; 
      vec[1] = dof1; 
      vec[2] = dof2;
      sort(vec.begin(), vec.end(), dofPtrSort);
    }
Thomas Witkowski's avatar
Thomas Witkowski committed
402

403
404
405
406
407
408
409
410
411
412
413
414
415
    inline void orderDofs(const DegreeOfFreedom* dof0,
			  const DegreeOfFreedom* dof1,
			  const DegreeOfFreedom* dof2,
			  const DegreeOfFreedom* dof3,
			  DofContainer &vec)
    {
      DofPtrSortFct dofPtrSort;
      vec.resize(4);
      vec[0] = dof0; 
      vec[1] = dof1; 
      vec[2] = dof2;
      vec[3] = dof3;
      sort(vec.begin(), vec.end(), dofPtrSort);
Thomas Witkowski's avatar
Thomas Witkowski committed
416
417
    }

418
419
420
421
422
423
424
425
    inline void printColValues(int row,
			       std::vector<int>& cols,
			       std::vector<double>& values)
    {
      for (int i = 0; i < static_cast<int>(cols.size()); i++)
	std::cout << "Mat[" << row  << "][" << cols[i] << "] = " << values[i] << "\n";
    }

426
  protected:
427
428
429
430
431
432
    ///
    ProblemIterationInterface *iterationIF;

    ///
    ProblemTimeInterface *timeIF;

433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
    /// 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)
    std::string name;

449
450
451
    /// Finite element space of the problem.
    FiniteElemSpace *feSpace;

452
453
454
    /// Mesh of the problem.
    Mesh *mesh;

455
456
457
    /// Info level.
    int info;

458
459
460
    /// Refinement manager for the mesh.
    RefinementManager *refinementManager;

461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
    /// 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.
    std::map<int, double> elemWeights;

    /// Is true, if the mesh was not partitioned before, otherwise it's false.
    bool initialPartitionMesh;

    /** \brief
     * Stores to every coarse element index the number of the partition it 
     * corresponds to.
     */
    std::map<int, int> partitionVec;

    /** \brief
     * Stores an old partitioning of elements. To every element index the number
     * of the parition it corresponds to is stored.
     */
    std::map<int, int> oldPartitionVec;    
481

482
    /// Petsc's matrix structure.
483
484
    Mat petscMatrix;

485
486
487
488
489
    /** \brief
     * Petsc's vector structures for the rhs vector, the solution vector and a
     * temporary vector for calculating the final residuum.
     */
    Vec petscRhsVec, petscSolVec, petscTmpVec;
490
    
491
    /// Number of DOFs in the rank mesh.
492
    int nRankDofs;
Thomas Witkowski's avatar
Thomas Witkowski committed
493
494

    /** \brief 
Thomas Witkowski's avatar
Thomas Witkowski committed
495
496
497
498
499
500
501
502
503
504
505
506
     * 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
507
     */
Thomas Witkowski's avatar
Thomas Witkowski committed
508
    InteriorBoundary otherIntBoundary;
Thomas Witkowski's avatar
Thomas Witkowski committed
509

510
511
512
513
514
    /** \brief
     *
     */
    InteriorBoundary periodicBoundary;

515
516
517
518
    /** \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
519
    RankToDofContainer sendDofs;
520
521
522
523
524

    /** \brief
     * This map contains for each rank the list of dofs from which the current rank 
     * must receive solution values of dofs at the interior boundaries.
     */
Thomas Witkowski's avatar
Thomas Witkowski committed
525
    RankToDofContainer recvDofs;
526
527

    /// Maps local to global dof indices.
Thomas Witkowski's avatar
Thomas Witkowski committed
528
    DofMapping mapLocalGlobalDOFs;
529

Thomas Witkowski's avatar
Thomas Witkowski committed
530
    /// Maps local dof indices to real dof indices.
531
    DofMapping mapLocalToDofIndex;  
532
533
534
535
536
537

    /** \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.
     */
538
539
    DofIndexToBool isRankDof;

540
541
542
543
    /** \brief
     * Maps every dof pointer in ranks macro mesh to a boolean variable indicating 
     * wheather this dof is a vertex dof (true) or not (false).
     */
544
    DofToBool vertexDof;
Thomas Witkowski's avatar
n    
Thomas Witkowski committed
545

546
547
548
549
550
    /** \brief
     * If periodic boundaries are used, this map stores to each dof in rank's 
     * partition, that is on periodic boundaries, the corresponding periodic dofs.
     * The mapping is defined by using global dof indices.
     */
551
552
    PeriodicDofMap periodicDof;

553
    /// 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
554
    int rstart;
555

556
557
558
559
    /** \brief
     * Number of components of the equation. Is used to calculate the exact number
     * of rows in the the overall linear system.
     */
560
    int nComponents;
561

562
    /// Number of rows of the whole linear system that are stored on this rank.
563
564
    int nRankRows;

565
    /// Overall number of the rows in the lineary system.
566
    int nOverallRows;
567
568
569
570
571
572
573
574

    /** \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;
575
576
577
578
579
580

    /** \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;
581
582
583
584
  };

}

585
#endif // AMDIS_PARALLELDOMAINBASE_H