An optimal m-way jagged algorithm based on dynamic programming. More...
#include <twod/jagged_dp.hpp>
An optimal m-way jagged algorithm based on dynamic programming.
It takes the second dimension as the main dimension. This class is implemented as a wrapper to twod::JagMOptHor.
T | type of the load | |
Pr | type of the prefix sum array |
Public Member Functions | |
virtual T | part (int procCount, const Pr &prefixSumArray, util::RectList< T, Pr > &parts) |
Applies 2D jagged-optimal partitioning. | |
virtual | ~JagMOptVer () |
virtual twod::JagMOptVer< T, Pr >::~JagMOptVer | ( | ) | [inline, virtual] |
T twod::JagMOptVer< T, Pr >::part | ( | int | procCount, | |
const Pr & | prefixSumArray, | |||
util::RectList< T, Pr > & | parts | |||
) | [virtual] |
Applies 2D jagged-optimal partitioning.
[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. List of rectangles that form the partition. |
Implements twod::PartBase< T, Pr >.