| spart_1d.cpp | |
| spart_2d.cpp | |
| spart_2d_visual.cpp | |
| spart_hybrid.cpp | |
| include/template.hpp [code] | |
| include/oned/direct_cut.hpp [code] | Greedily allocates to each processor the smallest interval with load less than average load |
| include/oned/direct_cut_impl.hpp [code] | |
| include/oned/direct_ref_b.hpp [code] | Same as DIRECT-CUT except this one recalculates average load after each allocation |
| include/oned/direct_ref_b_impl.hpp [code] | |
| include/oned/greedy_bisect.hpp [code] | Grabs the interval with largest load and cuts it into two equal loaded pieces |
| include/oned/greedy_bisect_impl.hpp [code] | |
| include/oned/nicol.hpp [code] | [Use NicolPlus instead] this is the implementation of the nicol's algorithm as it is provided in "Ali Pinar and Cevdet Aykanat, Fast Optimal Load Balancing Algorithms for 1D Partitioning, JPDC, 2004" in figure 5b |
| include/oned/nicol_impl.hpp [code] | |
| include/oned/nicol_minus.hpp [code] | [Use NicolPlus instead] this is the implementation of the nicol's algorithm as it is provided in "Ali Pinar and Cevdet Aykanat, Fast Optimal Load Balancing Algorithms for 1D Partitioning, JPDC, 2004" in figure 5a |
| include/oned/nicol_minus_impl.hpp [code] | |
| include/oned/nicol_plus.hpp [code] | This is the implementation of the nicols algorithm as it is provided in "Ali Pinar and Cevdet Aykanat, Fast Optimal Load
Balancing Algorithms for 1D Partitioning, JPDC, 2004" in figure 10 |
| include/oned/nicol_plus_impl.hpp [code] | |
| include/oned/nicol_plus_interval.hpp [code] | Given a prefix sum array in interval notation, this algorithm applies NicolPlus |
| include/oned/nicol_plus_interval_impl.hpp [code] | |
| include/oned/parse.hpp [code] | Converts the name of a 1d algorithm into a function pointer |
| include/oned/rec_bisect.hpp [code] | 1d recursive bisection |
| include/oned/rec_bisect_impl.hpp [code] | |
| include/oned/rec_bisect_minmax.hpp [code] | |
| include/oned/rec_bisect_minmax_impl.hpp [code] | |
| include/oned/template.hpp [code] | |
| include/oned/uniform.hpp [code] | |
| include/oned/uniform_impl.hpp [code] | |
| include/twod/her_jag_2d.hpp [code] | 2d Heuristic Jagged paritioning algorithm |
| include/twod/her_jag_2d_impl.hpp [code] | |
| include/twod/hybrid.hpp [code] | |
| include/twod/hybrid_impl.hpp [code] | |
| include/twod/jag_pq_opt_interval.hpp [code] | |
| include/twod/jag_pq_opt_interval_impl.hpp [code] | |
| include/twod/jagged_dp.hpp [code] | |
| include/twod/jagged_dp_impl.hpp [code] | |
| include/twod/jagged_dp_pq.hpp [code] | |
| include/twod/jagged_dp_pq_impl.hpp [code] | |
| include/twod/m_way_jag_2d.hpp [code] | M-way Jagged paritioning algorithm |
| include/twod/m_way_jag_2d_impl.hpp [code] | |
| include/twod/m_way_probe.hpp [code] | |
| include/twod/m_way_probe_impl.hpp [code] | |
| include/twod/nicol_2d.hpp [code] | Nicol's 2D partitioning algorithm |
| include/twod/nicol_2d_impl.hpp [code] | |
| include/twod/parse.hpp [code] | Converts algo name string into an object |
| include/twod/part_base.hpp [code] | |
| include/twod/part_base_impl.hpp [code] | |
| include/twod/rec_bisect_2d.hpp [code] | This is the implementation of the 2D recursive bisection algorithm |
| include/twod/rec_bisect_2d_impl.hpp [code] | |
| include/twod/rec_bisect_relaxed.hpp [code] | |
| include/twod/rec_bisect_relaxed_impl.hpp [code] | |
| include/twod/template.hpp [code] | |
| include/twod/uniform_2d.hpp [code] | |
| include/twod/uniform_2d_impl.hpp [code] | |
| include/util/aggreg2dto1dpart.hpp [code] | |
| include/util/aggreg2dto1dpart_impl.hpp [code] | |
| include/util/comm_cost_2d.hpp [code] | |
| include/util/comm_cost_2d_impl.hpp [code] | |
| include/util/compact.hpp [code] | |
| include/util/compact_impl.hpp [code] | |
| include/util/constraint.hpp [code] | |
| include/util/m_probe.hpp [code] | M-way partitioning algorithm feasibility check. The check is done on a set of arrays as described in section 3.2.2 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" |
| include/util/multiarrays.hpp [code] | A wrapper class to hold multiple arrays |
| include/util/parametric_search.hpp [code] | |
| include/util/parametric_search_impl.hpp [code] | |
| include/util/prefix2d.hpp [code] | |
| include/util/prefix2d_impl.hpp [code] | |
| include/util/prefix_sum_tools.hpp [code] | Basic prefix sum operations on arrays |
| include/util/prefix_sum_tools_impl.hpp [code] | |
| include/util/proportional.hpp [code] | |
| include/util/rect_list.hpp [code] | This file includes rectangle and rectangle list to represent 2D partitions |
| include/util/rect_list_impl.hpp [code] | |
| include/util/subpsa.hpp [code] | |
| include/util/template.hpp [code] | |
| include/util/timestamp.hpp [code] | |
| include/util/tools.hpp [code] | |
| include/util/transpose2d.hpp [code] | |
| include/util/version.hpp [code] | |
| regression_test/binary_ser/load_ufl.cpp | |
| regression_test/src/check_1dpart.c | |
| regression_test/src/check_2dpart.cpp | |
| regression_test/src/optimal1d_test.cpp | |
| regression_test/src/prefixSumTools_Test.cpp | |
| regression_test/src/test_direct_cut.cpp | |
| regression_test/src/test_direct_ref_b.cpp | |
| regression_test/src/test_greedy_bisect.cpp | |
| regression_test/src/test_her_jag_2d.cpp | |
| regression_test/src/test_nicol_2d.cpp | |
| regression_test/src/test_rec_bis_minmax_plateu.cpp | |
| regression_test/src/test_rec_bisect.cpp | |
| regression_test/src/test_rec_bisect_2d.cpp | |
| regression_test/src/test_rect_list.cpp | |
| regression_test/src/test_slope.cpp | |
| regression_test/src/test_subpsa.cpp | |
| regression_test/src/test_uni_cut.cpp | |
| regression_test/src/test_uniform_2d.cpp | |
1.7.1
