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

Private GIT Repository
Add option "-v" (verbose).
[loba.git] / process.cpp
index d8ec50036a4d6d9d2e93568bc944604bba118375..1556f3c4f8ba72df25c2ab9a98f3bfc09e0c42e7 100644 (file)
@@ -1,23 +1,38 @@
+#include "process.h"
+
 #include <algorithm>
 #include <tr1/functional>
 #include <iterator>
 #include <algorithm>
 #include <tr1/functional>
 #include <iterator>
+#include <numeric>
 #include <stdexcept>
 #include <sstream>
 #include <xbt/log.h>
 #include <xbt/time.h>
 #include "misc.h"
 #include "options.h"
 #include <stdexcept>
 #include <sstream>
 #include <xbt/log.h>
 #include <xbt/time.h>
 #include "misc.h"
 #include "options.h"
-#include "process.h"
 
 
-XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(simu);
+XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(proc);
+
+double process::total_load_init = 0.0;
+double process::total_load_exit = 0.0;
 
 process::process(int argc, char* argv[])
 {
     if (argc < 2 || !(std::istringstream(argv[1]) >> load))
 
 process::process(int argc, char* argv[])
 {
     if (argc < 2 || !(std::istringstream(argv[1]) >> load))
-        throw std::invalid_argument("bad or missing initial load");
+        throw std::invalid_argument("bad or missing initial load parameter");
 
     neigh.assign(argv + 2, argv + argc);
 
     neigh.assign(argv + 2, argv + argc);
+
+    pneigh.reserve(neigh.size());
+    for (unsigned i = 0 ; i < neigh.size() ; i++) {
+        neighbor* ptr = &neigh[i];
+        m_host_t host = MSG_get_host_by_name(ptr->get_name());
+        pneigh.push_back(ptr);
+        rev_neigh.insert(std::make_pair(host, ptr));
+    }
+
     expected_load = load;
     expected_load = load;
+    total_load_init += load;
 
     ctrl_close_pending = data_close_pending = neigh.size();
     if (neigh.size() == 1) {
 
     ctrl_close_pending = data_close_pending = neigh.size();
     if (neigh.size() == 1) {
@@ -30,7 +45,6 @@ process::process(int argc, char* argv[])
     e_xbt_log_priority_t logp = xbt_log_priority_verbose;
     if (!LOG_ISENABLED(logp))
         return;
     e_xbt_log_priority_t logp = xbt_log_priority_verbose;
     if (!LOG_ISENABLED(logp))
         return;
-    LOG1(logp, "My initial load is: %g", load);
     std::ostringstream oss;
     oss << neigh.size() << " neighbor";
     if (!neigh.empty()) {
     std::ostringstream oss;
     oss << neigh.size() << " neighbor";
     if (!neigh.empty()) {
@@ -44,37 +58,63 @@ process::process(int argc, char* argv[])
     print_loads(logp);
 }
 
     print_loads(logp);
 }
 
+process::~process()
+{
+    total_load_exit += load;
+}
+
 int process::run()
 {
 int process::run()
 {
-    bool one_more = true;
-    unsigned iter = 0;
+    INFO1("Initial load: %g", load);
     VERB0("Starting...");
     VERB0("Starting...");
-    while (one_more) {
-        bool close_received;
+    // first send() to inform neighbors about our load (force it)
+    prev_load_broadcast = -1;
+    iter = 0;
+    bool one_more = true;
+    do {
+        ++iter;
+
+        if (opt::log_rate && iter % opt::log_rate == 0) {
+            if (opt::bookkeeping)
+                INFO3("(%u) current load: %g ; expected: %g",
+                      iter, load, expected_load);
+            else
+                INFO2("(%u) current load: %g",
+                      iter, load);
+        }
+        print_loads(xbt_log_priority_debug);
 
         if (opt::bookkeeping)
 
         if (opt::bookkeeping)
-            INFO3("(%u) current load: %g ; expected: %g",
-                  iter, load, expected_load);
+            expected_load -= load_balance(expected_load);
         else
         else
-            INFO2("(%u) current load: %g",
-                  iter, load);
+            load -= load_balance(load);
 
 
+        send();
         compute();
         compute();
-        close_received = !receive(false);
 
 
-        /*
-         *    compute load balancing;
-         *    send tasks to neighbors;
-         */
+// NDS for Need To Send
+#define NDS ((opt::bookkeeping ? expected_load : load) != prev_load_broadcast)
+        bool can_recv;
+        do {
+            // General idea: do not iterate if there is nothing to
+            // compute, nor to send.
 
 
-        comm.flush(false);
-        ++iter;
+            // fixme: review this chunk, and remove this NDS macro!
 
 
-        if (opt::exit_on_close && close_received)
-            one_more = false;
-        if (opt::maxiter && iter >= opt::maxiter)
-            one_more = false;
-    }
+            bool recv_wait = (load == 0 && !NDS);
+            bool close_received = !receive(recv_wait? WAIT: NO_WAIT);
+
+            if (opt::exit_on_close && close_received)
+                one_more = false;
+            else if (opt::maxiter && iter >= opt::maxiter)
+                one_more = false;
+            
+            can_recv = (ctrl_close_pending || data_close_pending);
+
+        } while (one_more && can_recv && load == 0 && !NDS);
+#undef NDS
+
+    } while (one_more);
     VERB0("Going to finalize...");
     finalize();
 
     VERB0("Going to finalize...");
     finalize();
 
@@ -85,35 +125,113 @@ int process::run()
      */
 
     VERB0("Done.");
      */
 
     VERB0("Done.");
+    INFO3("Final load after %d iteration%s: %g", iter, ESSE(iter), load);
+    if (opt::bookkeeping)
+        INFO1("Expected load: %g", expected_load);
     return 0;
 }
 
     return 0;
 }
 
+double process::sum_of_to_send() const
+{
+    using namespace std::tr1;
+    using namespace std::tr1::placeholders;
+
+    return std::accumulate(neigh.begin(), neigh.end(), 0.0,
+                           bind(std::plus<double>(),
+                                _1, bind(&neighbor::get_to_send, _2)));
+}
+
+double process::load_balance(double /*my_load*/)
+{
+    if (iter == 1)
+        WARN0("process::load_balance is a no-op!");
+    return 0.0;
+}
+
 void process::compute()
 {
 void process::compute()
 {
-    // fixme: shall we do something special when duration is 0 ?
-    double duration = opt::comp_cost(load);
-    m_task_t task = MSG_task_create("computation", duration, 0.0, NULL);
-    DEBUG2("compute %g flop%s.", duration, ESSE(duration));
-    MSG_task_execute(task);
-    MSG_task_destroy(task);
+    if (load > 0.0) {
+        double duration = opt::comp_cost(load);
+        m_task_t task = MSG_task_create("computation", duration, 0.0, NULL);
+        DEBUG2("compute %g flop%s.", duration, ESSE(duration));
+        MSG_task_execute(task);
+        MSG_task_destroy(task);
+    } else {
+        DEBUG0("nothing to compute !");
+    }
+}
+
+void process::send1_no_bookkeeping(neighbor& nb)
+{
+    if (load != prev_load_broadcast)
+        comm.send(nb.get_ctrl_mbox(), new message(message::INFO, load));
+    double load_to_send = nb.get_to_send();
+    if (load_to_send > 0.0) {
+        comm.send(nb.get_data_mbox(), new message(message::LOAD, load_to_send));
+        nb.set_to_send(0.0);
+    }
 }
 
 }
 
+void process::send1_bookkeeping(neighbor& nb)
+{
+    if (expected_load != prev_load_broadcast)
+        comm.send(nb.get_ctrl_mbox(),
+                  new message(message::INFO, expected_load));
+    double load_to_send;
+    double new_debt;
+    double debt_to_send = nb.get_to_send();
+    if (debt_to_send > 0.0) {
+        comm.send(nb.get_ctrl_mbox(),
+                  new message(message::CREDIT, debt_to_send));
+        nb.set_to_send(0.0);
+        new_debt = nb.get_debt() + debt_to_send;
+    } else {
+        new_debt = nb.get_debt();
+    }
+    if (load <= new_debt) {
+        load_to_send = load;
+        nb.set_debt(new_debt - load_to_send);
+        load = 0.0;
+    } else {
+        load_to_send = new_debt;
+        nb.set_debt(0.0);
+        load -= load_to_send;
+    }
+    if (load_to_send > 0.0)
+        comm.send(nb.get_data_mbox(), new message(message::LOAD, load_to_send));
+}
 
 
-// Returns false if a CLOSE message was received. 
-bool process::receive(bool wait_for_close)
+void process::send()
 {
 {
+    using namespace std::tr1;
+    using namespace std::tr1::placeholders;
+
+    if (opt::bookkeeping) {
+        std::for_each(neigh.begin(), neigh.end(),
+                      bind(&process::send1_bookkeeping, this, _1));
+        prev_load_broadcast = expected_load;
+    } else {
+        std::for_each(neigh.begin(), neigh.end(),
+                      bind(&process::send1_no_bookkeeping, this, _1));
+        prev_load_broadcast = load;
+    }
+}
+
+bool process::receive(recv_wait_mode wait)
+{
+    // DEBUG1("go for receive(%s)",
+    //        "NO_WAIT\0WAIT\0\0\0\0WAIT_FOR_CLOSE" + 8 * wait);
     bool result = true;
     message* msg;
     m_host_t from;
     bool result = true;
     message* msg;
     m_host_t from;
-    while ((ctrl_close_pending ||
-            data_close_pending) && comm.recv(msg, from, wait_for_close)) {
-        DEBUG2("received %s from %s",
-               msg->to_string().c_str(), MSG_host_get_name(from));
+    bool do_recv = ctrl_close_pending || data_close_pending;
+    while (do_recv && comm.recv(msg, from, wait)) {
         switch (msg->get_type()) {
         switch (msg->get_type()) {
-        case message::INFO:
-            // fixme: update neighbor
-            // need a map m_host_t -> neighbor&
+        case message::INFO: {
+            neighbor* n = rev_neigh[from];
+            n->set_load(msg->get_amount());
             break;
             break;
+        }
         case message::CREDIT:
             expected_load += msg->get_amount();
             break;
         case message::CREDIT:
             expected_load += msg->get_amount();
             break;
@@ -134,23 +252,31 @@ bool process::receive(bool wait_for_close)
             break;
         }
         delete msg;
             break;
         }
         delete msg;
+        do_recv = (wait == WAIT_FOR_CLOSE) &&
+            (ctrl_close_pending || data_close_pending);
     }
     return result;
 }
 
     }
     return result;
 }
 
+void process::finalize1(neighbor& nb)
+{
+    comm.send(nb.get_ctrl_mbox(), new message(message::CTRL_CLOSE, 0.0));
+    comm.send(nb.get_data_mbox(), new message(message::DATA_CLOSE, 0.0));    
+}
+
 void process::finalize()
 {
 void process::finalize()
 {
+    using namespace std::tr1;
+    using namespace std::tr1::placeholders;
+
     DEBUG2("send CLOSE to %d neighbor%s.",
            (int )neigh.size(), ESSE(neigh.size()));
     DEBUG2("send CLOSE to %d neighbor%s.",
            (int )neigh.size(), ESSE(neigh.size()));
-    std::vector<neighbor>::iterator n;
-    for (n = neigh.begin() ; n != neigh.end() ; ++n) {
-        comm.send(n->get_ctrl_mbox(), new message(message::CTRL_CLOSE, 0.0));
-        comm.send(n->get_data_mbox(), new message(message::DATA_CLOSE, 0.0));
-    }
+    std::for_each(neigh.begin(), neigh.end(),
+                  bind(&process::finalize1, this, _1));
 
     DEBUG2("wait for CLOSE from %d neighbor%s.",
            (int )neigh.size(), ESSE(neigh.size()));
 
     DEBUG2("wait for CLOSE from %d neighbor%s.",
            (int )neigh.size(), ESSE(neigh.size()));
-    receive(true);
+    receive(WAIT_FOR_CLOSE);
 
     comm.flush(true);
 }
 
     comm.flush(true);
 }