#include "loba_fairstrategy.h"
-/* simple version:
- * load balance with a least-loaded neighbor,
- * without breaking the ping-pong condition
- */
-
-class compare {
-public:
- bool operator()(const neighbor*a, const neighbor*b) {
- return a->get_load() > b->get_load();
- }
-};
-
void loba_fairstrategy::load_balance()
{
- std::sort(pneigh.begin(), pneigh.end(), compare());
+ const double delta = 0.001;
+
+ std::sort(pneigh.begin(), pneigh.end(), pneigh_load_greater());
- // print_loads_p();
- //print_loads_p(false, xbt_log_priority_debug);
+ print_loads_p(false, xbt_log_priority_debug);
bool found = true;
while (found) {
found = false;
for (unsigned i = 0 ; i < pneigh.size() ; ++i) {
- if (pneigh[i]->get_load() <= get_load() - .002) {
+ if (pneigh[i]->get_load() <= get_load() - 2 * delta) {
found = true;
- send(pneigh[i], .001);
- DEBUG1("sent to %s", pneigh[i]->get_name());
+ send(pneigh[i], delta);
+ XBT_DEBUG("sent to %s", pneigh[i]->get_name());
}
}
}