ParallelDomainBase.h 12.8 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                          ==
// ==                                                                        ==
// ============================================================================
// ==                                                                        ==
// ==  crystal growth group                                                  ==
// ==                                                                        ==
// ==  Stiftung caesar                                                       ==
// ==  Ludwig-Erhard-Allee 2                                                 ==
// ==  53175 Bonn                                                            ==
// ==  germany                                                               ==
// ==                                                                        ==
// ============================================================================
// ==                                                                        ==
// ==  http://www.caesar.de/cg/AMDiS                                         ==
// ==                                                                        ==
// ============================================================================

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
36
#include "AMDiS_fwd.h"

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

42
43
#include "Global.h"

44
45
46
47
namespace AMDiS {

  class ParMetisPartitioner;

48
  class ParallelDomainBase : public ProblemIterationInterface,
49
			     public ProblemTimeInterface
50
  {
Thomas Witkowski's avatar
Thomas Witkowski committed
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
  private:
    /// Defines type for a vector of DOFs.
    typedef std::vector<const DegreeOfFreedom*> DofContainer;

    /// 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;

    /// Defines a mapping type from DOF indices to boolean values.
    typedef std::map<DegreeOfFreedom, bool> DofToBool;

Thomas Witkowski's avatar
Thomas Witkowski committed
70
71
72
73
74
75
    /// 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
76
77
    typedef std::map<int, DofContainer> ElementIdxToDofs;

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

80
  public:
81
    ParallelDomainBase(const std::string& name,
Thomas Witkowski's avatar
Thomas Witkowski committed
82
83
84
85
		       ProblemIterationInterface *iterationIF,
		       ProblemTimeInterface *timeIF,
		       FiniteElemSpace *feSpace,
		       RefinementManager *refineManager);
86

87
    virtual ~ParallelDomainBase() {}
88

89
    virtual void initParallelization(AdaptInfo *adaptInfo);
90

91
92
    void exitParallelization(AdaptInfo *adaptInfo);

93
94
    void updateDofAdmins();

95
96
97
98
99
100
101
    /** \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();
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117

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

    void partitionMesh(AdaptInfo *adaptInfo);

    virtual void setTime(AdaptInfo *adaptInfo) {}

    virtual void initTimestep(AdaptInfo *adaptInfo) {}

    virtual void closeTimestep(AdaptInfo *adaptInfo) {}

    virtual void solveInitialProblem(AdaptInfo *adaptInfo) {}
  
    virtual void transferInitialSolution(AdaptInfo *adaptInfo) {}

118
119
    virtual void beginIteration(AdaptInfo *adaptInfo) 
    {
120
121
122
      iterationIF->beginIteration(adaptInfo);
    }

123
    virtual Flag oneIteration(AdaptInfo *adaptInfo, Flag toDo = FULL_ITERATION);
124

125
126
    virtual void endIteration(AdaptInfo *adaptInfo) 
    {
127
128
      iterationIF->endIteration(adaptInfo);
    }
129

130
131
    virtual void solve() {}

132
133
134
135
    virtual int getNumProblems() 
    {
      return 0;
    }
136

137
138
    inline virtual const std::string& getName() 
    { 
139
140
141
      return name; 
    }

142
    /// Returns \ref nRankDOFs, the number of DOFs in the rank mesh.
143
144
    int getNumberRankDOFs() 
    {
145
146
147
      return nRankDOFs;
    }

148
149
    void fillPetscMatrix(DOFMatrix *mat, DOFVector<double> *vec);

150
151
    void fillPetscMatrix(Matrix<DOFMatrix*> *mat, SystemVector *vec);

152
153
    void solvePetscMatrix(DOFVector<double> *vec);

154
155
    void solvePetscMatrix(SystemVector *vec);

156
157
158
159
    virtual ProblemStatBase *getProblem(int number = 0) 
    {
      return NULL;
    }
160
161
162
163

    virtual void serialize(std::ostream&) {}

    virtual void deserialize(std::istream&) {}
164
165
166


  protected:
167
168
169
170
    /** \brief
     * Determine the interior boundaries, i.e. boundaries between ranks, and store
     * all information about them in \ref interiorBoundary.
     */
171
    void createInteriorBoundaryInfo(DofContainer& rankDOFs);
172
173
174
175

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

176
177
178
179

    /** \brief
     * Creates from a macro mesh a correct local and global DOF index numbering.
     *
Thomas Witkowski's avatar
Thomas Witkowski committed
180
     * \param[out] rankDOFs      Returns all DOFs from the macro mesh, which are owned
181
     *                           by the rank after partitioning the macro mesh.
Thomas Witkowski's avatar
Thomas Witkowski committed
182
183
     * \param[out] nRankDOFs     Number of DOFs owned by rank.
     * \param[out] nOverallDOFs  Number of all DOFs in macro mesh.
184
     */
Thomas Witkowski's avatar
Thomas Witkowski committed
185
    void createLocalGlobalNumbering(DofContainer& rankDOFs,
186
187
188
189
				    int& nRankDOFs, 
				    int& nOverallDOFs);

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

191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
    /** \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);

Thomas Witkowski's avatar
Thomas Witkowski committed
208
209
210
    void addAllVertexDOFs(Element *el, int ithEdge, DofContainer& dofs);

    void addAllEdgeDOFs(Element *el, int ithEdge, DofContainer& dofs);
Thomas Witkowski's avatar
Thomas Witkowski committed
211

212
213
    /** \brief
     * This function traverses the whole mesh, i.e. before it is really partitioned,
Thomas Witkowski's avatar
Thomas Witkowski committed
214
215
216
     * 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.
217
     *
Thomas Witkowski's avatar
Thomas Witkowski committed
218
     * \param[out] partionDOFs   Stores to each DOF pointer the set of ranks the DOF is
219
     *                           part of.
Thomas Witkowski's avatar
Thomas Witkowski committed
220
221
     * \param[out] rankDOFs      Stores all rank DOFs.
     * \param[out] boundaryDOFs  Stores all DOFs in ranks partition that are on an 
222
223
     *                           interior boundary but correspond to another rank.
     */
Thomas Witkowski's avatar
n    
Thomas Witkowski committed
224
225
226
227
    void createDOFMemberInfo(DofToPartitions& partitionDofs,
			     DofContainer& rankOwnedDofs,
			     DofContainer& rankAllDofs,
			     DofToRank& boundaryDofs);
Thomas Witkowski's avatar
Thomas Witkowski committed
228

229
230
231
232
233
    void setDofMatrix(DOFMatrix* mat, int dispMult = 1, 
		      int dispAddRow = 0, int dispAddCol = 0);

    void setDofVector(DOFVector<double>* vec, int disMult = 1, int dispAdd = 0);

Thomas Witkowski's avatar
Thomas Witkowski committed
234
235
236
    void DbgCreateElementMap(ElementIdxToDofs &elMap);
    
    void DbgTestElementMap(ElementIdxToDofs &elMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
237
238

    void DbgTestInteriorBoundary();
239
     
Thomas Witkowski's avatar
Thomas Witkowski committed
240
241
242
243
244
    /** \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.
245
246
247
     *
     * \param  printCoords   If true, the coords of all common dofs are printed to
     *                       the screen.
Thomas Witkowski's avatar
Thomas Witkowski committed
248
     */
249
    void DbgTestCommonDofs(bool printCoords = false);
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
    inline void orderDOFs(const DegreeOfFreedom* dof1,
			  const DegreeOfFreedom* dof2,
			  const DegreeOfFreedom* dof3,
			  DofContainer &vec)
    {
      vec.resize(3);

      if (*dof1 < *dof2 && *dof1 < *dof3)
	vec[0] = dof1;
      else if (*dof2 < *dof1 && *dof2 < *dof3)
	vec[0] = dof2;
      else 
	vec[0] = dof3;

      if (*dof1 > *dof2 && *dof1 > *dof3)
	vec[2] = dof1;
      else if (*dof2 > *dof1 && *dof2 > *dof3)
	vec[2] = dof2;
      else 
	vec[2] = dof3;

      if (dof1 != vec[0] && dof1 != vec[2]) 
	vec[1] = dof1;
      else if (dof2 != vec[0] && dof2 != vec[2]) 
	vec[1] = dof2;
      else
	vec[1] = dof3;
    }

280
  protected:
281
282
283
284
285
286
    ///
    ProblemIterationInterface *iterationIF;

    ///
    ProblemTimeInterface *timeIF;

287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
    /// 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;

303
304
305
    /// Finite element space of the problem.
    FiniteElemSpace *feSpace;

306
307
308
    /// Mesh of the problem.
    Mesh *mesh;

309
310
311
    /// Info level.
    int info;

312
313
314
    /// Refinement manager for the mesh.
    RefinementManager *refinementManager;

315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
    /// 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;    
335

336
337
338
339
    Mat petscMatrix;

    Vec petscRhsVec;
    
340
    Vec petscSolVec;
341

342
343
    /// Number of DOFs in the rank mesh.
    int nRankDOFs;
Thomas Witkowski's avatar
Thomas Witkowski committed
344
345

    /** \brief 
Thomas Witkowski's avatar
Thomas Witkowski committed
346
347
348
349
350
351
352
353
354
355
356
357
     * 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
358
     */
Thomas Witkowski's avatar
Thomas Witkowski committed
359
    InteriorBoundary otherIntBoundary;
Thomas Witkowski's avatar
Thomas Witkowski committed
360

361
362
363
364
    /** \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
365
    RankToDofContainer sendDofs;
366
367
368
369
370

    /** \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
371
    RankToDofContainer recvDofs;
372
373

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

376
377
    /// Maps local dof indices to realy dof indices.
    DofMapping mapLocalToDofIndex;  
378
379
380
381
382
383

    /** \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.
     */
Thomas Witkowski's avatar
n    
Thomas Witkowski committed
384
385
386
    DofToBool isRankDof;

    int rstart;
387
388

    int nComponents;
389
390
391
392
  };

}

393
#endif // AMDIS_PARALLELDOMAINBASE_H