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) {
break;
if (opt::lb_maxiter && 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
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);
}