MeshDistributor.h 18.3 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

Thomas Witkowski's avatar
Thomas Witkowski committed
100 101 102
    /// 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.
103 104
    void repartitionMesh();
    
Thomas Witkowski's avatar
Thomas Witkowski committed
105 106 107 108 109 110 111
    void getImbalanceFactor(double &imbalance, 
			    int &minDofs, 
			    int &maxDofs,
			    int &sumDofs);

    double getImbalanceFactor();

112 113 114
    /// Calculates the imbalancing factor and prints it to screen.
    void printImbalanceFactor();

Thomas Witkowski's avatar
Thomas Witkowski committed
115 116 117 118
    /// 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.
119
    void testForMacroMesh();
120

121 122
    /// Set for each element on the partitioning level the number of 
    /// leaf elements.
123
    void setInitialElementWeights();
124

125
    inline virtual string getName() 
126 127 128
    { 
      return name; 
    }
129

Thomas Witkowski's avatar
Thomas Witkowski committed
130 131 132 133 134
    inline Mesh* getMesh()
    {
      return mesh;
    }

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

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

      return feSpaces[i];
143
    }
144 145 146 147 148 149 150

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

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

157 158 159 160 161
    inline ParallelDofMapping& getDofMapSd()
    {
      return dofMapSd;
    }

162 163
    /// Returns the periodic mapping handler, \ref periodicMap.
    inline PeriodicMap& getPeriodicMap()
164
    {
165
      return periodicMap;
166
    }
167

168
    DofComm& getDofComm()
169
    {
170
      return dofComm;
171 172
    }

173 174 175 176 177
    DofComm& getDofCommSd()
    {
      return dofCommSd;
    }

178 179 180 181 182
    InteriorBoundary& getIntBoundary()
    {
      return intBoundary;
    }

183 184 185 186 187
    InteriorBoundary& getIntBoundarySd()
    {
      return intBoundarySd;
    }

188
    inline long getLastMeshChangeIndex()
189
    {
190
      return lastMeshChangeIndex;
191
    }
192

193
    inline int getMpiRank()
194
    {
195
      return mpiRank;
196
    }
197

Thomas Witkowski's avatar
Thomas Witkowski committed
198 199 200 201 202
    inline int getMpiSize()
    {
      return mpiSize;
    }

203 204 205
    inline MPI::Intracomm& getMpiComm()
    {
      return mpiComm;
206 207
    }

208 209 210 211 212
    inline bool isInitialized()
    {
      return initialized;
    }

213
    // Writes all data of this object to an output stream.
214
    void serialize(ostream &out);
215

216
    // Reads the object data from an input stream.
217
    void deserialize(istream &in);
218 219

    /** \brief
220 221 222 223
     * 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.
224
     *
225 226 227
     * 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.
228
     */    
229 230 231 232 233
    template<typename T>
    void synchVector(DOFVector<T> &vec) 
    {
      StdMpi<vector<T> > stdMpi(mpiComm);

234 235
      const FiniteElemSpace *fe = vec.getFeSpace();

236 237
      for (DofComm::Iterator it(dofComm.getSendDofs(), fe); 
	   !it.end(); it.nextRank()) {
238
	vector<T> dofs;
239
	dofs.reserve(it.getDofs().size());
240
	
241 242
	for (; !it.endDofIter(); it.nextDof())
	  dofs.push_back(vec[it.getDofIndex()]);
243
	
244
	stdMpi.send(it.getRank(), dofs);
245
      }
246
	     
247 248
      for (DofComm::Iterator it(dofComm.getRecvDofs()); 
	   !it.end(); it.nextRank())
249 250
        stdMpi.recv(it.getRank());
	     
251
      stdMpi.startCommunication();
252

253 254
      for (DofComm::Iterator it(dofComm.getRecvDofs(), fe); 
	   !it.end(); it.nextRank())
255 256 257
	for (; !it.endDofIter(); it.nextDof())
	  vec[it.getDofIndex()] = 
	     stdMpi.getRecvData(it.getRank())[it.getDofCounter()];
258 259
    }
    
Thomas Witkowski's avatar
Blub  
Thomas Witkowski committed
260 261 262 263
    /// 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, int level = 0);
264

265 266
    void check3dValidMesh();

Thomas Witkowski's avatar
Thomas Witkowski committed
267 268 269 270 271
    void setBoundaryDofRequirement(Flag flag)
    {
      createBoundaryDofFlag = flag;
    }

272 273
    BoundaryDofInfo& getBoundaryDofInfo(const FiniteElemSpace *feSpace,
					int level)
274
    {
275 276 277 278 279 280 281
      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];
282 283
    }

284 285
    void getAllBoundaryDofs(const FiniteElemSpace *feSpace, 
			    int level,
286
			    DofContainer& dofs);
287

288 289 290 291
    const ElementObjectDatabase& getElementObjectDb() 
    {
      return elObjDb;
    }
292 293 294

    /// Adds a stationary problem to the global mesh distributor objects.
    static void addProblemStatGlobal(ProblemStatSeq *probStat);
Thomas Witkowski's avatar
Thomas Witkowski committed
295 296 297 298 299 300

    MeshLevelData& getMeshLevelData() 
    {
      return levelData;
    }

301 302 303 304 305 306 307 308
    void updateLocalGlobalNumbering();

    /// Updates the local and global DOF numbering after the mesh has been 
    /// changed.
    void updateLocalGlobalNumbering(ParallelDofMapping &dmap,
				    DofComm &dcom,
				    const FiniteElemSpace *feSpace);

309
  protected:
310 311
    void addProblemStat(ProblemStatSeq *probStat);

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

Thomas Witkowski's avatar
Thomas Witkowski committed
316 317
    void createBoundaryDofs();

318 319
    /// Removes all macro elements from the mesh that are not part of ranks 
    /// partition.
320 321
    void removeMacroElements();

322 323 324 325
    /// Calls \ref createPeriodicMap(feSpace) for all FE spaces that are
    /// handled by the mesh distributor.
    void createPeriodicMap();

326 327 328
    /// 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.  
329
    void createPeriodicMap(const FiniteElemSpace *feSpace);
330

331 332 333 334 335 336
    /// 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.
337 338
    void createMacroElementInfo();

339 340
    void updateMacroElementInfo();

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

362 363
    /// Sets \ref isRankDof to all matrices and rhs vectors in all 
    /// stationary problems.
364 365
    void setRankDofs();

366 367 368 369
    /// Removes all periodic boundary condition information from all matrices and
    /// vectors of all stationary problems and from the mesh itself.
    void removePeriodicBoundaryConditions();

370 371 372 373
    /// 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
374
    // Removes all periodic boundaries from a given boundary map.
375
    void removePeriodicBoundaryConditions(BoundaryIndexMap& boundaryMap);
Thomas Witkowski's avatar
Thomas Witkowski committed
376

377 378
    void createMeshLevelStructure();

379
    /// Writes a vector of dof pointers to an output stream.
380
    void serialize(ostream &out, DofContainer &data);
381

382 383 384 385
    /// Writes a \ref RankToDofContainer to an output stream.
    void serialize(ostream &out, 
		   map<int, map<const FiniteElemSpace*, DofContainer> > &data);

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

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

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

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

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

419
      int mapSize = 0;
420
      SerUtil::deserialize(in, mapSize);
421 422 423
      for (int i = 0; i < mapSize; i++) {
	int v1 = 0;
	T v2;
424 425
	SerUtil::deserialize(in, v1);
	SerUtil::deserialize(in, v2);
426

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

430
	data[dofIndexMap[v1]] = v2;
431 432
      }
    }
433

434
  protected:
435 436
    /// List of all stationary problems that are managed by this mesh 
    /// distributor.
437
    vector<ProblemStatSeq*> problemStat;
Thomas Witkowski's avatar
Thomas Witkowski committed
438

439 440 441
    /// If true, the mesh distributor is already initialized;
    bool initialized;

442 443 444 445 446 447
    /// The rank of the current process.
    int mpiRank;

    /// Overall number of processes.
    int mpiSize;

448 449
    /// MPI communicator collected all processes, which should be used for
    /// calculation. The Debug procces is not included in this communicator.
