Scotch domain decomposition. When run in parallel will collect the whole graph on to the master, decompose and send back. Use ptscotch for proper distributed decomposition. More...
Public Member Functions | |
TypeName ("scotch") | |
Runtime type information. More... | |
scotch (const dictionary &decompositionDict) | |
Construct given the decomposition dictionary and mesh. More... | |
scotch (const scotch &)=delete | |
Disallow default bitwise copy construction. More... | |
virtual | ~scotch () |
Destructor. More... | |
virtual labelList | decompose (const polyMesh &mesh, const pointField &points, const scalarField &pointWeights) |
Return for every coordinate the wanted processor number. Use the. More... | |
virtual labelList | decompose (const polyMesh &mesh, const labelList &agglom, const pointField ®ionPoints, const scalarField ®ionWeights) |
Return for every coordinate the wanted processor number. Gets. More... | |
virtual labelList | decompose (const labelListList &globalCellCells, const pointField &cellCentres, const scalarField &cellWeights) |
Return for every coordinate the wanted processor number. Explicitly. More... | |
void | operator= (const scotch &)=delete |
Disallow default bitwise assignment. More... | |
virtual labelList | decompose (const pointField &points, const scalarField &pointWeights) |
Inherit decompose from decompositionMethod. More... | |
virtual labelList | decompose (const pointField &) |
Inherit decompose from decompositionMethod. More... | |
virtual labelList | decompose (const polyMesh &mesh, const pointField &points, const scalarField &pointWeights)=0 |
Inherit decompose from decompositionMethod. More... | |
virtual labelList | decompose (const polyMesh &, const pointField &) |
Inherit decompose from decompositionMethod. More... | |
virtual labelList | decompose (const polyMesh &mesh, const labelList &cellToRegion, const pointField ®ionPoints, const scalarField ®ionWeights) |
Inherit decompose from decompositionMethod. More... | |
virtual labelList | decompose (const polyMesh &mesh, const labelList &cellToRegion, const pointField ®ionPoints) |
Inherit decompose from decompositionMethod. More... | |
virtual labelList | decompose (const labelListList &globalCellCells, const pointField &cellCentres, const scalarField &cellWeights)=0 |
Inherit decompose from decompositionMethod. More... | |
virtual labelList | decompose (const labelListList &globalCellCells, const pointField &cellCentres) |
Inherit decompose from decompositionMethod. More... | |
virtual labelList | decompose (const polyMesh &mesh, const scalarField &cellWeights, const boolList &blockedFace, const PtrList< labelList > &specifiedProcessorFaces, const labelList &specifiedProcessor, const List< labelPair > &explicitConnections) |
Inherit decompose from decompositionMethod. More... | |
labelList | decompose (const polyMesh &mesh, const scalarField &cellWeights) |
Inherit decompose from decompositionMethod. More... | |
![]() | |
TypeName ("decompositionMethod") | |
Runtime type information. More... | |
declareRunTimeSelectionTable (autoPtr, decompositionMethod, decomposer,(const dictionary &decompositionDict),(decompositionDict)) | |
declareRunTimeSelectionTable (autoPtr, decompositionMethod, distributor,(const dictionary &decompositionDict),(decompositionDict)) | |
decompositionMethod (const dictionary &decompositionDict) | |
Construct given the decomposition dictionary. More... | |
decompositionMethod (const decompositionMethod &)=delete | |
Disallow default bitwise copy construction. More... | |
virtual | ~decompositionMethod () |
Destructor. More... | |
label | nDomains () const |
virtual labelList | decompose (const pointField &points, const scalarField &pointWeights) |
Return for every coordinate the wanted processor number. More... | |
virtual labelList | decompose (const pointField &) |
Like decompose but with uniform weights on the points. More... | |
virtual labelList | decompose (const polyMesh &, const pointField &) |
Like decompose but with uniform weights on the points. More... | |
virtual labelList | decompose (const polyMesh &mesh, const labelList &cellToRegion, const pointField ®ionPoints) |
Like decompose but with uniform weights on the regions. More... | |
virtual labelList | decompose (const labelListList &globalCellCells, const pointField &cellCentres) |
Like decompose but with uniform weights on the cells. More... | |
void | setConstraints (const polyMesh &mesh, boolList &blockedFace, PtrList< labelList > &specifiedProcessorFaces, labelList &specifiedProcessor, List< labelPair > &explicitConnections) |
Helper: extract constraints: More... | |
void | applyConstraints (const polyMesh &mesh, const boolList &blockedFace, const PtrList< labelList > &specifiedProcessorFaces, const labelList &specifiedProcessor, const List< labelPair > &explicitConnections, labelList &finalDecomp) |
Helper: apply constraints to a decomposition. This gives. More... | |
virtual labelList | decompose (const polyMesh &mesh, const scalarField &cellWeights, const boolList &blockedFace, const PtrList< labelList > &specifiedProcessorFaces, const labelList &specifiedProcessor, const List< labelPair > &explicitConnections) |
Decompose a mesh with constraints. More... | |
labelList | decompose (const polyMesh &mesh, const scalarField &cellWeights) |
Decompose a mesh. Apply all constraints from decomposeParDict. More... | |
void | operator= (const decompositionMethod &)=delete |
Disallow default bitwise assignment. More... | |
Additional Inherited Members | |
![]() | |
static autoPtr< decompositionMethod > | NewDecomposer (const dictionary &decompositionDict) |
Return a reference to the selected decomposition method. More... | |
static autoPtr< decompositionMethod > | NewDistributor (const dictionary &decompositionDict) |
Return a reference to the selected decomposition method. More... | |
static IOdictionary | decomposeParDict (const Time &time) |
Read and return the decomposeParDict. More... | |
static labelList | scaleWeights (const scalarField &weights, label &nWeights, const bool distributed=true) |
Convert the given scalar weights to labels. More... | |
static void | calcCellCells (const polyMesh &mesh, const labelList &agglom, const label nLocalCoarse, const bool global, CompactListList< label > &cellCells) |
Helper: determine (local or global) cellCells from mesh. More... | |
static void | calcCellCells (const polyMesh &mesh, const labelList &agglom, const label nLocalCoarse, const bool parallel, CompactListList< label > &cellCells, CompactListList< scalar > &cellCellWeights) |
Helper: determine (local or global) cellCells and face weights. More... | |
![]() | |
label | nWeights (const pointField &points, const scalarField &pointWeights) const |
Return the number of weights per point. More... | |
label | checkWeights (const pointField &points, const scalarField &pointWeights) const |
Check the weights against the points. More... | |
![]() | |
dictionary | decompositionDict_ |
label | nProcessors_ |
PtrList< decompositionConstraint > | constraints_ |
Optional constraints. More... | |
Scotch domain decomposition. When run in parallel will collect the whole graph on to the master, decompose and send back. Use ptscotch for proper distributed decomposition.
Quoting from the Scotch forum, on the 2008-08-22 10:09, Francois PELLEGRINI posted the following details:
RE: Graph mapping 'strategy' string Strategy handling in Scotch is a bit tricky. In order not to be confused, you must have a clear view of how they are built. Here are some rules: 1- Strategies are made up of "methods" which are combined by means of "operators". 2- A method is of the form "m{param=value,param=value,...}", where "m" is a single character (this is your first error: "f" is a method name, not a parameter name). 3- There exist different sort of strategies : bipartitioning strategies, mapping strategies, ordering strategies, which cannot be mixed. For instance, you cannot build a bipartitioning strategy and feed it to a mapping method (this is your second error). To use the "mapCompute" routine, you must create a mapping strategy, not a bipartitioning one, and so use stratGraphMap() and not stratGraphBipart(). Your mapping strategy should however be based on the "recursive bipartitioning" method ("b"). For instance, a simple (and hence not very efficient) mapping strategy can be : "b{sep=f}" which computes mappings with the recursive bipartitioning method "b", this latter using the Fiduccia-Mattheyses method "f" to compute its separators. If you want an exact partition (see your previous post), try "b{sep=fx}". However, these strategies are not the most efficient, as they do not make use of the multi-level framework. To use the multi-level framework, try for instance: "b{sep=m{vert=100,low=h,asc=f}x}" The current default mapping strategy in Scotch can be seen by using the "-vs" option of program gmap. It is, to date: r { job=t, map=t, poli=S, sep= ( m { asc=b { bnd= ( d{pass=40,dif=1,rem=1} | ) f{move=80,pass=-1,bal=0.002491}, org=f{move=80,pass=-1,bal=0.002491}, width=3 }, low=h{pass=10} f{move=80,pass=-1,bal=0.002491}, type=h, vert=80, rat=0.8 } | m { asc=b { bnd= ( d{pass=40,dif=1,rem=1} | ) f{move=80,pass=-1,bal=0.002491}, org=f{move=80,pass=-1,bal=0.002491}, width=3 }, low=h{pass=10} f{move=80,pass=-1,bal=0.002491}, type=h, vert=80, rat=0.8 } ) }
Given that this information was written in 2008, this example strategy will unlikely work as-is with the more recent Scotch versions. Therefore, the steps for getting the current default strategy from within Scotch, is to do the following steps:
Edit the file system/decomposeParDict
and use the following settings:
method scotch; scotchCoeffs { writeGraph true; }
Run decomposePar
. For example, it will write a file named region0.grf
.
Now, instead of using gmap
, run gpart
with the following command structure to get the default strategy:
gpart \<nProcs\> -vs \<grfFile\>
where:
writeGraph=true
, namely region0.grf
. numberOfSubdomains
defined in the dictionary file. At the end of the execution will be shown a long string, similar to the following example (complete line was cropped at [...]
):
S Strat=m{asc=b{width=3,bnd=d{pass=40,dif=1,rem=0}[...],type=h}
Edit the file system/decomposeParDict
once again and add the strategy
entry as exemplified:
method scotch; scotchCoeffs { // writeGraph true; strategy "m{asc=b{width=3,bnd=d{pass=40,dif=1,rem=0}[...],type=h}"; }
Finally, run decomposePar
once again, to at least test if it works as intended.
Note: gpart
can be found in the current search path by adding the respective bin
folder from the Scotch installation, namely by running the following commands:
source $(foamEtcFile config.sh/scotch) export PATH=$PATH:$SCOTCH_ARCH_PATH/bin
scotch | ( | const dictionary & | decompositionDict | ) |
Construct given the decomposition dictionary and mesh.
Definition at line 94 of file dummyScotch.C.
TypeName | ( | "scotch" | ) |
Runtime type information.
|
virtual |
Return for every coordinate the wanted processor number. Use the.
mesh connectivity (if needed) Weights get normalised with minimum weight and truncated to convert into integer so e.g. 3.5 is seen as 3. The overall sum of weights might otherwise overflow.
Implements decompositionMethod.
Definition at line 105 of file dummyScotch.C.
References Foam::exit(), Foam::FatalError, FatalErrorInFunction, notImplementedMessage, and List< label >::null().
|
virtual |
Return for every coordinate the wanted processor number. Gets.
passed agglomeration map (from fine to coarse cells) and coarse cell location. Can be overridden by decomposers that provide this functionality natively. See note on weights above.
Reimplemented from decompositionMethod.
Definition at line 119 of file dummyScotch.C.
References Foam::exit(), Foam::FatalError, FatalErrorInFunction, notImplementedMessage, and List< label >::null().
|
virtual |
Return for every coordinate the wanted processor number. Explicitly.
provided mesh connectivity. The connectivity is equal to mesh.cellCells() except for
Implements decompositionMethod.
Definition at line 134 of file dummyScotch.C.
References Foam::exit(), Foam::FatalError, FatalErrorInFunction, notImplementedMessage, and List< label >::null().
|
delete |
Disallow default bitwise assignment.
|
inline |
Inherit decompose from decompositionMethod.
Definition at line 155 of file decompositionMethod.H.
|
inline |
Inherit decompose from decompositionMethod.
Definition at line 166 of file decompositionMethod.H.
virtual labelList decompose |
Inherit decompose from decompositionMethod.
Foam::labelList decompose |
Inherit decompose from decompositionMethod.
Definition at line 185 of file decompositionMethod.C.
Foam::labelList decompose |
Inherit decompose from decompositionMethod.
Definition at line 193 of file decompositionMethod.C.
Foam::labelList decompose |
Inherit decompose from decompositionMethod.
Definition at line 202 of file decompositionMethod.C.
virtual labelList decompose |
Inherit decompose from decompositionMethod.
Foam::labelList decompose |
Inherit decompose from decompositionMethod.
Definition at line 227 of file decompositionMethod.C.
Foam::labelList decompose |
Inherit decompose from decompositionMethod.
Definition at line 313 of file decompositionMethod.C.
Foam::labelList decompose |
Inherit decompose from decompositionMethod.
Definition at line 331 of file decompositionMethod.C.