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 17.6 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
    inline long getLastMeshChangeIndex()
166
    {
167
      return lastMeshChangeIndex;
168
    }
169

170
    inline int getMpiRank()
171
    {
172
      return mpiRank;
173
    }
174

Thomas Witkowski's avatar
Thomas Witkowski committed
175 176 177 178 179
    inline int getMpiSize()
    {
      return mpiSize;
    }

180 181 182
    inline MPI::Intracomm& getMpiComm()
    {
      return mpiComm;
183 184
    }

185 186 187 188 189
    inline bool isInitialized()
    {
      return initialized;
    }

190
    // Writes all data of this object to an output stream.
191
    void serialize(ostream &out);
192

193
    // Reads the object data from an input stream.
194
    void deserialize(istream &in);
195 196

    /** \brief
197 198 199 200
     * 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.
201
     *
202 203 204
     * 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.
205
     */    
206 207 208 209 210
    template<typename T>
    void synchVector(DOFVector<T> &vec) 
    {
      StdMpi<vector<T> > stdMpi(mpiComm);

211 212
      const FiniteElemSpace *fe = vec.getFeSpace();

213 214
      for (DofComm::Iterator it(dofComm.getSendDofs(), fe); 
	   !it.end(); it.nextRank()) {
215
	vector<T> dofs;
216
	dofs.reserve(it.getDofs().size());
217
	
218 219
	for (; !it.endDofIter(); it.nextDof())
	  dofs.push_back(vec[it.getDofIndex()]);
220
	
221
	stdMpi.send(it.getRank(), dofs);
222
      }
223
	     
224 225
      for (DofComm::Iterator it(dofComm.getRecvDofs()); 
	   !it.end(); it.nextRank())
226 227
        stdMpi.recv(it.getRank());
	     
228
      stdMpi.startCommunication();
229

230 231
      for (DofComm::Iterator it(dofComm.getRecvDofs(), fe); 
	   !it.end(); it.nextRank())
232 233 234
	for (; !it.endDofIter(); it.nextDof())
	  vec[it.getDofIndex()] = 
	     stdMpi.getRecvData(it.getRank())[it.getDofCounter()];
235 236
    }
    
237
    /** \brief
238 239 240
     * 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.
241 242 243
     */
    void synchVector(SystemVector &vec);

244 245
    void check3dValidMesh();

Thomas Witkowski's avatar
Thomas Witkowski committed
246 247 248 249 250
    void setBoundaryDofRequirement(Flag flag)
    {
      createBoundaryDofFlag = flag;
    }

251 252
    BoundaryDofInfo& getBoundaryDofInfo(const FiniteElemSpace *feSpace,
					int level)
253
    {
254 255 256 257 258 259 260
      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];
261 262
    }

263 264
    void getAllBoundaryDofs(const FiniteElemSpace *feSpace, 
			    int level,
265
			    DofContainer& dofs);
266

267 268 269 270
    const ElementObjectDatabase& getElementObjectDb() 
    {
      return elObjDb;
    }
271 272 273

    /// Adds a stationary problem to the global mesh distributor objects.
    static void addProblemStatGlobal(ProblemStatSeq *probStat);
Thomas Witkowski's avatar
Thomas Witkowski committed
274 275 276 277 278 279

    MeshLevelData& getMeshLevelData() 
    {
      return levelData;
    }

280
  protected:
281 282
    void addProblemStat(ProblemStatSeq *probStat);

283 284
    /// Determines the interior boundaries, i.e. boundaries between ranks, and
    /// stores all information about them in \ref interiorBoundary.
285
    void createInteriorBoundaryInfo();
286

Thomas Witkowski's avatar
Thomas Witkowski committed
287 288
    void updateInteriorBoundaryInfo();

Thomas Witkowski's avatar
Thomas Witkowski committed
289 290
    void createBoundaryDofs();

291
    void createBoundaryDofInfo();
292

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

297 298
    void updateLocalGlobalNumbering();

299 300
    /// Updates the local and global DOF numbering after the mesh has been 
    /// changed.
301
    void updateLocalGlobalNumbering(const FiniteElemSpace *feSpace);
302

303 304 305 306
    /// Calls \ref createPeriodicMap(feSpace) for all FE spaces that are
    /// handled by the mesh distributor.
    void createPeriodicMap();

307 308 309
    /// 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.  
310
    void createPeriodicMap(const FiniteElemSpace *feSpace);
311

312 313 314 315 316 317
    /// 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.
318 319
    void createMacroElementInfo();

320 321
    void updateMacroElementInfo();

322
    /** \brief
323 324 325 326 327 328
     * 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.
329
     *
330 331
     * \param[in] allBound   Defines a map from rank to interior boundaries 
     *                       which should be checked.
332
     *
333 334 335
     * \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.
336 337
     */
    bool checkAndAdaptBoundary(RankToBoundMap &allBound);
338
  
339 340
    /// Sets \ref isRankDof to all matrices and rhs vectors in a given 
    /// stationary problem.
341
    void setRankDofs(ProblemStatSeq *probStat);
342

343 344
    /// Sets \ref isRankDof to all matrices and rhs vectors in all 
    /// stationary problems.
345 346
    void setRankDofs();

347 348 349 350
    /// Removes all periodic boundary condition information from all matrices and
    /// vectors of all stationary problems and from the mesh itself.
    void removePeriodicBoundaryConditions();

351 352 353 354
    /// 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
355
    // Removes all periodic boundaries from a given boundary map.
356
    void removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
357

358 359
    void createMeshLevelStructure();

360
    /// Writes a vector of dof pointers to an output stream.
