implements a PxQ jagged partitioning heuristic taking as the main dimension the one that leads to the best load balance. More...

Inheritance diagram for twod::JagPQHeurBest< T, Pr >:

Detailed Description

implements a PxQ jagged partitioning heuristic taking as the main dimension the one that leads to the best load balance.

This class is implemented as a wrapper to twod::JagPQHeurHor and twod::JagPQHeurVer.

Parameters:

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

Public Member Functions
virtual	~JagPQHeurBest ()
virtual T	part (int procCount, const Pr &prefixSumArray, util::RectList< T, Pr > &parts)
	Applies 2d heuristic jagged partitioning to a given 2d prefixSumArray.

Constructor & Destructor Documentation

template<typename T , typename Pr >

twod::JagPQHeurBest< T, Pr >::~JagPQHeurBest ( ) [virtual]

template<typename T , typename Pr >

T twod::JagPQHeurBest< 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. List of rectangles that form the partition.

The documentation for this class was generated from the following files: