Liebe Gitlab-Nutzer, lieber Gitlab-Nutzer, es ist nun möglich sich mittels des ZIH-Logins/LDAP an unserem Dienst anzumelden. Ein Anmelden über dieses erzeugt ein neues Konto. Das alte Konto ist über den Reiter "Standard" erreichbar. Die Administratoren

Dear Gitlab user, it is now possible to log in to our service using the ZIH login/LDAP. Logging in via this will create a new account. The old account can be accessed via the "Standard" tab. The administrators

MeshDistributor.h 18.2 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 98 99
    /** \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();

100 101 102 103 104 105 106
    /** \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();
107 108

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

111
    inline virtual string getName() 
112 113 114
    { 
      return name; 
    }
115

Thomas Witkowski's avatar
Thomas Witkowski committed
116 117 118 119 120
    inline Mesh* getMesh()
    {
      return mesh;
    }

121 122 123 124 125
    /// Returns \ref feSpace.
    inline const FiniteElemSpace* getFeSpace()
    {
      return feSpace;
    }
126 127 128
    
    /// Returns \ref nRankDOFs, the number of DOFs in the rank mesh.
    inline int getNumberRankDofs() 
129
    {
130
      return nRankDofs;
131
    }
132

133
    /// Returns \ref nOverallDofs, the global number of DOFs.
134
    inline int getNumberOverallDofs()
135
    {
136
      return nOverallDofs;
137
    }
138

Thomas Witkowski's avatar
Thomas Witkowski committed
139 140 141 142 143
    inline DofMapping& getMapLocalGlobalDofs()
    {
      return mapLocalGlobalDofs;
    }

144
    /// Maps a local dof to its global index.
145
    inline DegreeOfFreedom mapLocalToGlobal(DegreeOfFreedom dof)
146
    {
147
      return mapLocalGlobalDofs[dof];
148
    }
149

150 151
    DegreeOfFreedom mapGlobalToLocal(DegreeOfFreedom dof);

152
    /// Maps a local dof to its local index.
153 154 155 156 157
    inline DegreeOfFreedom mapLocalToDofIndex(DegreeOfFreedom dof)
    {
      return mapLocalDofIndex[dof];
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
158 159 160 161 162 163
    /// Returns the periodic mapping for all boundary DOFs in rank.
    inline PeriodicDofMap& getPeriodicMapping()
    {
      return periodicDof;
    }

164
    /// Returns for a global dof index its periodic mapping for a given boundary type.
165
    inline int getPeriodicMapping(int globalDofIndex, BoundaryType type)
166
    {
Thomas Witkowski's avatar
Thomas Witkowski committed
167 168
      FUNCNAME("MeshDistributor::getPeriodicMapping()");

169
      TEST_EXIT_DBG(periodicDof[type].count(globalDofIndex) == 1)
Thomas Witkowski's avatar
Thomas Witkowski committed
170 171
	("There is no periodic association for global DOF %d for boundary type %d!\n",
	 globalDofIndex, type);
172 173 174 175

      return periodicDof[type][globalDofIndex];
    }

176 177 178
    /// 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)
179
    {      
180 181 182
      TEST_EXIT_DBG(periodicDofAssociations.count(globalDofIndex)) 
 	("Should not happen!\n"); 

183
      return periodicDofAssociations[globalDofIndex];
184
    }
185

186
    /// Returns true, if the DOF (global index) is a periodic DOF.
187
    inline bool isPeriodicDof(int globalDofIndex)
188
    {
189 190
      return (periodicDofAssociations.count(globalDofIndex) > 0 &&
	       periodicDofAssociations[globalDofIndex].size() > 0);
191 192
    }

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

200 201
    /// 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.
202 203
    inline bool getIsRankDof(DegreeOfFreedom dof)
    {
204 205 206 207
      if (isRankDof.count(dof))
	return isRankDof[dof];

      return false;
208
    }
209

210
    inline long getLastMeshChangeIndex()
211
    {
212
      return lastMeshChangeIndex;
213
    }
214

215 216 217 218
    inline int getRstart()
    {
      return rstart;
    }
219

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

Thomas Witkowski's avatar
Thomas Witkowski committed
225 226 227 228 229
    inline int getMpiSize()
    {
      return mpiSize;
    }

230 231 232
    inline MPI::Intracomm& getMpiComm()
    {
      return mpiComm;
233 234
    }

235
    inline RankToDofContainer& getSendDofs()
236
    {
237
      return sendDofs;
238 239
    }

240
    inline RankToDofContainer& getRecvDofs()
241
    {
242
      return recvDofs;
243
    }
244

245
    // Writes all data of this object to an output stream.
246
    void serialize(ostream &out);
247

248
    // Reads the object data from an input stream.
249
    void deserialize(istream &in);
250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269

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

270
  protected:
271
    /** \brief
Thomas Witkowski's avatar
Thomas Witkowski committed
272
     * Determines the interior boundaries, i.e. boundaries between ranks, and stores
273 274
     * all information about them in \ref interiorBoundary.
     */
