ParallelDomainBase.h 12.5 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
124
    virtual Flag oneIteration(AdaptInfo *adaptInfo, Flag toDo = FULL_ITERATION) 
    {
125
126
127
      ERROR_EXIT("Not implemented!\n");
      return 0;
    }
128

129
130
    virtual void endIteration(AdaptInfo *adaptInfo) 
    {
131
132
      iterationIF->endIteration(adaptInfo);
    }
133

134
135
136
137
    virtual int getNumProblems() 
    {
      return 0;
    }
138

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

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

150
151
    void fillPetscMatrix(DOFMatrix *mat, DOFVector<double> *vec);

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

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

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

    virtual void deserialize(std::istream&) {}
162
163
164


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

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

174
175
176
177

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

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

189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
    /** \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
206
207
208
    void addAllVertexDOFs(Element *el, int ithEdge, DofContainer& dofs);

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

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

Thomas Witkowski's avatar
Thomas Witkowski committed
227
228
229
    void DbgCreateElementMap(ElementIdxToDofs &elMap);
    
    void DbgTestElementMap(ElementIdxToDofs &elMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
230
231

    void DbgTestInteriorBoundary();
232
     
Thomas Witkowski's avatar
Thomas Witkowski committed
233
234
235
236
237
    /** \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.
238
239
240
     *
     * \param  printCoords   If true, the coords of all common dofs are printed to
     *                       the screen.
Thomas Witkowski's avatar
Thomas Witkowski committed
241
     */
242
    void DbgTestCommonDofs(bool printCoords = false);
243

Thomas Witkowski's avatar
Thomas Witkowski committed
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
    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;
    }

273
  protected:
274
275
276
277
278
279
    ///
    ProblemIterationInterface *iterationIF;

    ///
    ProblemTimeInterface *timeIF;

280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
    /// 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;

296
297
298
    /// Finite element space of the problem.
    FiniteElemSpace *feSpace;

299
300
301
    /// Mesh of the problem.
    Mesh *mesh;

302
303
304
    /// Info level.
    int info;

305
306
307
    /// Refinement manager for the mesh.
    RefinementManager *refinementManager;

308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
    /// 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;    
328

329
330
331
332
    Mat petscMatrix;

    Vec petscRhsVec;
    
333
    Vec petscSolVec;
334

335
336
    /// Number of DOFs in the rank mesh.
    int nRankDOFs;
Thomas Witkowski's avatar
Thomas Witkowski committed
337
338

    /** \brief 
Thomas Witkowski's avatar
Thomas Witkowski committed
339
340
341
342
343
344
345
346
347
348
349
350
     * 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
351
     */
Thomas Witkowski's avatar
Thomas Witkowski committed
352
    InteriorBoundary otherIntBoundary;
Thomas Witkowski's avatar
Thomas Witkowski committed
353

354
355
356
357
    /** \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
358
    RankToDofContainer sendDofs;
359
360
361
362
363

    /** \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
364
    RankToDofContainer recvDofs;
365
366

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

369
370
    /// Maps local dof indices to realy dof indices.
    DofMapping mapLocalToDofIndex;  
371
372
373
374
375
376

    /** \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
377
378
379
    DofToBool isRankDof;

    int rstart;
380
381
382
383
  };

}

384
#endif // AMDIS_PARALLELDOMAINBASE_H