int process::run()
{
+ double next_iter_after_date = 0.0;
INFO1("Initial load: %g", load);
VERB0("Starting...");
comp_iter = lb_iter = 0;
while (true) {
+ if (opt::min_iter_duration) {
+ double now = MSG_get_clock();
+ if (now < next_iter_after_date){
+ double delay = next_iter_after_date - now;
+ DEBUG1("sleeping for %g s", delay);
+ MSG_process_sleep(next_iter_after_date - now);
+ }
+ next_iter_after_date = MSG_get_clock() + opt::min_iter_duration;
+ }
+
if (load > 0.0) {
++comp_iter;
if (opt::log_rate && comp_iter % opt::log_rate == 0) {
send();
}
- if (opt::comp_maxiter && comp_iter >= opt::comp_maxiter)
+ if (opt::comp_maxiter && comp_iter >= opt::comp_maxiter) {
+ VERB2("Reached comp_maxiter: %d/%d", comp_iter, opt::comp_maxiter);
break;
- if (opt::lb_maxiter && lb_iter >= opt::lb_maxiter)
+ }
+ if (opt::lb_maxiter && lb_iter >= opt::lb_maxiter) {
+ VERB2("Reached lb_maxiter: %d/%d", lb_iter, opt::lb_maxiter);
break;
+ }
+ if (opt::time_limit && MSG_get_clock() >= opt::time_limit) {
+ VERB2("Reached time limit: %g/%g", MSG_get_clock(), opt::time_limit);
+ break;
+ }
// block on receiving unless there is something to compute or
// to send
receive(wait);
// one of our neighbor is finalizing
- if (opt::exit_on_close && close_received)
+ if (opt::exit_on_close && close_received) {
+ VERB0("Close received");
break;
+ }
// have no load and cannot receive anything
- if (load == 0.0 && !may_receive())
+ if (load == 0.0 && !may_receive()) {
+ VERB0("I'm a poor lonesome process, and I have no load...");
break;
+ }
// fixme: this check should be implemented with a distributed
// algorithm, and not a shared global variable!
// fixme: should this chunk be moved before call to receive() ?
if (100.0 * total_load_running / total_load_init <=
opt::load_ratio_threshold) {
- VERB0("No more load to balance in system, stopping.");
+ VERB0("No more load to balance in system.");
break;
}
-
}
VERB0("Going to finalize...");
finalize();
*/
VERB0("Done.");
- INFO3("Final load after %d iteration%s: %g",
- comp_iter, ESSE(comp_iter), load);
- if (opt::bookkeeping)
- INFO1("Expected load: %g", expected_load);
+ if (opt::bookkeeping) {
+ INFO4("Final load after %d:%d iterations: %g ; expected: %g",
+ comp_iter, lb_iter, load, expected_load);
+ } else {
+ INFO2("Final load after %d iterations: %g",
+ comp_iter, load);
+ if (comp_iter != lb_iter)
+ WARN2("comp_iter (%d) and lb_iter (%d) differ!",
+ comp_iter, lb_iter);
+ }
return 0;
}
double process::load_balance(double /*my_load*/)
{
if (lb_iter == 1) // warn only once
- WARN0("process::load_balance is a no-op!");
+ WARN0("process::load_balance() is a no-op!");
return 0.0;
}
bind(&process::send1_no_bookkeeping, this, _1));
prev_load_broadcast = load;
}
+ comm.flush(false);
}
void process::receive(bool wait)
message* msg;
m_host_t from;
- if (may_receive() && comm.recv(msg, from, wait)) {
+ while (may_receive() && comm.recv(msg, from, wait)) {
switch (msg->get_type()) {
case message::INFO: {
neighbor* n = rev_neigh[from];
break;
}
delete msg;
+ wait = false; // only wait on first recv
}
+ comm.flush(false);
}
void process::finalize1(neighbor& nb)
DEBUG2("wait for CLOSE from %lu neighbor%s",
(unsigned long )neigh.size(), ESSE(neigh.size()));
- while (may_receive())
+ while (may_receive()) {
+ comm.flush(false);
receive(true);
+ }
comm.flush(true);
}