Grabs the interval with largest load and cuts it into two equal loaded pieces.
More...
#include <oned/greedy_bisect.hpp>
Detailed Description
template<typename T, typename Pr>
class oned::GreedyBisection< T, Pr >
Grabs the interval with largest load and cuts it into two equal loaded pieces.
- Parameters:
-
| T | data type of weight of instance |
| Pr | data type of prefixSumArray |
List of all members.
Static Public Member Functions |
| static T | greedy_bisection (int procCount, const Pr &prefixSumArray, int length, int *cutIndexes, T foo) |
Static Private Member Functions |
| static T | greedy_bisect_internal (int procCount, const Pr &prefixSumArray, int length, int *cutIndexes) |
Member Function Documentation
template<typename T , typename Pr >
| T oned::GreedyBisection< T, Pr >::greedy_bisect_internal |
( |
int |
procCount, |
|
|
const Pr & |
prefixSumArray, |
|
|
int |
length, |
|
|
int * |
cutIndexes | |
|
) |
| | [static, private] |
template<typename T , typename Pr >
| T oned::GreedyBisection< T, Pr >::greedy_bisection |
( |
int |
procCount, |
|
|
const Pr & |
prefixSumArray, |
|
|
int |
length, |
|
|
int * |
cutIndexes, |
|
|
T |
foo | |
|
) |
| | [static] |
Applies the greedy bisection algorithm to a given prefixSumArray.
- Parameters:
-
| [in] | procCount | is the total number of processors. |
| [in] | prefixSumArray | always begins with 0 as first element. |
| [in] | length | is the exact size of prefixSumArray. |
| [out] | cutIndexes | array of cut points. |
| foo | maximum value of the array. This parameter is included for compatibility reason, it is ignored by the algorithm. |
- Returns:
- Load of the max. loaded processor
The documentation for this class was generated from the following files:
1.7.1
