Method for dynamic repartitioning in adaptive mesh processing
OwnerMark S. Fisher, Mortaza Maniinventors
Life of this patent
Estimating the term…
Abstract
A method for dynamic repartitioning of a mesh, wherein the mesh is partitioned to find a solution using a plurality of processors, and wherein the partitions have become unbalanced. The present method allows large portions of the mesh to continue to progress towards a solution by only repartitioning a small percentage of the overall mesh. This is done by stripping cells along the partition interfaces using a marching method to form a free-cell region, repartitioning the free-cell region, and joining the repartitioned portions of the free-cell region with the remaining cells in a manner that will increase the efficiency of the solver.
Claims20
A method for dynamic repartitioning of a mesh that is partitioned to be solved on a plurality of processors in parallel, comprising:
- identifying the interfaces in each partition;
- creating super-cells from the original partitions, a remainder forming a free-cell region;
- repartitioning the free-cell region into a plurality of portions;
- and
- combining each one of the super-cells with a portion of the repartitioned free-cells region to form a plurality of new partitions.
A method for finding a solution to a large-scale numerical simulation, comprising:
- forming a mesh;
- placing partitions in the mesh to run the simulation on a plurality of processors;
- executing an iterative solver to find the solution;
- and
- periodically rebalancing the partitioned mesh with a dynamic repartitioning method.
Dependencies are inferred from the claim text.