-/* Copyright (c) 2004-2022. The SimGrid Team. All rights reserved. */
+/* Copyright (c) 2004-2023. The SimGrid Team. All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
* under the terms of the license (GNU LGPL) which comes with this package. */
#define SIMGRID_KERNEL_LMM_BMF_HPP
#include "src/kernel/lmm/System.hpp"
+#include "xbt/config.hpp"
+
+#include <set>
+
+#ifdef __clang__
+// Ignore deprecation warnings with Eigen < 4.0 (see https://gitlab.com/libeigen/eigen/-/issues/1850)
+#pragma clang diagnostic push
+#pragma clang diagnostic ignored "-Wdeprecated-declarations"
+#endif
#include <Eigen/Dense>
+#ifdef __clang__
+#pragma clang diagnostic pop
+#endif
+
#include <unordered_set>
-namespace simgrid {
-namespace kernel {
-namespace lmm {
+namespace simgrid::kernel::lmm {
/** @brief Generate all combinations of valid allocation */
class XBT_PUBLIC AllocationGenerator {
* @endrst
*/
class XBT_PUBLIC BmfSolver {
+ inline static 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};
+
+ inline static simgrid::config::Flag<double> cfg_bmf_precision{
+ "bmf/precision", {"precision/bmf"}, "Numerical precision used when computing resource sharing", 1E-12};
+
public:
/**
* @brief Instantiate the BMF solver
* @param C Resource capacity
* @param shared Is resource shared between player or each player receives the full capacity (FATPIPE links)
* @param phi Bound for each player
- * @param weight Weight/priority for each player
*/
- BmfSolver(Eigen::MatrixXd A, Eigen::MatrixXd maxA, Eigen::VectorXd C, std::vector<bool> shared, Eigen::VectorXd phi,
- Eigen::VectorXd weight);
+ BmfSolver(Eigen::MatrixXd A, Eigen::MatrixXd maxA, Eigen::VectorXd C, std::vector<bool> shared, Eigen::VectorXd phi);
/** @brief Solve equation system to find a fair-sharing of resources */
Eigen::VectorXd solve();
Eigen::VectorXd C_; //!< C_j Capacity of each resource
std::vector<bool> C_shared_; //!< shared_j Resource j is shared or not
Eigen::VectorXd phi_; //!< phi_i bound for each player
- Eigen::VectorXd weight_; //!< weight_i for each player
std::set<std::vector<int>> allocations_; //!< set of already tested allocations, since last identified loop
AllocationGenerator gen_;
- std::vector<int> allocations_age_;
static constexpr int NO_RESOURCE = -1; //!< flag to indicate player has selected no resource
- int max_iteration_; //!< number maximum of iterations of BMF algorithm
+ int max_iteration_ = cfg_bmf_max_iteration; //!< number maximum of iterations of BMF algorithm
};
/**
* @param A Consumption matrix (OUTPUT)
* @param maxA Max subflow consumption matrix (OUTPUT)
* @param phi Bounds for variables
- * @param weight Priority/weight for variables
*/
- void get_flows_data(Eigen::Index number_cnsts, Eigen::MatrixXd& A, Eigen::MatrixXd& maxA, Eigen::VectorXd& phi,
- Eigen::VectorXd& weight);
+ void get_flows_data(Eigen::Index number_cnsts, Eigen::MatrixXd& A, Eigen::MatrixXd& maxA, Eigen::VectorXd& phi);
/**
* @brief Builds the vector C_ with resource's capacity
*
std::unordered_map<const Constraint*, int> cnst2idx_; //!< Conversely map constraint to index
};
-} // namespace lmm
-} // namespace kernel
-} // namespace simgrid
+} // namespace simgrid::kernel::lmm
#endif