cf. MAKHOUL.txt
+makhoul3
+========
+Comme makhoul mais, dans le ratio 1/(N+1), N correspond au nombre de
+voisins moins chargés.
+
+
none
====
Aucun équilibrage. Peut-être utile pour tester/déboguer le code.
pneigh_sort_by_load(std::less<double>());
print_loads_p(false, xbt_log_priority_debug);
- int nb_less_loaded=0;
- for (unsigned i = 0 ; i < pneigh.size() ; ++i) {
- nb_less_loaded+=(pneigh[i]->get_load()<=get_load());
- }
+ int nb_less_loaded = 0;
+ for (unsigned i = 0 ; i < pneigh.size() ; ++i) {
+ nb_less_loaded += (pneigh[i]->get_load() <= get_load());
+ }
double alpha = 1.0 / (nb_less_loaded );
double my_load = get_load();
loba_makhoul);
NOL_INSERT("makhoul2", "balance with Makhoul's source code",
loba_makhoul2);
- NOL_INSERT("makhoul3", "describe your algorithm here...",
+ NOL_INSERT("makhoul3", "variation on Makhoul's algorithm",
loba_makhoul3);
NOL_INSERT("none", "no load-balancing (for testing only)",
process);