* under the terms of the license (GNU LGPL) which comes with this package. */
#include "src/kernel/lmm/bmf.hpp"
-#include "xbt/config.hpp"
#include <Eigen/LU>
#include <iostream>
XBT_LOG_NEW_DEFAULT_SUBCATEGORY(ker_bmf, kernel, "Kernel BMF solver");
-simgrid::config::Flag<int>
- cfg_bmf_max_iteration("bmf/max-iterations",
- "Maximum number of steps to be performed while searching for a BMF allocation", 1000);
-
-simgrid::config::Flag<double> cfg_bmf_precision{"bmf/precision",
- "Numerical precision used when computing resource sharing", 1E-12};
-
-namespace simgrid {
-namespace kernel {
-namespace lmm {
+namespace simgrid::kernel::lmm {
AllocationGenerator::AllocationGenerator(Eigen::MatrixXd A) : A_(std::move(A)), alloc_(A_.cols(), 0)
{
, C_shared_(std::move(shared))
, phi_(std::move(phi))
, gen_(A_)
- , max_iteration_(cfg_bmf_max_iteration)
{
xbt_assert(max_iteration_ > 0,
}
/* Given that the priority may artificially increase the rate,
* we need to check that the bound given by user respects the resource capacity C_ */
- if (double bound = initial ? -1 : phi_[player_idx];
- (bound > 0 && bound * A_(cnst_idx, player_idx) < C_[cnst_idx] &&
- double_positive(min_rate - bound, cfg_bmf_precision))) {
+ if (double bound = initial ? -1 : phi_[player_idx]; bound > 0 &&
+ bound * A_(cnst_idx, player_idx) < C_[cnst_idx] &&
+ double_positive(min_rate - bound, cfg_bmf_precision)) {
selected_resource = NO_RESOURCE;
min_rate = bound;
}
}
}
-} // namespace lmm
-} // namespace kernel
-} // namespace simgrid
+} // namespace simgrid::kernel::lmm