2 #include <tr1/functional>
10 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(proc);
18 double process::total_load_init = 0.0;
19 double process::total_load_running = 0.0;
20 double process::total_load_exit = 0.0;
22 process::process(int argc, char* argv[])
24 if (argc < 2 || !(std::istringstream(argv[1]) >> load))
25 throw std::invalid_argument("bad or missing initial load parameter");
27 neigh.assign(argv + 2, argv + argc);
29 pneigh.reserve(neigh.size());
30 for (unsigned i = 0 ; i < neigh.size() ; i++) {
31 neighbor* ptr = &neigh[i];
32 m_host_t host = MSG_get_host_by_name(ptr->get_name());
33 pneigh.push_back(ptr);
34 rev_neigh.insert(std::make_pair(host, ptr));
39 prev_load_broadcast = -1; // force sending of load on first send()
41 total_load_running += load;
42 total_load_init += load;
44 ctrl_close_pending = data_close_pending = neigh.size();
45 close_received = false;
48 e_xbt_log_priority_t logp = xbt_log_priority_verbose;
49 if (!LOG_ISENABLED(logp))
51 std::ostringstream oss;
52 oss << neigh.size() << " neighbor";
54 oss << ESSE(neigh.size()) << ": ";
55 std::transform(neigh.begin(), neigh.end() - 1,
56 std::ostream_iterator<const char*>(oss, ", "),
57 std::tr1::mem_fn(&neighbor::get_name));
58 oss << neigh.back().get_name();
60 LOG1(logp, "Got %s.", oss.str().c_str());
61 print_loads(false, logp);
66 total_load_exit += load;
67 if (opt::bookkeeping) {
68 INFO4("Final load after %d:%d iterations: %g ; expected: %g",
69 lb_iter, comp_iter, load, expected_load);
71 INFO2("Final load after %d iterations: %g",
73 if (lb_iter != comp_iter)
74 WARN2("lb_iter (%d) and comp_iter (%d) differ!",
77 VERB1("Total computation for this process: %g", comp);
82 double next_iter_after_date = 0.0;
83 INFO1("Initial load: %g", load);
85 comp_iter = lb_iter = 0;
87 double ld = lb_load();
89 double now = MSG_get_clock();
90 if (now < next_iter_after_date)
91 MSG_process_sleep(next_iter_after_date - now);
92 next_iter_after_date = MSG_get_clock() + opt::min_iter_duration;
96 if (opt::log_rate && lb_iter % opt::log_rate == 0) {
98 INFO4("(%u:%u) current load: %g ; expected: %g",
99 lb_iter, comp_iter, load, expected_load);
101 INFO2("(%u) current load: %g",
105 ld -= load_balance(ld);
107 print_loads(true, xbt_log_priority_debug);
111 // send load information, and load (data) if any
118 if (opt::lb_maxiter && lb_iter >= opt::lb_maxiter) {
119 VERB2("Reached lb_maxiter: %d/%d", lb_iter, opt::lb_maxiter);
122 if (opt::comp_maxiter && comp_iter >= opt::comp_maxiter) {
123 VERB2("Reached comp_maxiter: %d/%d", comp_iter, opt::comp_maxiter);
126 if (opt::time_limit && MSG_get_clock() >= opt::time_limit) {
127 VERB2("Reached time limit: %g/%g", MSG_get_clock(), opt::time_limit);
131 // block on receiving unless there is something to compute or
134 if (load != 0 || lb_load() != prev_load_broadcast)
136 else if (opt::min_iter_duration)
137 timeout = opt::min_iter_duration;
142 // one of our neighbor is finalizing
143 if (opt::exit_on_close && close_received) {
144 VERB0("Close received");
148 // have no load and cannot receive anything
149 if (load == 0.0 && !may_receive()) {
150 VERB0("I'm a poor lonesome process, and I have no load...");
154 // fixme: this check should be implemented with a distributed
155 // algorithm, and not a shared global variable!
156 // fixme: should this chunk be moved before call to receive() ?
157 if (100.0 * total_load_running / total_load_init <=
158 opt::load_ratio_threshold) {
159 VERB0("No more load to balance in system.");
162 DEBUG1("still %g load to balance, continuing...", total_load_running);
165 VERB0("Going to finalize...");
169 * - definition of load on heterogeneous hosts ?
170 * - how to detect convergence ?
171 * - how to manage link failures ?
178 double process::sum_of_to_send() const
180 using std::tr1::bind;
181 using std::tr1::placeholders::_1;
182 using std::tr1::placeholders::_2;
184 return std::accumulate(neigh.begin(), neigh.end(), 0.0,
185 bind(std::plus<double>(),
186 _1, bind(&neighbor::get_to_send, _2)));
189 double process::load_balance(double /*my_load*/)
191 if (lb_iter == 1) // warn only once
192 WARN0("process::load_balance() is a no-op!");
196 void process::compute()
199 double flops = opt::comp_cost(load);
200 m_task_t task = MSG_task_create("computation", flops, 0.0, NULL);
201 TRACE_msg_set_task_category(task, TRACE_CAT_COMP);
202 DEBUG2("compute %g flop%s", flops, ESSE(flops));
203 MSG_task_execute(task);
205 MSG_task_destroy(task);
207 DEBUG0("nothing to compute !");
211 void process::send1_no_bookkeeping(neighbor& nb)
213 if (load != prev_load_broadcast)
214 comm.send(nb.get_ctrl_mbox(), new message(message::INFO, load));
215 double load_to_send = nb.get_to_send();
216 if (load_to_send > 0.0) {
217 comm.send(nb.get_data_mbox(), new message(message::LOAD, load_to_send));
222 void process::send1_bookkeeping(neighbor& nb)
224 if (expected_load != prev_load_broadcast)
225 comm.send(nb.get_ctrl_mbox(),
226 new message(message::INFO, expected_load));
229 double debt_to_send = nb.get_to_send();
230 if (debt_to_send > 0.0) {
231 comm.send(nb.get_ctrl_mbox(),
232 new message(message::CREDIT, debt_to_send));
234 new_debt = nb.get_debt() + debt_to_send;
236 new_debt = nb.get_debt();
238 if (load <= new_debt) {
240 nb.set_debt(new_debt - load_to_send);
243 load_to_send = new_debt;
245 load -= load_to_send;
247 if (load_to_send > 0.0)
248 comm.send(nb.get_data_mbox(), new message(message::LOAD, load_to_send));
253 using std::tr1::bind;
254 using std::tr1::placeholders::_1;
256 if (opt::bookkeeping) {
257 std::for_each(neigh.begin(), neigh.end(),
258 bind(&process::send1_bookkeeping, this, _1));
259 prev_load_broadcast = expected_load;
261 std::for_each(neigh.begin(), neigh.end(),
262 bind(&process::send1_no_bookkeeping, this, _1));
263 prev_load_broadcast = load;
268 void process::receive(double timeout)
273 DEBUG2("%sblocking receive (%g)", "\0non-" + !timeout, timeout);
274 while (may_receive() && comm.recv(msg, from, timeout)) {
275 switch (msg->get_type()) {
276 case message::INFO: {
277 neighbor* n = rev_neigh[from];
278 n->set_load(msg->get_amount());
281 case message::CREDIT:
282 expected_load += msg->get_amount();
284 case message::LOAD: {
285 double ld = msg->get_amount();
288 total_load_running -= ld;
291 case message::CTRL_CLOSE:
292 ctrl_close_pending--;
293 close_received = true;
295 case message::DATA_CLOSE:
296 data_close_pending--;
297 close_received = true;
301 timeout = 0.0; // only wait on first recv
306 void process::finalize1(neighbor& nb)
308 comm.send(nb.get_ctrl_mbox(), new message(message::CTRL_CLOSE, 0.0));
309 comm.send(nb.get_data_mbox(), new message(message::DATA_CLOSE, 0.0));
312 void process::finalize()
314 using std::tr1::bind;
315 using std::tr1::placeholders::_1;
318 total_load_running -= load;
320 DEBUG2("send CLOSE to %lu neighbor%s",
321 (unsigned long )neigh.size(), ESSE(neigh.size()));
322 std::for_each(neigh.begin(), neigh.end(),
323 bind(&process::finalize1, this, _1));
325 DEBUG2("wait for CLOSE from %lu neighbor%s",
326 (unsigned long )neigh.size(), ESSE(neigh.size()));
327 while (may_receive()) {
335 #define print_loads_generic(vec, verbose, logp, cat) \
336 if (_XBT_LOG_ISENABLEDV((*cat), logp)) { \
337 using std::tr1::bind; \
338 using std::tr1::placeholders::_1; \
339 XCLOG0(cat, logp, "Neighbor loads:"); \
340 std::for_each(vec.begin(), vec.end(), \
341 bind(&neighbor::print, _1, verbose, logp, cat)); \
344 void process::print_loads(bool verbose,
345 e_xbt_log_priority_t logp,
346 xbt_log_category_t cat) const
348 print_loads_generic(neigh, verbose, logp, cat);
351 void process::print_loads_p(bool verbose,
352 e_xbt_log_priority_t logp,
353 xbt_log_category_t cat) const
355 print_loads_generic(pneigh, verbose, logp, cat);
358 #undef print_loads_generic