Liebe Gitlab-Nutzer, lieber Gitlab-Nutzer, es ist nun möglich sich mittels des ZIH-Logins/LDAP an unserem Dienst anzumelden. Die Konto der externen Nutzer:innen sind ü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. The accounts of external users can be accessed via the "Standard" tab. The administrators

MeshDistributor.h 17.8 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& getDofComm()
161
    {
162
      return dofComm;
163 164
    }

165 166 167 168 169
    DofComm& getDofCommSd()
    {
      return dofCommSd;
    }

170 171 172 173 174
    InteriorBoundary& getIntBoundary()
    {
      return intBoundary;
    }

175 176 177 178 179
    InteriorBoundary& getIntBoundarySd()
    {
      return intBoundarySd;
    }

180
    inline long getLastMeshChangeIndex()
181
    {
182
      return lastMeshChangeIndex;
183
    }
184

185
    inline int getMpiRank()
186
    {
187
      return mpiRank;
188
    }
189

Thomas Witkowski's avatar
Thomas Witkowski committed
190 191 192 193 194
    inline int getMpiSize()
    {
      return mpiSize;
    }

195 196 197
    inline MPI::Intracomm& getMpiComm()
    {
      return mpiComm;
198 199
    }

200 201 202 203 204
    inline bool isInitialized()
    {
      return initialized;
    }

205
    // Writes all data of this object to an output stream.
206
    void serialize(ostream &out);
207

208
    // Reads the object data from an input stream.
209
    void deserialize(istream &in);
210 211

    /** \brief
212 213 214 215
     * 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.
216
     *
217 218 219
     * 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.
220
     */    
221 222 223 224 225
    template<typename T>
    void synchVector(DOFVector<T> &vec) 
    {
      StdMpi<vector<T> > stdMpi(mpiComm);

226 227
      const FiniteElemSpace *fe = vec.getFeSpace();

228 229
      for (DofComm::Iterator it(dofComm.getSendDofs(), fe); 
	   !it.end(); it.nextRank()) {
230
	vector<T> dofs;
231
	dofs.reserve(it.getDofs().size());
232
	
233 234
	for (; !it.endDofIter(); it.nextDof())
	  dofs.push_back(vec[it.getDofIndex()]);
235
	
236
	stdMpi.send(it.getRank(), dofs);
237
      }
238
	     
239 240
      for (DofComm::Iterator it(dofComm.getRecvDofs()); 
	   !it.end(); it.nextRank())
241 242
        stdMpi.recv(it.getRank());
	     
243
      stdMpi.startCommunication();
244

245 246
      for (DofComm::Iterator it(dofComm.getRecvDofs(), fe); 
	   !it.end(); it.nextRank())
247 248 249
	for (; !it.endDofIter(); it.nextDof())
	  vec[it.getDofIndex()] = 
	     stdMpi.getRecvData(it.getRank())[it.getDofCounter()];
250 251
    }
    
252
    /** \brief
253 254 255
     * 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.
256 257 258
     */
    void synchVector(SystemVector &vec);

259 260
    void check3dValidMesh();

Thomas Witkowski's avatar
Thomas Witkowski committed
261 262 263 264 265
    void setBoundaryDofRequirement(Flag flag)
    {
      createBoundaryDofFlag = flag;
    }

266 267
    BoundaryDofInfo& getBoundaryDofInfo(const FiniteElemSpace *feSpace,
					int level)
268
    {
269 270 271 272 273 274 275
      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];
276 277
    }

278 279
    void getAllBoundaryDofs(const FiniteElemSpace *feSpace, 
			    int level,
280
			    DofContainer& dofs);
281

282 283 284 285
    const ElementObjectDatabase& getElementObjectDb() 
    {
      return elObjDb;
    }
286 287 288

    /// Adds a stationary problem to the global mesh distributor objects.
    static void addProblemStatGlobal(ProblemStatSeq *probStat);
Thomas Witkowski's avatar
Thomas Witkowski committed
289 290 291 292 293 294

    MeshLevelData& getMeshLevelData() 
    {
      return levelData;
    }

295
  protected:
296 297
    void addProblemStat(ProblemStatSeq *probStat);

298 299
    /// Determines the interior boundaries, i.e. boundaries between ranks, and
    /// stores all information about them in \ref interiorBoundary.
300
    void createInteriorBoundary(bool firstCall);
Thomas Witkowski's avatar
Thomas Witkowski committed
301

Thomas Witkowski's avatar
Thomas Witkowski committed
302 303
    void createBoundaryDofs();

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 319 320
    /// 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.  
321
    void createPeriodicMap(const FiniteElemSpace *feSpace);
322

323 324 325 326 327 328
    /// 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.
329 330
    void createMacroElementInfo();

331 332
    void updateMacroElementInfo();

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

354 355
    /// Sets \ref isRankDof to all matrices and rhs vectors in all 
    /// stationary problems.
356 357
    void setRankDofs();

358 359 360 361
    /// Removes all periodic boundary condition information from all matrices and
    /// vectors of all stationary problems and from the mesh itself.
    void removePeriodicBoundaryConditions();

362 363 364 365
    /// 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
366
    // Removes all periodic boundaries from a given boundary map.
367
    void removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
368

369 370
    void createMeshLevelStructure();

371
    /// Writes a vector of dof pointers to an output stream.
372
    void serialize(ostream &out, DofContainer &data);
373

374 375 376 377
    /// Writes a \ref RankToDofContainer to an output stream.
    void serialize(ostream &out, 
		   map<int, map<const FiniteElemSpace*, DofContainer> > &data);

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

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

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

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

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

411
      int mapSize = 0;
412
      SerUtil::deserialize(in, mapSize);
413 414 415
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
416 417
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
418

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

422
	data[dofIndexMap[v1]] = v2;
423 424
      }
    }
425

426
  protected:
427 428
    /// List of all stationary problems that are managed by this mesh 
    /// distributor.
429
    vector<ProblemStatSeq*> problemStat;
Thomas Witkowski's avatar
Thomas Witkowski committed
430

431 432 433
    /// If true, the mesh distributor is already initialized;
    bool initialized;

434 435 436 437 438 439
    /// The rank of the current process.
    int mpiRank;

    /// Overall number of processes.
    int mpiSize;

440 441
    /// MPI communicator collected all processes, which should be used for
    /// calculation. The Debug procces is not included in this communicator.
442 443 444
    MPI::Intracomm mpiComm;

    /// Name of the problem (as used in the init files)
445
    string name;
446

447 448
    /// Finite element spaces of the problem.
    vector<const FiniteElemSpace*> feSpaces;
449

450 451 452
    /// Mesh of the problem.
    Mesh *mesh;

453 454 455
    /// 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.    
456 457
    RefinementManager *refineManager;

458 459 460
    /// Info level.
    int info;

461 462
    /// Pointer to a mesh partitioner that is used to partition the mesh to 
    /// the ranks.
463
    MeshPartitioner *partitioner;
464

465 466
    /// Weights for the elements, i.e., the number of leaf elements within 
    /// this element.
467
    map<int, double> elemWeights;
468

469 470
    /// Stores to every macro element index the number of the rank that owns this
    /// macro element.
471
    map<int, int> partitionMap;
472

473
    /// Mapping object to map from local DOF indices to global ones.
474 475
    ParallelDofMapping dofMap;

476
    /// Database to store and query all sub-objects of all elements of the 
477
    /// macro mesh.
478
    ElementObjectDatabase elObjDb;
Thomas Witkowski's avatar
Thomas Witkowski committed
479

480
    /// Defines the interior boundaries of the domain that result from 
481 482
    /// partitioning the whole mesh. 
    InteriorBoundary intBoundary;
483

484 485
    InteriorBoundary intBoundarySd;

486
    DofComm dofComm;
487

488 489
    DofComm dofCommSd;

490
    PeriodicMap periodicMap;
491

492 493 494 495
    /// This set of values must be interchanged between ranks when the mesh is 
    /// repartitioned.
    vector<DOFVector<double>*> interchangeVectors;
		        
496 497 498 499
    /// 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.
500
    bool deserialized;
501

502 503 504
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

505 506 507
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;

508 509
    /// Stores the number of mesh changes that must lie in between to 
    /// repartitionings.
510 511
    int repartitionIthChange;

512 513
    /// Counts the number of mesh changes after the last mesh repartitioning 
    /// was done.
514
    int nMeshChangesAfterLastRepartitioning;
515

516 517 518
    /// Countes the number of mesh repartitions that were done. Till now, this 
    /// variable is used only for debug outputs.
    int repartitioningCounter;
519

520
    /// Directory name where all debug output files should be written to.
521
    string debugOutputDir;
522

523 524
    /// Stores the mesh change index. This is used to recognize changes in the
    /// mesh structure (e.g. through refinement or coarsening managers).
525
    long lastMeshChangeIndex;
526

527 528 529 530
    /// 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.
531
    map<int, vector<int> > macroElementNeighbours;
532

533 534
    /// Store all macro elements of the overall mesh, i.e., before the
    /// mesh is redistributed for the first time.
535
    vector<MacroElement*> allMacroElements;
536

Thomas Witkowski's avatar
Thomas Witkowski committed
537 538
    Flag createBoundaryDofFlag;

539 540 541
    /// Stores on each mesh level for all FE spaces the information about
    /// all boundary DOFs.
    vector<map<const FiniteElemSpace*, BoundaryDofInfo> > boundaryDofInfo;
542

543 544
    MeshLevelData levelData;

Thomas Witkowski's avatar
Thomas Witkowski committed
545
  public:
546 547 548
    /// 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
549 550
    static const Flag BOUNDARY_SUBOBJ_SORTED;

551 552 553 554 555 556 557 558 559
    /// 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
560

561 562
    static MeshDistributor *globalMeshDistributor;

563
    friend class ParallelDebug;
564 565 566
  };
}

567
#endif // AMDIS_MESHDISTRIBUTOR_H