#include <util/m_probe.hpp>
#include <util/prefix_sum_tools.hpp>
#include <twod/part_base.hpp>
#include <vector>
#include <util/multiarrays.hpp>
#include <util/transpose2d.hpp>
#include <twod/m_way_probe_impl.hpp>
Go to the source code of this file.
Detailed Description
- Author:
- erdeniz <erdeniz@bmi.osu.edu>
- Date:
- Sat Jun 11 04:07:10 2011
Classes |
class | twod::JagMHeurProbeHor< T, Pr, onedalgoY, onedalgoX > |
| Finds least max proc load value by applying binary search over it. First cut direction is horizontal. See section 3.2.2 PROBE-M algorithm of "E. Saule, E. O. Bas, U. V. Catalyurek, Load-Balancing Spatially Located Computations using Rectangular Partitions Paper, Tech. Report, ArXiv, no. arXiv:1104.2566v1, 2011". More...
|
class | twod::JagMHeurProbeVer< T, Pr, onedalgoY, onedalgoX > |
| Finds least max proc load value by applying binary search over it. First cut direction is vertical. See section 3.2.2 PROBE-M algorithm of "E. Saule, E. O. Bas, U. V. Catalyurek, Load-Balancing Spatially Located Computations using Rectangular Partitions Paper, Tech. Report, ArXiv, no. arXiv:1104.2566v1, 2011". More...
|
class | twod::JagMHeurProbeBest< T, Pr > |
| Finds least max proc load value by applying binary search over it. First cut direction is decided by tring both horizontal and vertical first dimension cuts. See section 3.2.2 PROBE-M algorithm of "E. Saule, E. O. Bas, U. V. Catalyurek, Load-Balancing Spatially Located Computations using Rectangular Partitions Paper, Tech. Report, ArXiv, no. arXiv:1104.2566v1, 2011". More...
|
Namespaces |
namespace | twod |
| This namespace provides two dimensional algorithms.
|