#include <source/mesh/load_balance/LoadBalanceStrategy.h>
Inheritance diagram for SAMRAI::mesh::LoadBalanceStrategy< DIM >:
Public Member Functions | |
LoadBalanceStrategy () | |
virtual | ~LoadBalanceStrategy () |
virtual bool | getLoadBalanceDependsOnPatchData (int level_number) const =0 |
virtual void | loadBalanceBoxes (hier::BoxArray< DIM > &out_boxes, hier::ProcessorMapping &mapping, const hier::BoxList< DIM > &in_boxes, const tbox::Pointer< hier::PatchHierarchy< DIM > > hierarchy, const int level_number, const hier::BoxArray< DIM > &physical_domain, const hier::IntVector< DIM > &ratio_to_hierarchy_level_zero, const hier::IntVector< DIM > &min_size, const hier::IntVector< DIM > &max_size, const hier::IntVector< DIM > &cut_factor, const hier::IntVector< DIM > &bad_interval) const =0 |
|
Construct load balance strategy object. |
|
This virtual destructor does nothing interesting. |
|
Indicate whether load balancing procedure for given level depends on patch data on mesh. This can be used to determine whether a level needs to be rebalanced although its box configuration is unchanged.
Implemented in SAMRAI::mesh::LoadBalancer< DIM >. |
|
Given a list of boxes, the union of which represents the domain of a specified level in the AMR hierarchy, generate an array of boxes and an associated processor mapping from which the patches for the level may be generated. This process typically involves chopping each box in the original list that is "too large" (in a manner defined by the concrete implementation of this subclass) into a set of boxes each smaller than some size. Thus, the union of the boxes in the generated box array is the same as that of the original box list. A variety of constraints must be applied typically during the chopping process. These input arguments are described here.
Implemented in SAMRAI::mesh::LoadBalancer< DIM >. |