Public Member Functions

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

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>

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

Detailed Description

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

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.

Parameters:
T data type of instance matrix
Pr data type of 2D matrix

List of all members.

Public Member Functions

virtual ~JagMHeurBest ()
virtual T part (int procCount, const Pr &prefixSumArray, util::RectList< T, Pr > &parts)

Constructor & Destructor Documentation

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

Member Function Documentation

template<typename T , typename Pr >
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

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 allocated before calling this function
Returns:
the load of the most loaded rectangle in the generated partition.

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