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.7 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
    InteriorBoundary& getIntBoundary()
    {
      return intBoundary;
    }

170
    inline long getLastMeshChangeIndex()
171
    {
172
      return lastMeshChangeIndex;
173
    }
174

175
    inline int getMpiRank()
176
    {
177
      return mpiRank;
178
    }
179

Thomas Witkowski's avatar
Thomas Witkowski committed
180 181 182 183 184
    inline int getMpiSize()
    {
      return mpiSize;
    }

185 186 187
    inline MPI::Intracomm& getMpiComm()
    {
      return mpiComm;
188 189
    }

190 191 192 193 194
    inline bool isInitialized()
    {
      return initialized;
    }

195
    // Writes all data of this object to an output stream.
196
    void serialize(ostream &out);
197

198
    // Reads the object data from an input stream.
199
    void deserialize(istream &in);
200 201

    /** \brief
202 203 204 205
     * 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.
206
     *
207 208 209
     * 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.
210
     */    
211 212 213 214 215
    template<typename T>
    void synchVector(DOFVector<T> &vec) 
    {
      StdMpi<vector<T> > stdMpi(mpiComm);

216 217
      const FiniteElemSpace *fe = vec.getFeSpace();

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

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

249 250
    void check3dValidMesh();

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

256 257
    BoundaryDofInfo& getBoundaryDofInfo(const FiniteElemSpace *feSpace,
					int level)
258
    {
259 260 261 262 263 264 265
      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];
266 267
    }

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

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

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

    MeshLevelData& getMeshLevelData() 
    {
      return levelData;
    }

285
  protected:
286 287
    void addProblemStat(ProblemStatSeq *probStat);

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

Thomas Witkowski's avatar
Thomas Witkowski committed
292 293
    void createBoundaryDofs();

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

298 299
    void updateLocalGlobalNumbering();

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

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

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

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

321 322
    void updateMacroElementInfo();

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

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

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

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

359 360
    void createMeshLevelStructure();

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

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

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

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

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

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

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

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

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

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

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

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

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

    /// Overall number of processes.
    int mpiSize;

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

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

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

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

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

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

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

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

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

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

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

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

474 475
    InteriorBoundary intBoundarySd;

476
    DofComm dofComm;
477

478 479
    DofComm dofCommSd;

480
    PeriodicMap periodicMap;
481

482 483 484 485
    /// This set of values must be interchanged between ranks when the mesh is 
    /// repartitioned.
    vector<DOFVector<double>*> interchangeVectors;
		        
486 487 488 489
    /// 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.
490
    bool deserialized;
491

492 493 494
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

495 496 497
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;

498 499
    /// Stores the number of mesh changes that must lie in between to 
    /// repartitionings.
500 501
    int repartitionIthChange;

502 503
    /// Counts the number of mesh changes after the last mesh repartitioning 
    /// was done.
504
    int nMeshChangesAfterLastRepartitioning;
505

506 507 508
    /// Countes the number of mesh repartitions that were done. Till now, this 
    /// variable is used only for debug outputs.
    int repartitioningCounter;
509

510
    /// Directory name where all debug output files should be written to.
511
    string debugOutputDir;
512

513 514
    /// Stores the mesh change index. This is used to recognize changes in the
    /// mesh structure (e.g. through refinement or coarsening managers).
515
    long lastMeshChangeIndex;
516

517 518 519 520
    /// 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.
521
    map<int, vector<int> > macroElementNeighbours;
522

523 524
    /// Store all macro elements of the overall mesh, i.e., before the
    /// mesh is redistributed for the first time.
525
    vector<MacroElement*> allMacroElements;
526

Thomas Witkowski's avatar
Thomas Witkowski committed
527 528
    Flag createBoundaryDofFlag;

529 530 531
    /// Stores on each mesh level for all FE spaces the information about
    /// all boundary DOFs.
    vector<map<const FiniteElemSpace*, BoundaryDofInfo> > boundaryDofInfo;
532

533 534
    MeshLevelData levelData;

Thomas Witkowski's avatar
Thomas Witkowski committed
535
  public:
536 537 538
    /// 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
539 540
    static const Flag BOUNDARY_SUBOBJ_SORTED;

541 542 543 544 545 546 547 548 549
    /// 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
550

551 552
    static MeshDistributor *globalMeshDistributor;

553
    friend class ParallelDebug;
554 555 556
  };
}

557
#endif // AMDIS_MESHDISTRIBUTOR_H