std::string loba_algo("simple");
bool bookkeeping = false;
double min_lb_iter_duration = 1.0; // fixme: find better defaults
+ double min_transfer_amount = 0.0;
+ double max_transfer_amount = 0.0;
// Application parameters
cost_func comp_cost("1e9, 0"); // fixme: find better defaults
loba_algorithms_type loba_algorithms;
loba_algorithms_type::loba_algorithms_type()
{
- NOL_INSERT("fairstrategy", "balance with fair strategy", loba_fairstrategy);
- NOL_INSERT("makhoul", "balance with Makhoul's PhD algorithm", loba_makhoul);
- NOL_INSERT("none", "no load-balancing (for testing only)", process);
- NOL_INSERT("simple", "balance with least loaded neighbor", loba_simple);
+ NOL_INSERT("fairstrategy", "balance with fair strategy",
+ loba_fairstrategy);
+ NOL_INSERT("makhoul", "balance with Makhoul's PhD algorithm",
+ loba_makhoul);
+ NOL_INSERT("none", "no load-balancing (for testing only)",
+ process);
+ NOL_INSERT("simple", "balance with least loaded neighbor",
+ loba_simple);
}
topologies_type topologies;
int c;
opterr = 0;
while ((c = getopt(*argc, argv,
- "a:bc:C:d:D:ehi:I:l:L:N:s:S:t:T:vV")) != -1) {
+ "a:bc:C:d:D:ehi:I:l:L:m:M:N:s:S:t:T:vV")) != -1) {
switch (c) {
case 'a':
opt::loba_algo = optarg;
try {
opt::comp_cost = cost_func(optarg);
} catch (...) {
- XBT_ERROR("invalid argument for option '-%c' -- \"%s\"", c, optarg);
+ XBT_ERROR("invalid argument for option '-%c' -- \"%s\"",
+ c, optarg);
result = false;
}
break;
try {
opt::comm_cost = cost_func(optarg);
} catch (...) {
- XBT_ERROR("invalid argument for option '-%c' -- \"%s\"", c, optarg);
+ XBT_ERROR("invalid argument for option '-%c' -- \"%s\"",
+ c, optarg);
result = false;
}
break;
case 'L':
PARSE_ARG(opt::auto_depl::load);
break;
+ case 'm':
+ PARSE_ARG(opt::min_transfer_amount);
+ break;
+ case 'M':
+ PARSE_ARG(opt::max_transfer_amount);
+ break;
case 'N':
PARSE_ARG(opt::auto_depl::nhosts);
break;
result = false;
}
+ if (opt::max_transfer_amount &&
+ opt::max_transfer_amount < opt::min_transfer_amount) {
+ XBT_ERROR("max. data transfer amount < min. data transfer amount");
+ result = false;
+ }
+
return result;
}
}
DESCR("load balancing algorithm", "%s", loba_algo.c_str());
DESCR("bookkeeping", "%s", h.on_off(bookkeeping));
- DESCR("minimum duration between lb. iterations", "%g", min_lb_iter_duration);
+ DESCR("minimum duration between lb. iterations", "%g",
+ min_lb_iter_duration);
DESCR("computation cost factors", "[%s]", comp_cost.to_string().c_str());
DESCR("communication cost factors", "[%s]", comm_cost.to_string().c_str());
- DESCR("minimum duration between comp. iterations", "%g", min_comp_iter_duration);
+ DESCR("minimum data transfer amount", "%g", min_transfer_amount);
+ DESCR("maximum data transfer amount", "%g", max_transfer_amount);
+ DESCR("minimum duration between comp. iterations", "%g",
+ min_comp_iter_duration);
DESCR("computations start after lb. iter", "%u", comp_iter_delay);
DESCR("computations start after time", "%g", comp_time_delay);
DESCR("maximum number of lb. iterations", "%s",
std::clog << o("-C [aN,...]a0")
<< "polynomial factors for communication cost"
<< " [" << opt::comm_cost.to_string() << "]\n";
+ std::clog << o("-m value")
+ << "minimum data transfer amount"
+ << " [" << opt::min_transfer_amount << "]\n";
+ std::clog << o("-M value")
+ << "maximum data transfer amount (0 for no limit)"
+ << " [" << opt::max_transfer_amount << "]\n";
std::clog << o("-S value")
<< "minimum duration between comp. iterations"
<< " [" << opt::min_comp_iter_duration << "]\n";