361
    void serialize(ostream &out, DofContainer &data);
362

363 364 365 366
    /// Writes a \ref RankToDofContainer to an output stream.
    void serialize(ostream &out, 
		   map<int, map<const FiniteElemSpace*, DofContainer> > &data);

367
    /// Reads a vector of dof pointers from an input stream.
368
    void deserialize(istream &in, DofContainer &data,
369
		     map<int, const DegreeOfFreedom*> &dofIndexMap);
370 371

    /// Reads a \ref RankToDofContainer from an input stream.
372 373
    void deserialize(istream &in, 
		     map<int, map<const FiniteElemSpace*, DofContainer> > &data,
374
		     map<const FiniteElemSpace*, map<int, const DegreeOfFreedom*> > &dofIndexMap);
375 376 377

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

382
      int mapSize = data.size();
383
      SerUtil::serialize(out, mapSize);
384
      for (typename map<const DegreeOfFreedom*, T>::iterator it = data.begin();
385 386 387
	   it != data.end(); ++it) {
	int v1 = (*(it->first));
	T v2 = it->second;
388 389
	SerUtil::serialize(out, v1);
	SerUtil::serialize(out, v2);
390 391 392 393 394
      }
    }

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

400
      int mapSize = 0;
401
      SerUtil::deserialize(in, mapSize);
402 403 404
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
405 406
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
407

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

411
	data[dofIndexMap[v1]] = v2;
412 413
      }
    }
414

415
  protected:
416 417
    /// List of all stationary problems that are managed by this mesh 
    /// distributor.
418
    vector<ProblemStatSeq*> problemStat;
Thomas Witkowski's avatar
Thomas Witkowski committed
419

420 421 422
    /// If true, the mesh distributor is already initialized;
    bool initialized;

423 424 425 426 427 428
    /// The rank of the current process.
    int mpiRank;

    /// Overall number of processes.
    int mpiSize;

429 430
    /// MPI communicator collected all processes, which should be used for
    /// calculation. The Debug procces is not included in this communicator.
431 432 433
    MPI::Intracomm mpiComm;

    /// Name of the problem (as used in the init files)
434
    string name;
435

436 437
    /// Finite element spaces of the problem.
    vector<const FiniteElemSpace*> feSpaces;
438

439 440 441
    /// Mesh of the problem.
    Mesh *mesh;

442 443 444
    /// 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.    
445 446
    RefinementManager *refineManager;

447 448 449
    /// Info level.
    int info;

450 451
    /// Pointer to a mesh partitioner that is used to partition the mesh to 
    /// the ranks.
452
    MeshPartitioner *partitioner;
453

454 455
    /// Weights for the elements, i.e., the number of leaf elements within 
    /// this element.
456
    map<int, double> elemWeights;
457

458 459
    /// Stores to every macro element index the number of the rank that owns this
    /// macro element.
460
    map<int, int> partitionMap;
461

462
    /// Mapping object to map from local DOF indices to global ones.
463 464
    ParallelDofMapping dofMap;

465
    /// Database to store and query all sub-objects of all elements of the 
466
    /// macro mesh.
467
    ElementObjectDatabase elObjDb;
Thomas Witkowski's avatar
Thomas Witkowski committed
468

469
    /// Defines the interior boundaries of the domain that result from 
470 471
    /// partitioning the whole mesh. 
    InteriorBoundary intBoundary;
472

473
    DofComm dofComm;
474

475
    PeriodicMap periodicMap;
476

477 478 479 480
    /// This set of values must be interchanged between ranks when the mesh is 
    /// repartitioned.
    vector<DOFVector<double>*> interchangeVectors;
		        
481 482 483 484
    /// 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.
485
    bool deserialized;
486

487 488 489
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

490 491 492
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;

493 494
    /// Stores the number of mesh changes that must lie in between to 
    /// repartitionings.
495 496
    int repartitionIthChange;

497 498
    /// Counts the number of mesh changes after the last mesh repartitioning 
    /// was done.
499
    int nMeshChangesAfterLastRepartitioning;
500

501 502 503
    /// Countes the number of mesh repartitions that were done. Till now, this 
    /// variable is used only for debug outputs.
    int repartitioningCounter;
504

505
    /// Directory name where all debug output files should be written to.
506
    string debugOutputDir;
507

508 509
    /// Stores the mesh change index. This is used to recognize changes in the
    /// mesh structure (e.g. through refinement or coarsening managers).
510
    long lastMeshChangeIndex;
511

512 513 514 515
    /// 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.
516
    map<int, vector<int> > macroElementNeighbours;
517

518 519
    /// Store all macro elements of the overall mesh, i.e., before the
    /// mesh is redistributed for the first time.
520
    vector<MacroElement*> allMacroElements;
521

Thomas Witkowski's avatar
Thomas Witkowski committed
522 523
    Flag createBoundaryDofFlag;

524 525 526
    /// Stores on each mesh level for all FE spaces the information about
    /// all boundary DOFs.
    vector<map<const FiniteElemSpace*, BoundaryDofInfo> > boundaryDofInfo;
527

528 529
    MeshLevelData levelData;

Thomas Witkowski's avatar
Thomas Witkowski committed
530
  public:
531 532 533
    /// 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
534 535
    static const Flag BOUNDARY_SUBOBJ_SORTED;

536 537 538 539 540 541 542 543 544
    /// 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
545

546 547
    static MeshDistributor *globalMeshDistributor;

548
    friend class ParallelDebug;
549 550 551
  };
}

552
#endif // AMDIS_MESHDISTRIBUTOR_H