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 19.5 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


Thomas Witkowski's avatar
Thomas Witkowski committed
27
#include <mpi.h>
28
#include "parallel/DofComm.h"
29
#include "parallel/ElementObjectDatabase.h"
30
#include "parallel/ParallelTypes.h"
31
#include "parallel/MeshLevelData.h"
32
#include "parallel/MeshPartitioner.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
33
#include "parallel/InteriorBoundary.h"
34
#include "parallel/ParallelDofMapping.h"
35
#include "parallel/PeriodicMap.h"
36
#include "parallel/StdMpi.h"
37
#include "AMDiS_fwd.h"
38
#include "Containers.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
39
#include "Global.h"
40 41
#include "ProblemTimeInterface.h"
#include "ProblemIterationInterface.h"
42
#include "FiniteElemSpace.h"
43
#include "Serializer.h"
Thomas Witkowski's avatar
Thomas Witkowski committed
44
#include "BoundaryManager.h"
45
#include "SystemVector.h"
46

47
namespace AMDiS {
48 49

  using namespace std;
Thomas Witkowski's avatar
Thomas Witkowski committed
50 51 52 53


  struct BoundaryDofInfo
  {
54
    map<GeoIndex, DofContainerSet> geoDofs;
Thomas Witkowski's avatar
Thomas Witkowski committed
55 56
  };

57

58
  class MeshDistributor
59
  {
60
  private:
61
    MeshDistributor();
62
	          
63
    virtual ~MeshDistributor() {}
64

65
  public:
66
    void initParallelization();
67

68
    void exitParallelization();
69

70 71 72
    /// Adds a DOFVector to the set of \ref interchangeVecs. Thus, this vector 
    /// will be automatically interchanged between ranks when mesh is 
    /// repartitioned.
73 74 75 76 77
    void addInterchangeVector(DOFVector<double> *vec)
    {
      interchangeVectors.push_back(vec);
    }

78 79 80 81 82 83 84
    /// Adds all DOFVectors of a SystemVector to \ref interchangeVecs.
    void addInterchangeVector(SystemVector *vec)
    {
      for (int i = 0; i < vec->getSize(); i++)
	interchangeVectors.push_back(vec->getDOFVector(i));
    }
    
85
    /** \brief
86 87 88 89 90
     * 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.
91
     *
92 93 94 95 96
     * \param[in]  tryRepartition   If this parameter is true, repartitioning 
     *                              may be done. This depends on several other 
     *                              parameters. If the parameter is false, the 
     *                              mesh is only checked and adapted but never 
     *                              repartitioned.
97
     */
98
    void checkMeshChange(bool tryRepartition = true);
99

100 101 102 103 104 105 106 107 108 109
    /** \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();
    
    /// Calculates the imbalancing factor and prints it to screen.
    void printImbalanceFactor();

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

118 119
    /// Set for each element on the partitioning level the number of 
    /// leaf elements.
120
    void setInitialElementWeights();
121

122
    inline virtual string getName() 
123 124 125
    { 
      return name; 
    }
126

Thomas Witkowski's avatar
Thomas Witkowski committed
127 128 129 130 131
    inline Mesh* getMesh()
    {
      return mesh;
    }

132 133
    /// Returns an FE space from \ref feSpaces.
    inline const FiniteElemSpace* getFeSpace(unsigned int i = 0)
134
    {
135 136 137 138 139
      FUNCNAME("MeshDistributor::getFeSpace()");

      TEST_EXIT_DBG(i < feSpaces.size())("Should not happen!\n");

      return feSpaces[i];
140
    }
141 142 143 144 145 146 147

    /// Returns all FE spaces, thus \ref feSpaces.
    inline vector<const FiniteElemSpace*>& getFeSpaces()
    {
      return feSpaces;
    }

148 149
    /// Returns the DOF mapping object, \ref dofMap.
    inline ParallelDofMapping& getDofMap()
Thomas Witkowski's avatar
Thomas Witkowski committed
150
    {
151
      return dofMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
152 153
    }

154 155
    /// Returns the periodic mapping handler, \ref periodicMap.
    inline PeriodicMap& getPeriodicMap()
156
    {
157
      return periodicMap;
158
    }
159

160
    DofComm& getSendDofs()
161 162 163 164
    {
      return sendDofs;
    }

165
    DofComm& getRecvDofs()
166 167 168 169
    {
      return recvDofs;
    }

170 171 172 173 174
    DofComm& getPeriodicDofs()
    {
      return periodicDofs;
    }

175
    inline long getLastMeshChangeIndex()
176
    {
177
      return lastMeshChangeIndex;
178
    }
179

180
    inline int getMpiRank()
181
    {
182
      return mpiRank;
183
    }
184

Thomas Witkowski's avatar
Thomas Witkowski committed
185 186 187 188 189
    inline int getMpiSize()
    {
      return mpiSize;
    }

190 191 192
    inline MPI::Intracomm& getMpiComm()
    {
      return mpiComm;
193 194
    }

195 196 197 198 199
    inline bool isInitialized()
    {
      return initialized;
    }

200
    // Writes all data of this object to an output stream.
201
    void serialize(ostream &out);
202

203
    // Reads the object data from an input stream.
204
    void deserialize(istream &in);
205 206

    /** \brief
207 208 209 210
     * 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.
211
     *
212 213 214
     * 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.
215
     */    
216 217 218 219 220
    template<typename T>
    void synchVector(DOFVector<T> &vec) 
    {
      StdMpi<vector<T> > stdMpi(mpiComm);

221 222
      const FiniteElemSpace *fe = vec.getFeSpace();

223
      for (DofComm::Iterator it(sendDofs, fe); !it.end(); it.nextRank()) {
224
	vector<T> dofs;
225
	dofs.reserve(it.getDofs().size());
226
	
227 228
	for (; !it.endDofIter(); it.nextDof())
	  dofs.push_back(vec[it.getDofIndex()]);
229
	
230
	stdMpi.send(it.getRank(), dofs);
231
      }
232 233 234 235
	     
      for (DofComm::Iterator it(recvDofs); !it.end(); it.nextRank())
        stdMpi.recv(it.getRank());
	     
236
      stdMpi.startCommunication();
237 238 239 240 241

      for (DofComm::Iterator it(recvDofs, fe); !it.end(); it.nextRank())
	for (; !it.endDofIter(); it.nextDof())
	  vec[it.getDofIndex()] = 
	     stdMpi.getRecvData(it.getRank())[it.getDofCounter()];
242 243
    }
    
244
    /** \brief
245 246 247
     * 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.
248 249 250
     */
    void synchVector(SystemVector &vec);

251 252
    void check3dValidMesh();

Thomas Witkowski's avatar
Thomas Witkowski committed
253 254 255 256 257
    void setBoundaryDofRequirement(Flag flag)
    {
      createBoundaryDofFlag = flag;
    }

258 259
    BoundaryDofInfo& getBoundaryDofInfo(const FiniteElemSpace *feSpace, 
					int level = 0)
260
    {
261 262 263 264 265 266 267
      FUNCNAME("MeshDistributor::getBoundaryDofInfo()");

      TEST_EXIT_DBG(level < static_cast<int>(boundaryDofInfo.size()))
	("Wrong level number: %d, whereas array size is %d!\n", 
	 level, boundaryDofInfo.size());

      return boundaryDofInfo[level][feSpace];
268 269
    }

270 271
    void getAllBoundaryDofs(const FiniteElemSpace *feSpace, 
			    int level,
272
			    DofContainer& dofs);
273

274 275 276 277
    const ElementObjectDatabase& getElementObjectDb() 
    {
      return elObjDb;
    }
278 279 280

    /// Adds a stationary problem to the global mesh distributor objects.
    static void addProblemStatGlobal(ProblemStatSeq *probStat);
Thomas Witkowski's avatar
Thomas Witkowski committed
281 282 283 284 285 286

    MeshLevelData& getMeshLevelData() 
    {
      return levelData;
    }

287
  protected:
288 289
    void addProblemStat(ProblemStatSeq *probStat);

290 291
    /// Determines the interior boundaries, i.e. boundaries between ranks, and
    /// stores all information about them in \ref interiorBoundary.
292
    void createInteriorBoundaryInfo();
293

Thomas Witkowski's avatar
Thomas Witkowski committed
294 295 296 297 298
    void updateInteriorBoundaryInfo();

    void createMeshElementData();

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

Thomas Witkowski's avatar
Thomas Witkowski committed
300 301
    void createBoundaryDofs();

302
    void createBoundaryDofs(const FiniteElemSpace *feSpace, int level);
303

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

308 309
    void updateLocalGlobalNumbering();

310 311
    /// Updates the local and global DOF numbering after the mesh has been 
    /// changed.
312
    void updateLocalGlobalNumbering(const FiniteElemSpace *feSpace);
313

314 315 316 317
    /// Calls \ref createPeriodicMap(feSpace) for all FE spaces that are
    /// handled by the mesh distributor.
    void createPeriodicMap();

318
    /** \brief
319 320 321 322
     * Creates, for a specific FE space, 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 periodicDofMap.
     */    
323
    void createPeriodicMap(const FiniteElemSpace *feSpace);
324

325 326 327 328 329 330 331 332
    /** \brief
     * This function is called only once during the initialization when the
     * whole macro mesh is available on all cores. It copies the pointers of all
     * macro elements to \ref allMacroElements and stores all neighbour 
     * information based on macro element indices (and not pointer based) in 
     * \ref macroElementNeighbours. These information are then used to 
     * reconstruct macro elements during mesh redistribution.
     */
333 334
    void createMacroElementInfo();

335 336
    void updateMacroElementInfo();

337
    /** \brief
338 339 340 341 342 343
     * 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.
344
     *
345 346
     * \param[in] allBound   Defines a map from rank to interior boundaries 
     *                       which should be checked.
347
     *
348 349 350
     * \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.
351 352
     */
    bool checkAndAdaptBoundary(RankToBoundMap &allBound);
353
  
354 355
    /// Sets \ref isRankDof to all matrices and rhs vectors in a given 
    /// stationary problem.
356
    void setRankDofs(ProblemStatSeq *probStat);
357

358 359
    /// Sets \ref isRankDof to all matrices and rhs vectors in all 
    /// stationary problems.
360 361
    void setRankDofs();

362 363 364 365
    /// Removes all periodic boundary condition information from all matrices and
    /// vectors of all stationary problems and from the mesh itself.
    void removePeriodicBoundaryConditions();

366 367 368 369
    /// Removes all periodic boundary condition information from all matrices and
    /// vector of a given stationary problem.
    void removePeriodicBoundaryConditions(ProblemStatSeq *probStat);

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

373 374
    void createMeshLevelStructure();

375
    /// Writes a vector of dof pointers to an output stream.
376
    void serialize(ostream &out, DofContainer &data);
377

378 379 380 381
    /// Writes a \ref RankToDofContainer to an output stream.
    void serialize(ostream &out, 
		   map<int, map<const FiniteElemSpace*, DofContainer> > &data);

382
    /// Reads a vector of dof pointers from an input stream.
383
    void deserialize(istream &in, DofContainer &data,
384
		     map<int, const DegreeOfFreedom*> &dofIndexMap);
385 386

    /// Reads a \ref RankToDofContainer from an input stream.
387 388
    void deserialize(istream &in, 
		     map<int, map<const FiniteElemSpace*, DofContainer> > &data,
389
		     map<const FiniteElemSpace*, map<int, const DegreeOfFreedom*> > &dofIndexMap);
390 391 392

    /// Writes a mapping from dof pointers to some values to an output stream.
    template<typename T>
393
    void serialize(ostream &out, map<const DegreeOfFreedom*, T> &data)
394
    {
395 396
      FUNCNAME("ParallelDomainBase::serialize()");

397
      int mapSize = data.size();
398
      SerUtil::serialize(out, mapSize);
399
      for (typename map<const DegreeOfFreedom*, T>::iterator it = data.begin();
400 401 402
	   it != data.end(); ++it) {
	int v1 = (*(it->first));
	T v2 = it->second;
403 404
	SerUtil::serialize(out, v1);
	SerUtil::serialize(out, v2);
405 406 407 408 409
      }
    }

    /// Reads a mapping from dof pointer to some values from an input stream.
    template<typename T>
410
    void deserialize(istream &in, map<const DegreeOfFreedom*, T> &data,
411
		     map<int, const DegreeOfFreedom*> &dofIndexMap)
412
    {
413 414
      FUNCNAME("ParallelDomainBase::deserialize()");

415
      int mapSize = 0;
416
      SerUtil::deserialize(in, mapSize);
417 418 419
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
420 421
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
422

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

426
	data[dofIndexMap[v1]] = v2;
427 428
      }
    }
429

430
  protected:
431 432
    /// List of all stationary problems that are managed by this mesh 
    /// distributor.
433
    vector<ProblemStatSeq*> problemStat;
Thomas Witkowski's avatar
Thomas Witkowski committed
434

435 436 437
    /// If true, the mesh distributor is already initialized;
    bool initialized;

438 439 440 441 442 443
    /// The rank of the current process.
    int mpiRank;

