]> AND Private Git Repository - loba.git/blobdiff - loba_fairstrategy.cpp
Logo AND Algorithmique Numérique Distribuée

Private GIT Repository
TODO update.
[loba.git] / loba_fairstrategy.cpp
index 7e02a21361c646ea6aabc18e084d7233cc2ab219..98b42cd831bbf23f70533d32858cdc8e014af8c4 100644 (file)
@@ -5,11 +5,6 @@ XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(loba);
 
 #include "loba_fairstrategy.h"
 
 
 #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) {
 class compare {
 public:
     bool operator()(const neighbor*a, const neighbor*b) {
@@ -19,20 +14,21 @@ public:
 
 void loba_fairstrategy::load_balance()
 {
 
 void loba_fairstrategy::load_balance()
 {
+    const double delta = 0.001;
+
     std::sort(pneigh.begin(), pneigh.end(), compare());
 
     std::sort(pneigh.begin(), pneigh.end(), compare());
 
-               // 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) {
 
     bool found = true;
 
     while (found) {
         found = false;
         for (unsigned i = 0 ; i < pneigh.size() ; ++i) {
-            if (pneigh[i]->get_load() <= get_load() - 2) {
+            if (pneigh[i]->get_load() <= get_load() - 2 * delta) {
                 found = true;
                 found = true;
-                send(pneigh[i], 1);
-                DEBUG1("sent to %s", pneigh[i]->get_name());
+                send(pneigh[i], delta);
+                XBT_DEBUG("sent to %s", pneigh[i]->get_name());
             }
         }
     }
             }
         }
     }