450 451 452
    MPI::Intracomm mpiComm;

    /// Name of the problem (as used in the init files)
453
    string name;
454

455 456
    /// Finite element spaces of the problem.
    vector<const FiniteElemSpace*> feSpaces;
457

458 459 460
    /// Mesh of the problem.
    Mesh *mesh;

461 462 463
    /// 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.    
464 465
    RefinementManager *refineManager;

466 467 468
    /// Info level.
    int info;

469 470
    /// Pointer to a mesh partitioner that is used to partition the mesh to 
    /// the ranks.
471
    MeshPartitioner *partitioner;
472

473 474
    /// Weights for the elements, i.e., the number of leaf elements within 
    /// this element.
475
    map<int, double> elemWeights;
476

477 478
    /// Stores to every macro element index the number of the rank that owns this
    /// macro element.
479
    map<int, int> partitionMap;
480

481
    /// Mapping object to map from local DOF indices to global ones.
482 483
    ParallelDofMapping dofMap;

484 485
    ParallelDofMapping dofMapSd;

486
    /// Database to store and query all sub-objects of all elements of the 
487
    /// macro mesh.
488
    ElementObjectDatabase elObjDb;
Thomas Witkowski's avatar
Thomas Witkowski committed
489

490
    /// Defines the interior boundaries of the domain that result from 
491 492
    /// partitioning the whole mesh. 
    InteriorBoundary intBoundary;
493

494 495
    InteriorBoundary intBoundarySd;

496
    DofComm dofComm;
497

498 499
    DofComm dofCommSd;

500
    PeriodicMap periodicMap;
501

502 503 504 505
    /// This set of values must be interchanged between ranks when the mesh is 
    /// repartitioned.
    vector<DOFVector<double>*> interchangeVectors;
		        
506 507 508 509
    /// 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.
510
    bool deserialized;
511

512 513 514
    /// Denotes whether there exists a filewriter for this object.
    bool writeSerializationFile;

515 516 517
    /// If true, it is possible to repartition the mesh during computations.
    bool repartitioningAllowed;

518 519
    /// Stores the number of mesh changes that must lie in between to 
    /// repartitionings.
520 521
    int repartitionIthChange;

522 523
    /// Counts the number of mesh changes after the last mesh repartitioning 
    /// was done.
524
    int nMeshChangesAfterLastRepartitioning;
525

526 527 528
    /// Countes the number of mesh repartitions that were done. Till now, this 
    /// variable is used only for debug outputs.
    int repartitioningCounter;
529

530 531 532 533 534
    /// If repartitioning of the mesh fail, this variable has a positive value
    /// that gives the number of mesh changes the mesh distributer will wait
    /// before trying new mesh repartitioning.
    int repartitioningFailed;

535
    /// Directory name where all debug output files should be written to.
536
    string debugOutputDir;
537

538 539
    /// Stores the mesh change index. This is used to recognize changes in the
    /// mesh structure (e.g. through refinement or coarsening managers).
540
    long lastMeshChangeIndex;
541

542 543 544 545
    /// 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.
546
    map<int, vector<int> > macroElementNeighbours;
547

548 549
    /// Store all macro elements of the overall mesh, i.e., before the
    /// mesh is redistributed for the first time.
550
    vector<MacroElement*> allMacroElements;
551

Thomas Witkowski's avatar
Thomas Witkowski committed
552 553
    Flag createBoundaryDofFlag;

554 555 556
    /// Stores on each mesh level for all FE spaces the information about
    /// all boundary DOFs.
    vector<map<const FiniteElemSpace*, BoundaryDofInfo> > boundaryDofInfo;
557

558 559
    MeshLevelData levelData;

Thomas Witkowski's avatar
Thomas Witkowski committed
560
  public:
561 562
    static bool sebastianMode;

563 564 565
    /// 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
566 567
    static const Flag BOUNDARY_SUBOBJ_SORTED;

568 569 570 571 572 573 574 575 576
    /// 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
577

578 579
    static MeshDistributor *globalMeshDistributor;

580
    friend class ParallelDebug;
581 582 583
  };
}

584
#endif // AMDIS_MESHDISTRIBUTOR_H