    /// Overall number of processes.
    int mpiSize;

444 445
    /// MPI communicator collected all processes, which should be used for
    /// calculation. The Debug procces is not included in this communicator.
446 447 448
    MPI::Intracomm mpiComm;

    /// Name of the problem (as used in the init files)
449
    string name;
450

451 452
    /// Finite element spaces of the problem.
    vector<const FiniteElemSpace*> feSpaces;
453

454 455 456
    /// Mesh of the problem.
    Mesh *mesh;

457 458 459
    /// 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.    
460 461
    RefinementManager *refineManager;

462 463 464
    /// Info level.
    int info;

465 466
    /// Pointer to a mesh partitioner that is used to partition the mesh to 
    /// the ranks.
467
    MeshPartitioner *partitioner;
468

469 470
    /// Weights for the elements, i.e., the number of leaf elements within 
    /// this element.
471
    map<int, double> elemWeights;
472

473 474
    /// Stores to every macro element index the number of the rank that owns this
    /// macro element.
475
    map<int, int> partitionMap;
476

477
    /// Mapping object to map from local DOF indices to global ones.
478 479
    ParallelDofMapping dofMap;

480
    /// Database to store and query all sub-objects of all elements of the 
481
    /// macro mesh.
482
    ElementObjectDatabase elObjDb;
Thomas Witkowski's avatar
Thomas Witkowski committed
483

484
    /// Maps to each macro element index a pointer to the corresponding element.
485
    map<int, Element*> macroElIndexMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
486
    
487
    /// Maps to each macro element index the type of this element.
488
    map<int, int> macroElIndexTypeMap;
Thomas Witkowski's avatar
Thomas Witkowski committed
489

490 491 492 493
    /// 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.
494
    InteriorBoundary rankIntBoundary;
Thomas Witkowski's avatar
Thomas Witkowski committed
495
    
496 497 498 499
    /// 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
500
    InteriorBoundary otherIntBoundary;
Thomas Witkowski's avatar
Thomas Witkowski committed
501

502 503
    /// Defines the periodic boundaries with other ranks. Periodic boundaries
    /// have no owner, as it is the case of interior boundaries.
504 505
    InteriorBoundary periodicBoundary;

506 507
    /// This map contains for each rank the list of DOFs the current rank must 
    /// end to exchange solution DOFs at the interior boundaries.
508
    DofComm sendDofs;
509

510 511 512
    /// This map contains on 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.
513
    DofComm recvDofs;
514

515 516 517 518
    /// This map contains on each rank a list of DOFs along the interior bound-
    /// aries to communicate with other ranks. The DOF indices are given in rank's
    /// local numbering. Periodic boundaries within one subdomain are not 
    /// considered here. 
519 520
    DofComm periodicDofs;

521
    PeriodicMap periodicMap;
522

523 524 525 526
    /// This set of values must be interchanged between ranks when the mesh is 
    /// repartitioned.
    vector<DOFVector<double>*> interchangeVectors;
		        
527 528 529 530
    /// 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.
531
    bool deserialized;
532

533 534 535
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

536 537 538
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;

539 540
    /// Stores the number of mesh changes that must lie in between to 
    /// repartitionings.
541 542
    int repartitionIthChange;

543 544
    /// Counts the number of mesh changes after the last mesh repartitioning 
    /// was done.
545
    int nMeshChangesAfterLastRepartitioning;
546

547 548 549
    /// Countes the number of mesh repartitions that were done. Till now, this 
    /// variable is used only for debug outputs.
    int repartitioningCounter;
550

551
    /// Directory name where all debug output files should be written to.
552
    string debugOutputDir;
553

554 555
    /// Stores the mesh change index. This is used to recognize changes in the
    /// mesh structure (e.g. through refinement or coarsening managers).
556
    long lastMeshChangeIndex;
557

558 559 560 561
    /// Stores for all macro elements of the original macro mesh the
    /// neighbourhood information based on element indices. Thus, each macro
    /// element index is mapped to a vector containing all indices of 
    /// neighbouring macro elements.
562
    map<int, vector<int> > macroElementNeighbours;
563

564 565
    /// Store all macro elements of the overall mesh, i.e., before the
    /// mesh is redistributed for the first time.
566
    vector<MacroElement*> allMacroElements;
567

Thomas Witkowski's avatar
Thomas Witkowski committed
568 569
    Flag createBoundaryDofFlag;

570 571 572
    /// Stores on each mesh level for all FE spaces the information about
    /// all boundary DOFs.
    vector<map<const FiniteElemSpace*, BoundaryDofInfo> > boundaryDofInfo;
573

574 575
    MeshLevelData levelData;

Thomas Witkowski's avatar
Thomas Witkowski committed
576
  public:
577 578
    bool sebastianMode;

579 580 581
    /// The boundary DOFs are sorted by subobject entities, i.e., first all
    /// face DOFs, edge DOFs and to the last vertex DOFs will be set to
    /// communication structure vectors, \ref sendDofs and \ref recvDofs.
Thomas Witkowski's avatar
Thomas Witkowski committed
582 583
    static const Flag BOUNDARY_SUBOBJ_SORTED;

584 585 586 587 588 589 590 591 592
    /// When boundary DOFs are created, \ref boundaryDofInfo is filled for
    /// all DOFs that this rank will send to other ranks (thus, rank 
    /// owned DOFs.
    static const Flag BOUNDARY_FILL_INFO_SEND_DOFS;

    /// When boundary DOFs are created, \ref boundaryDofInfo is filled for
    /// all DOFs that this rank will receive from other ranks (thus, DOFs
    /// that are owned by another rank).
    static const Flag BOUNDARY_FILL_INFO_RECV_DOFS;
Thomas Witkowski's avatar
Thomas Witkowski committed
593

594 595
    static MeshDistributor *globalMeshDistributor;

596
    friend class ParallelDebug;
597 598 599
  };
}

600
#endif // AMDIS_MESHDISTRIBUTOR_H