X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/loba.git/blobdiff_plain/fdc3237504c68a8f89faf2c56fa281df7f2bb972..9a61d03554f90cad51c1e367f20cbf64f90bd75a:/loba_fairstrategy.cpp?ds=inline

diff --git a/loba_fairstrategy.cpp b/loba_fairstrategy.cpp
index fd710c2..4ad0bff 100644
--- a/loba_fairstrategy.cpp
+++ b/loba_fairstrategy.cpp
@@ -1,41 +1,40 @@
-#include "loba_fairstrategy.h"
-
+#include <algorithm>
 #include <xbt/log.h>
 
 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(loba);
 
+#include "loba_fairstrategy.h"
+
 /* simple version:
  *   load balance with a least-loaded neighbor,
  *   without breaking the ping-pong condition
  */
-double loba_fairstrategy::load_balance(double my_load)
+
+class compare {
+public:
+    bool operator()(const neighbor*a, const neighbor*b) {
+        return a->get_load() > b->get_load();
+    }
+};
+
+void loba_fairstrategy::load_balance()
 {
-    int imin = -1;
-    int imax = -1;
-    double min = my_load;
-    double max = -1.0;
-    for (unsigned i = 0 ; i < pneigh.size() ; ++i) {
-        double l = pneigh[i]->get_load();
-        if (l >= my_load)
-            continue;
-        if (l < min) {
-            imin = i;
-            min = l;
-        }
-        if (l > max) {
-            imax = i;
-            max = l;
+    std::sort(pneigh.begin(), pneigh.end(), compare());
+
+    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() - 2) {
+                found = true;
+                send(pneigh[i], 1);
+                DEBUG1("sent to %s", pneigh[i]->get_name());
+            }
         }
     }
-    if (imin != -1) {
-        // found someone
-        double balance = (my_load - max) / 2;
-        DEBUG6("%d:%g %d:%g %g %g", imin, min, imax, max, my_load, balance);
-        pneigh[imin]->set_to_send(balance);
-        return balance;
-    } else {
-        return 0.0;
-    }
 }
 
 // Local variables: