Public Member Functions

twod::JagMOptBest< T, Pr > Class Template Reference

An optimal m-way jagged algorithm based on dynamic programming. More...

#include <twod/jagged_dp.hpp>

Inheritance diagram for twod::JagMOptBest< T, Pr >:
twod::PartBase< T, Pr >

Detailed Description

template<typename T, typename Pr>
class twod::JagMOptBest< T, Pr >

An optimal m-way jagged algorithm based on dynamic programming.

It selects the main dimension to get the best load. This class is implemented as a wrapper to twod::JagMOptHor and twod::JagMOptVer.

Parameters:
T type of the load
Pr type of the prefix sum array

List of all members.

Public Member Functions

virtual T part (int procCount, const Pr &prefixSumArray, util::RectList< T, Pr > &parts)
 Applies a 2d partitioning algorithm to a given 2d prefixSumArray .
virtual ~JagMOptBest ()

Constructor & Destructor Documentation

template<typename T , typename Pr >
virtual twod::JagMOptBest< T, Pr >::~JagMOptBest (  )  [inline, virtual]

Member Function Documentation

template<typename T , typename Pr >
T twod::JagMOptBest< T, Pr >::part ( int  procCount,
const Pr &  prefixSumArray,
util::RectList< T, Pr > &  parts 
) [virtual]

Applies a 2d partitioning algorithm to a given 2d prefixSumArray .

Parameters:
[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 empty before calling this function. It will contain the partition after the function return
Returns:
the load of the most loaded rectangle of parts

Implements twod::PartBase< T, Pr >.

The documentation for this class was generated from the following files:
 All Classes Namespaces Files Functions Variables Typedefs Friends Defines
Generated on Mon Aug 8 2011 20:27:30 by  doxygen 1.7.1