Periodic boundary conditions with mixed finite elements in parallel should work now.
Showing
| ... | ... | @@ -289,17 +289,17 @@ namespace AMDiS { |
| // We have to remove the VertexVectors, which contain periodic assoiciations, | ||
| // because they are not valid anymore after some macro elements have been removed | ||
| // and the corresponding DOFs were deleted. | ||
| // because they are not valid anymore after some macro elements have been | ||
| // removed and the corresponding DOFs were deleted. | ||
| for (map<BoundaryType, VertexVector*>::iterator it = mesh->getPeriodicAssociations().begin(); | ||
| it != mesh->getPeriodicAssociations().end(); ++it) | ||
| const_cast<DOFAdmin&>(mesh->getDofAdmin(0)).removeDOFContainer(dynamic_cast<DOFContainer*>(it->second)); | ||
| updateLocalGlobalNumbering(); | ||
| // === In 3D we have to make some test, if the resulting mesh is valid. If === | ||
| // === it is not valid, there is no possiblity yet to fix this problem, just === | ||
| // === exit with an error message. === | ||
| // === In 3D we have to make some test, if the resulting mesh is valid. === | ||
| // === If it is not valid, there is no possiblity yet to fix this === | ||
| // === problem, just exit with an error message. === | ||
| check3dValidMesh(); | ||
| ... | ... | @@ -320,7 +320,7 @@ namespace AMDiS { |
| // === Create periodic DOF mapping, if there are periodic boundaries. === | ||
| createPeriodicMap(feSpaces[0]); | ||
| createPeriodicMap(); | ||
| #if (DEBUG != 0) | ||
| ParallelDebug::testPeriodicBoundary(*this); | ||
| ... | ... | @@ -335,25 +335,20 @@ namespace AMDiS { |
| refineManager->globalRefine(mesh, globalRefinement); | ||
| updateLocalGlobalNumbering(); | ||
| // === Update periodic mapping, if there are periodic boundaries. === | ||
| createPeriodicMap(feSpaces[0]); | ||
| createPeriodicMap(); | ||
| #if (DEBUG != 0) | ||
| ParallelDebug::testPeriodicBoundary(*this); | ||
| #endif | ||
| } | ||
| /// === Set DOF rank information to all matrices and vectors. === | ||
| // Set DOF rank information to all matrices and vectors. | ||
| setRankDofs(); | ||
| // === Remove periodic boundary conditions in sequential problem definition. === | ||
| // Remove periodic boundary conditions in sequential problem definition. | ||
| removePeriodicBoundaryConditions(); | ||
| initialized = true; | ||
| ... | ... | @@ -364,6 +359,9 @@ namespace AMDiS { |
| { | ||
| FUNCNAME("MeshDistributor::addProblemStat()"); | ||
| TEST_EXIT_DBG(probStat->getFeSpaces().size()) | ||
| ("No FE spaces in stationary problem!\n"); | ||
| // === Add FE spaces from stationary problem to mesh distributor. === | ||
| for (unsigned int i = 0; i < probStat->getFeSpaces().size(); i++) { | ||
| ... | ... | @@ -845,21 +843,20 @@ namespace AMDiS { |
| #endif | ||
| // === Because the mesh has been changed, update the DOF numbering and mappings. === | ||
| // Because the mesh has been changed, update the DOF numbering and mappings. | ||
| updateLocalGlobalNumbering(); | ||
| // Update periodic mapping, if there are periodic boundaries. | ||
| createPeriodicMap(); | ||
| // === Update periodic mapping, if there are periodic boundaries. === | ||
| createPeriodicMap(feSpaces[0]); | ||
| #if (DEBUG != 0) | ||
| ParallelDebug::testPeriodicBoundary(*this); | ||
| #endif | ||
| // === The mesh has changed, so check if it is required to repartition the mesh. === | ||
| // === The mesh has changed, so check if it is required to repartition === | ||
| // === the mesh. === | ||
| nMeshChangesAfterLastRepartitioning++; | ||
| ... | ... | @@ -900,7 +897,8 @@ namespace AMDiS { |
| maxDofs = std::max(maxDofs, nDofsInRank[i]); | ||
| } | ||
| int avrgDofs = nOverallDofs / mpiSize; | ||
| double imbalance = (static_cast<double>(maxDofs - avrgDofs) / avrgDofs) * 100.0; | ||
| double imbalance = | ||
| (static_cast<double>(maxDofs - avrgDofs) / avrgDofs) * 100.0; | ||
| MSG("Imbalancing factor: %.1f\%\n", imbalance); | ||
| } | ||
| ... | ... | @@ -1202,7 +1200,8 @@ namespace AMDiS { |
| it != newMacroEl.end(); ++it) { | ||
| MacroElement *mel = *it; | ||
| // First, reset all neighbour relations. The correct neighbours will be set later. | ||
| // First, reset all neighbour relations. The correct neighbours will be | ||
| // set later. | ||
| for (int i = 0; i < mesh->getGeo(NEIGH); i++) | ||
| mel->setNeighbour(i, NULL); | ||
| ... | ... | @@ -1259,7 +1258,8 @@ namespace AMDiS { |
| stdMpi2.startCommunication(); | ||
| // === Adapte the new macro elements due to the received mesh structure codes. === | ||
| // === Adapte the new macro elements due to the received mesh === | ||
| // === structure codes. === | ||
| for (map<int, vector<int> >::iterator it = partitioner->getRecvElements().begin(); | ||
| it != partitioner->getRecvElements().end(); ++it) { | ||
| ... | ... | @@ -1348,7 +1348,7 @@ namespace AMDiS { |
| // === Update periodic mapping, if there are periodic boundaries. === | ||
| createPeriodicMap(feSpaces[0]); | ||
| createPeriodicMap(); | ||
| #if (DEBUG != 0) | ||
| ... | ... | @@ -1435,25 +1435,21 @@ namespace AMDiS { |
| macroElIndexMap[el->getIndex()] = el; | ||
| macroElIndexTypeMap[el->getIndex()] = elInfo->getType(); | ||
| // === Add all sub object of the element to the variable elObjects. === | ||
| // Add all sub object of the element to the variable elObjects. | ||
| elObjects.addElement(elInfo); | ||
| elInfo = stack.traverseNext(elInfo); | ||
| } | ||
| // === Create periodic data, if there are periodic boundary conditions. === | ||
| if (elObjects.hasPeriodicData()) { | ||
| TEST_EXIT(feSpaces.size() == 1) | ||
| ("Sebastian: Na, dass funktioniert auch noch nicht mit mehreren FE spaces. Du weisst schon, wen du jetzt mobben kannst :)!\n"); | ||
| } | ||
| // Create periodic data, if there are periodic boundary conditions. | ||
| elObjects.createPeriodicData(feSpaces[0]); | ||
| // === Create data about the reverse modes of neighbouring elements. === | ||
| // Create data about the reverse modes of neighbouring elements. | ||
| elObjects.createReverseModeData(feSpaces[0], macroElIndexMap, | ||
| macroElIndexTypeMap); | ||
| // === Create mesh element data for this rank. === | ||
| // Create mesh element data for this rank. | ||
| elObjects.createRankData(partitionMap); | ||
| } | ||
| ... | ... | @@ -1482,7 +1478,8 @@ namespace AMDiS { |
| int owner = elObjects.getIterateOwner(); | ||
| ElementObjectData& rankBoundEl = objData[mpiRank]; | ||
| TEST_EXIT_DBG(macroElIndexMap[rankBoundEl.elIndex])("Should not happen!\n"); | ||
| TEST_EXIT_DBG(macroElIndexMap[rankBoundEl.elIndex]) | ||
| ("Should not happen!\n"); | ||
| AtomicBoundary bound; | ||
| bound.rankObj.el = macroElIndexMap[rankBoundEl.elIndex]; | ||
| ... | ... | @@ -1555,12 +1552,8 @@ namespace AMDiS { |
| if (elObjects.isInRank(it->first.first, mpiRank) == false) | ||
| continue; | ||
| TEST_EXIT(feSpaces.size() == 1)("Does not work for multiple fe spaces!\n"); | ||
| WorldVector<double> c0, c1; | ||
| mesh->getDofIndexCoords(it->first.first, feSpaces[0], c0); | ||
| mesh->getDofIndexCoords(it->first.second, feSpaces[0], c1); | ||
| ElementObjectData& perDofEl0 = elObjects.getElementsInRank(it->first.first)[mpiRank]; | ||
| ElementObjectData& perDofEl0 = | ||
| elObjects.getElementsInRank(it->first.first)[mpiRank]; | ||
| for (map<int, ElementObjectData>::iterator elIt = elObjects.getElementsInRank(it->first.second).begin(); | ||
| elIt != elObjects.getElementsInRank(it->first.second).end(); ++elIt) { | ||
| ... | ... | @@ -1665,16 +1658,19 @@ namespace AMDiS { |
| b = bound; | ||
| if (mpiRank > otherElementRank) | ||
| b.neighObj.reverseMode = elObjects.getFaceReverseMode(perFaceEl0, perFaceEl1); | ||
| b.neighObj.reverseMode = | ||
| elObjects.getFaceReverseMode(perFaceEl0, perFaceEl1); | ||
| else | ||
| b.rankObj.reverseMode = elObjects.getFaceReverseMode(perFaceEl0, perFaceEl1); | ||
| b.rankObj.reverseMode = | ||
| elObjects.getFaceReverseMode(perFaceEl0, perFaceEl1); | ||
| } | ||
| } | ||
| // === Once we have this information, we must care about the order of the atomic === | ||
| // === bounds in the three boundary handling object. Eventually all the bound- === | ||
| // === aries have to be in the same order on both ranks that share the bounday. === | ||
| // === Once we have this information, we must care about the order of the === | ||
| // === atomic bounds in the three boundary handling object. Eventually === | ||
| // === all the boundaries have to be in the same order on both ranks that === | ||
| // === share the bounday. === | ||
| StdMpi<vector<AtomicBoundary> > stdMpi(mpiComm); | ||
| stdMpi.send(myIntBoundary.boundary); | ||
| ... | ... | @@ -1682,16 +1678,17 @@ namespace AMDiS { |
| stdMpi.startCommunication(); | ||
| // === The information about all neighbouring boundaries has been received. So === | ||
| // === the rank tests if its own atomic boundaries are in the same order. If === | ||
| // === not, the atomic boundaries are swaped to the correct order. === | ||
| // === The information about all neighbouring boundaries has been === | ||
| // === received. So the rank tests if its own atomic boundaries are in === | ||
| // === the same order. If not, the atomic boundaries are swaped to the === | ||
| // === correct order. === | ||
| for (RankToBoundMap::iterator rankIt = otherIntBoundary.boundary.begin(); | ||
| rankIt != otherIntBoundary.boundary.end(); ++rankIt) { | ||
| // === We have received from rank "rankIt->first" the ordered list of element === | ||
| // === indices. Now, we have to sort the corresponding list in this rank to === | ||
| // === get the same order. === | ||
| // === We have received from rank "rankIt->first" the ordered list of === | ||
| // === element indices. Now, we have to sort the corresponding list in === | ||
| // === this rank to get the same order. === | ||
| for (unsigned int j = 0; j < rankIt->second.size(); j++) { | ||
| ... | ... | @@ -1706,7 +1703,8 @@ namespace AMDiS { |
| if ((rankIt->second)[k].neighObj == recvedBound) | ||
| break; | ||
| // The element must always be found, because the list is just in another order. | ||
| </ |