Render algorithm makhoul much more simpler.

[loba.git] / loba_makhoul.cpp

diff --git a/loba_makhoul.cpp b/loba_makhoul.cpp
index 2fca60b5ba5f18d1f8dc9782e49acdd0ebde6114..8ee3b3e82dbe579afe2d86f55ba9d9a679811f66 100644 (file)
--- a/loba_makhoul.cpp
+++ b/loba_makhoul.cpp
@@ -2,38 +2,26 @@
 
 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(loba);
 
-#include <algorithm>
-#include <tr1/functional>
 #include "loba_makhoul.h"
 
 void loba_makhoul::load_balance()
 {
-    using std::tr1::bind;
-    using std::tr1::placeholders::_1;
-
     pneigh_sort_by_load(std::less<double>());
 
     print_loads_p(false, xbt_log_priority_debug);
 
-    // find limit between least loaded neighbors, and more loaded ones
-    pneigh_type::iterator bound =
-        std::find_if(pneigh.begin(), pneigh.end(),
-                     bind(std::less_equal<double>(),
-                          get_load(), bind(&neighbor::get_load, _1)));
-
-    // compute load differences
-    std::vector<double> delta(bound - pneigh.begin());
-    std::transform(pneigh.begin(), bound, delta.begin(),
-                   bind(std::minus<double>(),
-                        get_load(), bind(&neighbor::get_load, _1)));
-
-    // send load...
     double alpha = 1.0 / (pneigh.size() + 1.0);
-    for (unsigned i = 0 ;
-         i < delta.size() && pneigh[i]->get_load() < get_load() ; ++i) {
-        double balance = delta[i] * alpha;
-        send(pneigh[i], balance);
-        XBT_DEBUG("sent %g to %s", balance, pneigh[i]->get_name());
+    double myLoad = get_load();
+    for (unsigned i = 0; i < pneigh.size(); i++) {
+        double delta = std::max(myLoad - pneigh[i]->get_load(), 0.0);
+        double transfer = alpha * delta;
+        XBT_DEBUG("delta = %g ; transfer = %g", delta, transfer);
+        if (pneigh[i]->get_load() <= get_load() - 2 * transfer) {
+            send(pneigh[i], transfer);
+            XBT_DEBUG("sent %g to %s", transfer, pneigh[i]->get_name());
+        } else {
+            break;
+        }
     }
 }