// Load balancing algorithm
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
- // fixme: find better defaults
- cost_func comp_cost("1e9, 0");
- cost_func comm_cost("1e6, 0");
- double min_lb_iter_duration = 1.0;
- double min_comp_iter_duration = 1.0;
+ cost_func comp_cost("1e9, 0"); // fixme: find better defaults
+ cost_func comm_cost("1e6, 0"); // fixme: find better defaults
+ double min_comp_iter_duration = 1.0; // fixme: find better defaults
+ unsigned comp_iter_delay = 0; // fixme: find better defaults
+ double comp_time_delay = 0.0; // fixme: find better defaults
// Parameters for the end of the simulation
unsigned lb_maxiter = 0;
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:ehi:I:l:L:N:s:S:t:T:vV")) != -1) {
+ while ((c = getopt(*argc, argv,
+ "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 'd':
+ PARSE_ARG(opt::comp_iter_delay);
+ break;
+ case 'D':
+ PARSE_ARG(opt::comp_time_delay);
+ break;
case 'i':
PARSE_ARG(opt::lb_maxiter);
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("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 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 data transfer amount", "%g", min_transfer_amount);
+ DESCR("maximum data transfer amount", "%s",
+ h.val_or_string(max_transfer_amount, "no limit"));
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",
- h.val_or_string(lb_maxiter, "infinity"));
+ h.val_or_string(lb_maxiter, "no limit"));
DESCR("maximum number of comp. iterations", "%s",
- h.val_or_string(comp_maxiter, "infinity"));
- DESCR("time limit", "%s", h.val_or_string(time_limit, "infinity"));
+ h.val_or_string(comp_maxiter, "no limit"));
+ DESCR("time limit", "%s", h.val_or_string(time_limit, "no limit"));
DESCR("exit on close", "%s", h.on_off(exit_on_close));
XBT_INFO("`----");
so_list(opt::loba_algorithms);
std::clog << o("-b") << "toggle bookkeeping (\"virtual load\")"
<< " [" << opt_helper::on_off(opt::bookkeeping) << "]\n";
+ std::clog << o("-s value")
+ << "minimum duration between lb. iterations"
+ << " [" << opt::min_lb_iter_duration << "]\n";
std::clog << "\nApplication parameters\n";
std::clog << o("-c [aN,...]a0")
std::clog << o("-C [aN,...]a0")
<< "polynomial factors for communication cost"
<< " [" << opt::comm_cost.to_string() << "]\n";
- std::clog << o("-s value")
- << "minimum duration between lb. iterations"
- << " [" << opt::min_lb_iter_duration << "]\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";
+ std::clog << o("-d value")
+ << "start computations after given number of lb iterations"
+ << " [" << opt::comp_iter_delay << "]\n";
+ std::clog << o("-D value")
+ << "start computations after given time"
+ << " [" << opt::comp_time_delay << "]\n";
std::clog << "\nParameters for the end of the simulation\n";
std::clog << o("-i value")
- << "maximum number of lb. iterations, 0 for infinity"
+ << "maximum number of lb. iterations, 0 for no limit"
<< " [" << opt::lb_maxiter << "]\n";
std::clog << o("-I value")
- << "maximum number of comp. iterations, 0 for infinity"
+ << "maximum number of comp. iterations, 0 for no limit"
<< " [" << opt::comp_maxiter << "]\n";
std::clog << o("-t value")
- << "time limit (simulated time), 0 for infinity"
+ << "time limit (simulated time), 0 for no limit"
<< " [" << opt::time_limit << "]\n";
std::clog << o("-e") << "toggle exit on reception of \"close\" message"
<< " [" << opt_helper::on_off(opt::exit_on_close) << "]\n";
