X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/loba.git/blobdiff_plain/8996be78fd84b1a3e10a2b7e66b264e28b524ebd..d568decaa9d3c62d0da2a32d2c636b4ed7fb8063:/loba_makhoul.cpp?ds=inline

diff --git a/loba_makhoul.cpp b/loba_makhoul.cpp
index dcce7b7..1807da4 100644
--- a/loba_makhoul.cpp
+++ b/loba_makhoul.cpp
@@ -2,40 +2,24 @@
 
 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;
-    using std::tr1::placeholders::_2;
-
     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::lower_bound(pneigh.begin(), pneigh.end(),
-                         get_load(),
-                         bind(std::less<double>(),
-                              bind(&neighbor::get_load, _1), _2));
-
-    // 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 (get_load() - 2 * transfer < pneigh[i]->get_load())
+            break;
+        send(pneigh[i], transfer);
+        XBT_DEBUG("sent %g to %s", transfer, pneigh[i]->get_name());
     }
 }