implements an m-way jagged partitioning heuristic using as the main dimension the one that leads to the best load balance. More...
#include <twod/m_way_jag_2d.hpp>
implements an m-way jagged partitioning heuristic using as the main dimension the one that leads to the best load balance.
This class is implemented as a wrapper to twod::JagMHeurHor and twod::JagMHeurVer.
T | data type of instance matrix | |
Pr | data type of 2D matrix |
Public Member Functions | |
virtual | ~JagMHeurBest () |
virtual T | part (int procCount, const Pr &prefixSumArray, util::RectList< T, Pr > &parts) |
virtual twod::JagMHeurBest< T, Pr >::~JagMHeurBest | ( | ) | [inline, virtual] |
T twod::JagMHeurBest< T, Pr >::part | ( | int | procCount, | |
const Pr & | prefixSumArray, | |||
util::RectList< T, Pr > & | parts | |||
) | [virtual] |
Applies 2d heuristic jagged partitioning to a given 2d prefixSumArray
[in] | procCount | is the number of processors |
[in] | prefixSumArray | first column and first row consists of zero only. But the borders of rectangles in rect_list never touch this area (index 0 in row or column) |
[out] | parts | must be allocated before calling this function |
Implements twod::PartBase< T, Pr >.