+#include "process.h"
+
#include <algorithm>
-#include <functional>
+#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 "process.h"
-XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(simu);
+XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(proc);
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);
+
+ 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;
+
+ ctrl_close_pending = data_close_pending = neigh.size();
+ if (neigh.size() == 1) {
+ comm.next_close_on_ctrl_is_last();
+ comm.next_close_on_data_is_last();
+ }
+ if (neigh.size() > 0)
+ comm.listen();
+
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()) {
- oss << (neigh.size() > 1 ? "s: " : ": ");
+ oss << ESSE(neigh.size()) << ": ";
std::transform(neigh.begin(), neigh.end() - 1,
std::ostream_iterator<const char*>(oss, ", "),
- std::mem_fun_ref(&neighbor::get_name));
+ std::tr1::mem_fn(&neighbor::get_name));
oss << neigh.back().get_name();
}
LOG1(logp, "Got %s.", oss.str().c_str());
print_loads(logp);
}
+process::~process()
+{
+}
+
int process::run()
{
- INFO0("Coucou !");
+ bool one_more = true;
- int n = 100;
- while (n--) {
- if (load > 0)
+ INFO1("Initial load: %g", load);
+ VERB0("Starting...");
+ // first send() to inform neighbors about our load (force it)
+ prev_load_broadcast = !(opt::bookkeeping? expected_load: load);
+ send();
+ iter = 0;
+ while (one_more) {
+ 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);
+
+ bool do_compute = load > 0.0;
+ if (do_compute) {
compute();
+ ++iter;
+ }
+
+ bool close_received = !receive(do_compute? NO_WAIT: WAIT);
+
+ if (opt::bookkeeping)
+ expected_load -= load_balance(expected_load);
else
- xbt_sleep(0.5); // fixme
- receive();
+ load -= load_balance(load);
+
+ send();
+
+ if (opt::exit_on_close && close_received)
+ one_more = false;
+ if (opt::maxiter && iter >= opt::maxiter)
+ one_more = false;
}
- // MSG_process_sleep(100.0); // xxx
- /* xxx:
- * while (there is something to do) {
- * compute some task;
- * get received tasks;
- * compute load balancing;
- * send tasks to neighbors;
- * }
- * finalize;
- * wait for pending messages;
- */
+ VERB0("Going to finalize...");
+ finalize();
/* Open Questions :
* - definition of load on heterogeneous hosts ?
* - how to manage link failures ?
*/
- // xxx: shall we retrieve pending tasks?
-
+ VERB0("Done.");
+ if (opt::bookkeeping)
+ INFO4("Final load after %d iteration%s: %g ; expected: %g",
+ iter, ESSE(iter), load, expected_load);
+ else
+ INFO3("Final load after %d iteration%s: %g", iter, ESSE(iter), load);
return 0;
}
-void process::receive()
+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()
+{
+ 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);
+}
+
+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));
+}
+
+void process::send()
+{
+ using namespace std::tr1;
+ using namespace std::tr1::placeholders;
+
+ // fixme: shall we send data at all iterations?
+ 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;
+ }
+}
+
+// Returns false if a CLOSE message was received.
+bool process::receive(recv_wait_mode wait)
+{
+ bool result = true;
message* msg;
m_host_t from;
- while (comm.recv(msg, from)) {
+ bool do_recv = ctrl_close_pending || data_close_pending;
+ while (do_recv && comm.recv(msg, from, wait)) {
switch (msg->get_type()) {
- case message::INFO:
- // fixme: update neighbor
+ case message::INFO: {
+ neighbor* n = rev_neigh[from];
+ n->set_load(msg->get_amount());
break;
+ }
case message::CREDIT:
expected_load += msg->get_amount();
break;
case message::LOAD:
load += msg->get_amount();
break;
+ case message::CTRL_CLOSE:
+ if (--ctrl_close_pending == 1)
+ comm.next_close_on_ctrl_is_last();
+ DEBUG1("ctrl_close_pending = %d", ctrl_close_pending);
+ result = false;
+ break;
+ case message::DATA_CLOSE:
+ if (--data_close_pending == 1)
+ comm.next_close_on_data_is_last();
+ DEBUG1("data_close_pending = %d", data_close_pending);
+ result = false;
+ break;
}
delete msg;
+ do_recv = (wait == WAIT_FOR_CLOSE) &&
+ (ctrl_close_pending || data_close_pending);
}
+ return result;
}
-void process::compute()
+void process::finalize1(neighbor& nb)
{
- double duration = opt::comp_cost(load);
- m_task_t task = MSG_task_create("computation", duration, 0.0, NULL);
- DEBUG2("Compute %g flop%s.", duration, duration > 1 ? "s" : "");
- MSG_task_execute(task);
- MSG_task_destroy(task);
+ 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()
{
- // fixme
+ using namespace std::tr1;
+ using namespace std::tr1::placeholders;
+
+ DEBUG2("send CLOSE to %d neighbor%s.",
+ (int )neigh.size(), ESSE(neigh.size()));
+ 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()));
+ receive(WAIT_FOR_CLOSE);
+
+ comm.flush(true);
}
void process::print_loads(e_xbt_log_priority_t logp)
{
if (!LOG_ISENABLED(logp))
return;
+
std::ostringstream oss;
if (neigh.empty()) {
oss << "no neighbor!";
} else {
std::transform(neigh.begin(), neigh.end() - 1,
std::ostream_iterator<double>(oss, ", "),
- std::mem_fun_ref(&neighbor::get_load));
+ std::tr1::mem_fn(&neighbor::get_load));
oss << neigh.back().get_load();
}
LOG1(logp, "Neighbor loads: %s", oss.str().c_str());