275
    void createInteriorBoundaryInfo();
276

Thomas Witkowski's avatar
Thomas Witkowski committed
277 278 279 280 281
    void updateInteriorBoundaryInfo();

    void createMeshElementData();

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

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

286
    /// Updates the local and global DOF numbering after the mesh has been changed.
287
    void updateLocalGlobalNumbering();
288

289 290 291 292 293
    /** \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.
     */
294 295
    void createPeriodicMap();

296 297
    void createMacroElementInfo();

298 299
    void updateMacroElementInfo();

300 301 302 303 304 305 306 307 308 309 310 311 312
    /** \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.
     * 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.
     *
     * \param[in] allBound   Defines a map from rank to interior boundaries which 
     *                       should be checked.
     */
    bool checkAndAdaptBoundary(RankToBoundMap &allBound);
313 314 315 316 317 318 319 320
  
    /** \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();

321 322 323 324 325
    /** \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.
     */
326
    void writePartitioningMesh(string filename);
327

328 329 330
    /// Sets \ref isRankDof to all matrices and rhs vectors in all stationary problems.
    void setRankDofs();

331 332 333 334
    /// 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
335
    // Removes all periodic boundaries from a given boundary map.
336
    void removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
337

338
    /// Writes a vector of dof pointers to an output stream.
339
    void serialize(ostream &out, DofContainer &data);
340 341

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

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

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

352
    /// Writes a periodic dof mapping to an output stream.
353
    void serialize(ostream &out, PeriodicDofMap &data);
354

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

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

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

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

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

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

386
      int mapSize = 0;
387
      SerUtil::deserialize(in, mapSize);
388 389 390
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
391 392
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
393 394 395

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

396 397 398
	data[dofMap[v1]] = v2;
      }
    }
399 400

  public:
401
    vector<DOFVector<double>* > testVec;
402
		        
403
  protected:
Thomas Witkowski's avatar
Thomas Witkowski committed
404
    ///
405
    vector<ProblemVec*> probStat;
Thomas Witkowski's avatar
Thomas Witkowski committed
406

407 408 409 410 411 412 413 414 415 416 417 418 419 420
    /// 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)
421
    string name;
422

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

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

429 430 431 432 433 434 435
    /** \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;

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

439 440 441 442
    /// 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.
443
    map<int, double> elemWeights;
444 445

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

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

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

Thomas Witkowski's avatar
Thomas Witkowski committed
463 464 465 466
    // 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.
467
    map<int, Element*> macroElIndexMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
468 469
    
    // Maps to each macro element index the type of this element.
470
    map<int, int> macroElIndexTypeMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
471

Thomas Witkowski's avatar
Thomas Witkowski committed
472
    /** \brief 
Thomas Witkowski's avatar
Thomas Witkowski committed
473 474 475 476 477 478 479 480 481 482 483 484
     * 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
485
     */
Thomas Witkowski's avatar
Thomas Witkowski committed
486
    InteriorBoundary otherIntBoundary;
Thomas Witkowski's avatar
Thomas Witkowski committed
487

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

494 495 496 497
    /** \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
498
    RankToDofContainer sendDofs;
499 500

    /** \brief
501 502 503
     * 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.
504
     */
Thomas Witkowski's avatar
Thomas Witkowski committed
505
    RankToDofContainer recvDofs;
506 507

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

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

    /** \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.
     */
518 519
    DofIndexToBool isRankDof;

520
    /** \brief
521 522 523 524
     * 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.
525
     */
526
    PeriodicDofMap periodicDof;
527 528 529 530 531
    
    /** \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
532
     * being periodic, the four corners are associated by two different boundaries.
533
     */
534
    map<int, std::set<BoundaryType> > periodicDofAssociations;
535

536
    /// 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
537
    int rstart;
538

539 540 541 542 543 544 545
    /** \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;
546

547 548 549
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

550 551 552
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;

553 554
    int repartitionIthChange;

555 556
    int nTimestepsAfterLastRepartitioning;

557 558
    int repartCounter;

559
    /// Directory name where all debug output files should be written to.
560
    string debugOutputDir;
561

562 563 564 565 566
    /** \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;
567

568
    map<int, vector<int> > macroElementNeighbours;
569

570 571
    /// Store all macro elements of the overall mesh, i.e., before the macro mesh is
    /// redistributed for the first time.
572
    vector<MacroElement*> allMacroElements;
573

574
    friend class ParallelDebug;
575 576 577
  };
}

578
#endif // AMDIS_MESHDISTRIBUTOR_H