Implementation of the partioner. More...
#include "DAGHDistribution.h"
#include <iostream>
#include <algorithm>
Functions | |
void | partition_one (const BBox &wholebbox, BBox *boxes, const int np, const int dim) |
void | partition_two (const BBox &wholebbox, BBox *boxes, const int np, const int dim1, const int dim2) |
void | partition_all (const BBox &wholebbox, BBox *boxes, const int np) |
void | pwalker_partition (const BBox &wholebbox, BBox *boxes, const int np) |
Implementation of the partioner.
References BBox::extents(), fabs(), lower(), BBox::lower(), BBox::rank, BBox::stepsize(), and upper().
Referenced by DAGHDistribution::partition().
References BBox::extents(), BBox::growlower(), BBox::growupper(), Max(), and Min().
Referenced by DAGHDistribution::partition().
void partition_two | ( | const BBox & | wholebbox, | |
BBox * | boxes, | |||
const int | np, | |||
const int | dim1, | |||
const int | dim2 | |||
) |
References BBox::extents(), fabs(), lower(), BBox::lower(), BBox::rank, BBox::stepsize(), and upper().
Referenced by DAGHDistribution::partition().
References BBox::lower(), BBox::setlower(), BBox::setstepsize(), BBox::setupper(), and BBox::upper().