2 #include <tr1/functional>
10 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(proc);
17 double process::total_load_init = 0.0;
18 double process::total_load_running = 0.0;
19 double process::total_load_exit = 0.0;
21 process::process(int argc, char* argv[])
23 if (argc < 2 || !(std::istringstream(argv[1]) >> load))
24 throw std::invalid_argument("bad or missing initial load parameter");
26 neigh.assign(argv + 2, argv + argc);
28 pneigh.reserve(neigh.size());
29 for (unsigned i = 0 ; i < neigh.size() ; i++) {
30 neighbor* ptr = &neigh[i];
31 m_host_t host = MSG_get_host_by_name(ptr->get_name());
32 pneigh.push_back(ptr);
33 rev_neigh.insert(std::make_pair(host, ptr));
38 prev_load_broadcast = -1; // force sending of load on first send()
40 total_load_running += load;
41 total_load_init += load;
43 ctrl_close_pending = data_close_pending = neigh.size();
44 close_received = false;
47 e_xbt_log_priority_t logp = xbt_log_priority_verbose;
48 if (!LOG_ISENABLED(logp))
50 std::ostringstream oss;
51 oss << neigh.size() << " neighbor";
53 oss << ESSE(neigh.size()) << ": ";
54 std::transform(neigh.begin(), neigh.end() - 1,
55 std::ostream_iterator<const char*>(oss, ", "),
56 std::tr1::mem_fn(&neighbor::get_name));
57 oss << neigh.back().get_name();
59 LOG1(logp, "Got %s.", oss.str().c_str());
60 print_loads(false, logp);
65 total_load_exit += load;
70 double next_iter_after_date = 0.0;
71 INFO1("Initial load: %g", load);
73 comp_iter = lb_iter = 0;
75 double ld = lb_load();
77 double now = MSG_get_clock();
78 if (now < next_iter_after_date)
79 MSG_process_sleep(next_iter_after_date - now);
80 next_iter_after_date = MSG_get_clock() + opt::min_iter_duration;
84 if (opt::log_rate && lb_iter % opt::log_rate == 0) {
86 INFO4("(%u:%u) current load: %g ; expected: %g",
87 lb_iter, comp_iter, load, expected_load);
89 INFO2("(%u) current load: %g",
93 ld -= load_balance(ld);
95 print_loads(true, xbt_log_priority_debug);
99 // send load information, and load (data) if any
106 if (opt::lb_maxiter && lb_iter >= opt::lb_maxiter) {
107 VERB2("Reached lb_maxiter: %d/%d", lb_iter, opt::lb_maxiter);
110 if (opt::comp_maxiter && comp_iter >= opt::comp_maxiter) {
111 VERB2("Reached comp_maxiter: %d/%d", comp_iter, opt::comp_maxiter);
114 if (opt::time_limit && MSG_get_clock() >= opt::time_limit) {
115 VERB2("Reached time limit: %g/%g", MSG_get_clock(), opt::time_limit);
119 // block on receiving unless there is something to compute or
122 if (load != 0 || lb_load() != prev_load_broadcast)
124 else if (opt::min_iter_duration)
125 timeout = opt::min_iter_duration;
130 // one of our neighbor is finalizing
131 if (opt::exit_on_close && close_received) {
132 VERB0("Close received");
136 // have no load and cannot receive anything
137 if (load == 0.0 && !may_receive()) {
138 VERB0("I'm a poor lonesome process, and I have no load...");
142 // fixme: this check should be implemented with a distributed
143 // algorithm, and not a shared global variable!
144 // fixme: should this chunk be moved before call to receive() ?
145 if (100.0 * total_load_running / total_load_init <=
146 opt::load_ratio_threshold) {
147 VERB0("No more load to balance in system.");
150 DEBUG1("still %g load to balance, continuing...", total_load_running);
153 VERB0("Going to finalize...");
157 * - definition of load on heterogeneous hosts ?
158 * - how to detect convergence ?
159 * - how to manage link failures ?
163 if (opt::bookkeeping) {
164 INFO4("Final load after %d:%d iterations: %g ; expected: %g",
165 lb_iter, comp_iter, load, expected_load);
167 INFO2("Final load after %d iterations: %g",
169 if (lb_iter != comp_iter)
170 WARN2("lb_iter (%d) and comp_iter (%d) differ!",
176 double process::sum_of_to_send() const
178 using std::tr1::bind;
179 using std::tr1::placeholders::_1;
180 using std::tr1::placeholders::_2;
182 return std::accumulate(neigh.begin(), neigh.end(), 0.0,
183 bind(std::plus<double>(),
184 _1, bind(&neighbor::get_to_send, _2)));
187 double process::load_balance(double /*my_load*/)
189 if (lb_iter == 1) // warn only once
190 WARN0("process::load_balance() is a no-op!");
194 void process::compute()
197 double flops = opt::comp_cost(load);
198 m_task_t task = MSG_task_create("computation", flops, 0.0, NULL);
199 DEBUG2("compute %g flop%s", flops, ESSE(flops));
200 MSG_task_execute(task);
202 MSG_task_destroy(task);
204 DEBUG0("nothing to compute !");
208 void process::send1_no_bookkeeping(neighbor& nb)
210 if (load != prev_load_broadcast)
211 comm.send(nb.get_ctrl_mbox(), new message(message::INFO, load));
212 double load_to_send = nb.get_to_send();
213 if (load_to_send > 0.0) {
214 comm.send(nb.get_data_mbox(), new message(message::LOAD, load_to_send));
219 void process::send1_bookkeeping(neighbor& nb)
221 if (expected_load != prev_load_broadcast)
222 comm.send(nb.get_ctrl_mbox(),
223 new message(message::INFO, expected_load));
226 double debt_to_send = nb.get_to_send();
227 if (debt_to_send > 0.0) {
228 comm.send(nb.get_ctrl_mbox(),
229 new message(message::CREDIT, debt_to_send));
231 new_debt = nb.get_debt() + debt_to_send;
233 new_debt = nb.get_debt();
235 if (load <= new_debt) {
237 nb.set_debt(new_debt - load_to_send);
240 load_to_send = new_debt;
242 load -= load_to_send;
244 if (load_to_send > 0.0)
245 comm.send(nb.get_data_mbox(), new message(message::LOAD, load_to_send));
250 using std::tr1::bind;
251 using std::tr1::placeholders::_1;
253 if (opt::bookkeeping) {
254 std::for_each(neigh.begin(), neigh.end(),
255 bind(&process::send1_bookkeeping, this, _1));
256 prev_load_broadcast = expected_load;
258 std::for_each(neigh.begin(), neigh.end(),
259 bind(&process::send1_no_bookkeeping, this, _1));
260 prev_load_broadcast = load;
265 void process::receive(double timeout)
270 DEBUG2("%sblocking receive (%g)", "\0non-" + !timeout, timeout);
271 while (may_receive() && comm.recv(msg, from, timeout)) {
272 switch (msg->get_type()) {
273 case message::INFO: {
274 neighbor* n = rev_neigh[from];
275 n->set_load(msg->get_amount());
278 case message::CREDIT:
279 expected_load += msg->get_amount();
281 case message::LOAD: {
282 double ld = msg->get_amount();
285 total_load_running -= ld;
288 case message::CTRL_CLOSE:
289 ctrl_close_pending--;
290 close_received = true;
292 case message::DATA_CLOSE:
293 data_close_pending--;
294 close_received = true;
298 timeout = 0.0; // only wait on first recv
303 void process::finalize1(neighbor& nb)
305 comm.send(nb.get_ctrl_mbox(), new message(message::CTRL_CLOSE, 0.0));
306 comm.send(nb.get_data_mbox(), new message(message::DATA_CLOSE, 0.0));
309 void process::finalize()
311 using std::tr1::bind;
312 using std::tr1::placeholders::_1;
315 total_load_running -= load;
317 DEBUG2("send CLOSE to %lu neighbor%s",
318 (unsigned long )neigh.size(), ESSE(neigh.size()));
319 std::for_each(neigh.begin(), neigh.end(),
320 bind(&process::finalize1, this, _1));
322 DEBUG2("wait for CLOSE from %lu neighbor%s",
323 (unsigned long )neigh.size(), ESSE(neigh.size()));
324 while (may_receive()) {
332 #define print_loads_generic(vec, verbose, logp, cat) \
333 if (_XBT_LOG_ISENABLEDV((*cat), logp)) { \
334 using std::tr1::bind; \
335 using std::tr1::placeholders::_1; \
336 XCLOG0(cat, logp, "Neighbor loads:"); \
337 std::for_each(vec.begin(), vec.end(), \
338 bind(&neighbor::print, _1, verbose, logp, cat)); \
341 void process::print_loads(bool verbose,
342 e_xbt_log_priority_t logp,
343 xbt_log_category_t cat) const
345 print_loads_generic(neigh, verbose, logp, cat);
348 void process::print_loads_p(bool verbose,
349 e_xbt_log_priority_t logp,
350 xbt_log_category_t cat) const
352 print_loads_generic(pneigh, verbose, logp, cat);
355 #undef print_loads_generic