1 /* Copyright (c) 2004-2022. The SimGrid Team. All rights reserved. */
3 /* This program is free software; you can redistribute it and/or modify it
4 * under the terms of the license (GNU LGPL) which comes with this package. */
6 #ifndef SURF_MAXMIN_HPP
7 #define SURF_MAXMIN_HPP
9 #include "simgrid/kernel/resource/Action.hpp"
10 #include "simgrid/kernel/resource/Model.hpp"
11 #include "simgrid/s4u/Link.hpp"
12 #include "src/surf/surf_interface.hpp"
13 #include "xbt/asserts.h"
15 #include "xbt/mallocator.h"
17 #include <boost/intrusive/list.hpp>
27 /** @addtogroup SURF_lmm
29 * A linear maxmin solver to resolve inequations systems.
31 * Most SimGrid model rely on a "fluid/steady-state" modeling that simulate the sharing of resources between actions at
32 * relatively coarse-grain. Such sharing is generally done by solving a set of linear inequations. Let's take an
33 * example and assume we have the variables \f$x_1\f$, \f$x_2\f$, \f$x_3\f$, and \f$x_4\f$ . Let's say that \f$x_1\f$
34 * and \f$x_2\f$ correspond to activities running and the same CPU \f$A\f$ whose capacity is \f$C_A\f$. In such a
35 * case, we need to enforce:
37 * \f[ x_1 + x_2 \leq C_A \f]
39 * Likewise, if \f$x_3\f$ (resp. \f$x_4\f$) corresponds to a network flow \f$F_3\f$ (resp. \f$F_4\f$) that goes through
40 * a set of links \f$L_1\f$ and \f$L_2\f$ (resp. \f$L_2\f$ and \f$L_3\f$), then we need to enforce:
42 * \f[ x_3 \leq C_{L_1} \f]
43 * \f[ x_3 + x_4 \leq C_{L_2} \f]
44 * \f[ x_4 \leq C_{L_3} \f]
46 * One could set every variable to 0 to make sure the constraints are satisfied but this would obviously not be very
47 * realistic. A possible objective is to try to maximize the minimum of the \f$x_i\f$ . This ensures that all the
48 * \f$x_i\f$ are positive and "as large as possible".
50 * This is called *max-min fairness* and is the most commonly used objective in SimGrid. Another possibility is to
51 * maximize \f$\sum_if(x_i)\f$, where \f$f\f$ is a strictly increasing concave function.
66 * A possible system could be:
67 * - three variables: `var1`, `var2`, `var3`
68 * - two constraints: `cons1`, `cons2`
69 * - four elements linking:
70 * - `elem1` linking `var1` and `cons1`
71 * - `elem2` linking `var2` and `cons1`
72 * - `elem3` linking `var2` and `cons2`
73 * - `elem4` linking `var3` and `cons2`
75 * And the corresponding inequations will be:
77 * var1.value <= var1.bound
78 * var2.value <= var2.bound
79 * var3.value <= var3.bound
80 * var1.weight * var1.value * elem1.value + var2.weight * var2.value * elem2.value <= cons1.bound
81 * var2.weight * var2.value * elem3.value + var3.weight * var3.value * elem4.value <= cons2.bound
83 * where `var1.value`, `var2.value` and `var3.value` are the unknown values.
85 * If a constraint is not shared, the sum is replaced by a max.
86 * For example, a third non-shared constraint `cons3` and the associated elements `elem5` and `elem6` could write as:
88 * max( var1.weight * var1.value * elem5.value , var3.weight * var3.value * elem6.value ) <= cons3.bound
90 * This is useful for the sharing of resources for various models.
91 * For instance, for the network model, each link is associated to a constraint and each communication to a variable.
93 * Implementation details
95 * For implementation reasons, we are interested in distinguishing variables that actually participate to the
96 * computation of constraints, and those who are part of the equations but are stuck to zero.
97 * We call enabled variables, those which var.weight is strictly positive. Zero-weight variables are called disabled
99 * Unfortunately this concept of enabled/disabled variables intersects with active/inactive variable.
100 * Semantically, the intent is similar, but the conditions under which a variable is active is slightly more strict
101 * than the conditions for it to be enabled.
102 * A variable is active only if its var.value is non-zero (and, by construction, its var.weight is non-zero).
103 * In general, variables remain disabled after their creation, which often models an initialization phase (e.g. first
104 * packet propagating in the network). Then, it is enabled by the corresponding model. Afterwards, the max-min solver
105 * (lmm_solve()) activates it when appropriate. It is possible that the variable is again disabled, e.g. to model the
106 * pausing of an action.
108 * Concurrency limit and maximum
110 * We call concurrency, the number of variables that can be enabled at any time for each constraint.
111 * From a model perspective, this "concurrency" often represents the number of actions that actually compete for one
113 * The LMM solver is able to limit the concurrency for each constraint, and to monitor its maximum value.
115 * One may want to limit the concurrency of constraints for essentially three reasons:
116 * - Keep LMM system in a size that can be solved (it does not react very well with tens of thousands of variables per
118 * - Stay within parameters where the fluid model is accurate enough.
119 * - Model serialization effects
121 * The concurrency limit can also be set to a negative value to disable concurrency limit. This can improve performance
124 * Overall, each constraint contains three fields related to concurrency:
125 * - concurrency_limit which is the limit enforced by the solver
126 * - concurrency_current which is the current concurrency
127 * - concurrency_maximum which is the observed maximum concurrency
129 * Variables also have one field related to concurrency: concurrency_share.
130 * In effect, in some cases, one variable is involved multiple times (i.e. two elements) in a constraint.
131 * For example, cross-traffic is modeled using 2 elements per constraint.
132 * concurrency_share formally corresponds to the maximum number of elements that associate the variable and any given
136 /** @{ @ingroup SURF_lmm */
140 * Elements can be seen as glue between constraint objects and variable objects.
141 * Basically, each variable will have a set of elements, one for each constraint where it is involved.
142 * Then, it is used to list all variables involved in constraint through constraint's xxx_element_set lists, or
143 * vice-versa list all constraints for a given variable.
145 class XBT_PUBLIC Element {
147 // Use rule-of-three, and implicitely disable the move constructor which should be 'noexcept' according to C++ Core
150 Element(const Element&) = default;
151 ~Element() = default;
153 int get_concurrency() const;
154 void decrease_concurrency();
155 void increase_concurrency();
158 void make_inactive();
160 /* hookup to constraint */
161 boost::intrusive::list_member_hook<> enabled_element_set_hook;
162 boost::intrusive::list_member_hook<> disabled_element_set_hook;
163 boost::intrusive::list_member_hook<> active_element_set_hook;
165 Constraint* constraint;
168 // consumption_weight: impact of 1 byte or flop of your application onto the resource (in byte or flop)
169 // - if CPU, then probably 1.
170 // - If network, then 1 in forward direction and 0.05 backward for the ACKs
171 double consumption_weight;
172 // maximum consumption weight (can be different from consumption_weight with subflows/ptasks)
173 double max_consumption_weight = 0;
176 class ConstraintLight {
178 double remaining_over_usage;
183 * @brief LMM constraint
184 * Each constraint contains several partially overlapping logical sets of elements:
185 * \li Disabled elements which variable's weight is zero. This variables are not at all processed by LMM, but eventually
186 * the corresponding action will enable it (at least this is the idea).
187 * \li Enabled elements which variable's weight is non-zero. They are utilized in some LMM functions.
188 * \li Active elements which variable's weight is non-zero (i.e. it is enabled) AND its element value is non-zero.
189 * LMM_solve iterates over active elements during resolution, dynamically making them active or inactive.
191 class XBT_PUBLIC Constraint {
193 enum class SharingPolicy { NONLINEAR = 2, SHARED = 1, FATPIPE = 0 };
195 Constraint() = delete;
196 Constraint(resource::Resource* id_value, double bound_value);
198 /** @brief Unshare a constraint. */
199 void unshare() { sharing_policy_ = SharingPolicy::FATPIPE; }
201 /** @brief Set how a constraint is shared */
202 void set_sharing_policy(SharingPolicy policy, const s4u::NonLinearResourceCb& cb);
203 /** @brief Check how a constraint is shared */
204 SharingPolicy get_sharing_policy() const { return sharing_policy_; }
206 /** @brief Get the usage of the constraint after the last lmm solve */
207 double get_usage() const;
208 int get_variable_amount() const;
210 /** @brief Sets the concurrency limit for this constraint */
211 void set_concurrency_limit(int limit)
213 xbt_assert(limit < 0 || concurrency_maximum_ <= limit,
214 "New concurrency limit should be larger than observed concurrency maximum. Maybe you want to call"
215 " concurrency_maximum_reset() to reset the maximum?");
216 concurrency_limit_ = limit;
219 /** @brief Gets the concurrency limit for this constraint */
220 int get_concurrency_limit() const { return concurrency_limit_; }
223 * @brief Reset the concurrency maximum for a given variable (we will update the maximum to reflect constraint
226 void reset_concurrency_maximum() { concurrency_maximum_ = 0; }
228 /** @brief Get the concurrency maximum for a given constraint (which reflects constraint evolution). */
229 int get_concurrency_maximum() const
231 xbt_assert(concurrency_limit_ < 0 || concurrency_maximum_ <= concurrency_limit_,
232 "Very bad: maximum observed concurrency is higher than limit. This is a bug of SURF, please report it.");
233 return concurrency_maximum_;
236 int get_concurrency_slack() const
238 return concurrency_limit_ < 0 ? std::numeric_limits<int>::max() : concurrency_limit_ - concurrency_current_;
242 * @brief Get a var associated to a constraint
243 * @details Get the first variable of the next variable of elem if elem is not NULL
244 * @param elem A element of constraint of the constraint or NULL
245 * @return A variable associated to a constraint
247 Variable* get_variable(const Element** elem) const;
250 * @brief Get a var associated to a constraint
251 * @details Get the first variable of the next variable of elem if elem is not NULL
252 * @param elem A element of constraint of the constraint or NULL
253 * @param nextelem A element of constraint of the constraint or NULL, the one after elem
254 * @param numelem parameter representing the number of elements to go
255 * @return A variable associated to a constraint
257 Variable* get_variable_safe(const Element** elem, const Element** nextelem, size_t* numelem) const;
260 * @brief Get the data associated to a constraint
261 * @return The data associated to the constraint
263 resource::Resource* get_id() const { return id_; }
265 /* hookup to system */
266 boost::intrusive::list_member_hook<> constraint_set_hook_;
267 boost::intrusive::list_member_hook<> active_constraint_set_hook_;
268 boost::intrusive::list_member_hook<> modified_constraint_set_hook_;
269 boost::intrusive::list_member_hook<> saturated_constraint_set_hook_;
270 boost::intrusive::list<Element, boost::intrusive::member_hook<Element, boost::intrusive::list_member_hook<>,
271 &Element::enabled_element_set_hook>>
272 enabled_element_set_;
273 boost::intrusive::list<Element, boost::intrusive::member_hook<Element, boost::intrusive::list_member_hook<>,
274 &Element::disabled_element_set_hook>>
275 disabled_element_set_;
276 boost::intrusive::list<Element, boost::intrusive::member_hook<Element, boost::intrusive::list_member_hook<>,
277 &Element::active_element_set_hook>>
279 double remaining_ = 0.0;
282 double dynamic_bound_ = 0.0; //!< dynamic bound for this constraint, defined by user's callback
283 // TODO MARTIN Check maximum value across resources at the end of simulation and give a warning is more than e.g. 500
284 int concurrency_current_ = 0; /* The current concurrency */
285 int concurrency_maximum_ = 0; /* The maximum number of (enabled and disabled) variables associated to the constraint
286 * at any given time (essentially for tracing)*/
288 SharingPolicy sharing_policy_ = SharingPolicy::SHARED;
289 int rank_; // Only used in debug messages to identify the constraint
290 double lambda_ = 0.0;
291 double new_lambda_ = 0.0;
292 ConstraintLight* cnst_light_ = nullptr;
293 s4u::NonLinearResourceCb dyn_constraint_cb_;
296 static int next_rank_; // To give a separate rank_ to each constraint
297 int concurrency_limit_ = sg_concurrency_limit; /* The maximum number of variables that may be enabled at any time
298 * (stage variables if necessary) */
299 resource::Resource* id_;
303 * @brief LMM variable
305 * When something prevents us from enabling a variable, we "stage" the weight that we would have like to set, so that as
306 * soon as possible we enable the variable with desired weight
308 class XBT_PUBLIC Variable {
310 void initialize(resource::Action* id_value, double sharing_penalty, double bound_value, size_t number_of_constraints,
311 unsigned visited_value);
313 /** @brief Get the value of the variable after the last lmm solve */
314 double get_value() const { return value_; }
316 /** @brief Get the maximum value of the variable (-1.0 if no specified maximum) */
317 double get_bound() const { return bound_; }
320 * @brief Set the concurrent share of the variable
321 * @param value The new concurrency share
323 void set_concurrency_share(short int value) { concurrency_share_ = value; }
326 * @brief Get the numth constraint associated to the variable
327 * @param num The rank of constraint we want to get
328 * @return The numth constraint
330 Constraint* get_constraint(unsigned num) const { return num < cnsts_.size() ? cnsts_[num].constraint : nullptr; }
333 * @brief Get the weight of the numth constraint associated to the variable
334 * @param num The rank of constraint we want to get
335 * @return The numth constraint
337 double get_constraint_weight(unsigned num) const
339 return num < cnsts_.size() ? cnsts_[num].consumption_weight : 0.0;
342 /** @brief Get the number of constraint associated to a variable */
343 size_t get_number_of_constraint() const { return cnsts_.size(); }
345 /** @brief Get the data associated to a variable */
346 resource::Action* get_id() const { return id_; }
348 /** @brief Get the penalty of a variable */
349 double get_penalty() const { return sharing_penalty_; }
351 /** @brief Measure the minimum concurrency slack across all constraints where the given var is involved */
352 int get_min_concurrency_slack() const;
354 /** @brief Check if a variable can be enabled
355 * Make sure to set staged_penalty before, if your intent is only to check concurrency
357 bool can_enable() const { return staged_penalty_ > 0 && get_min_concurrency_slack() >= concurrency_share_; }
359 /* hookup to system */
360 boost::intrusive::list_member_hook<> variable_set_hook_;
361 boost::intrusive::list_member_hook<> saturated_variable_set_hook_;
363 std::vector<Element> cnsts_;
365 // sharing_penalty: variable's impact on the resource during the sharing
366 // if == 0, the variable is not considered by LMM
367 // on CPU, actions with N threads have a sharing of N
368 // on network, the actions with higher latency have a lesser sharing_penalty
369 double sharing_penalty_;
371 double staged_penalty_; /* If non-zero, variable is staged for addition as soon as maxconcurrency constraints will be
375 short int concurrency_share_; /* The maximum number of elements that variable will add to a constraint */
376 resource::Action* id_;
377 int rank_; // Only used in debug messages to identify the variable
378 unsigned visited_; /* used by System::update_modified_set() */
382 static int next_rank_; // To give a separate rank_ to each variable
385 inline void Element::make_active()
387 constraint->active_element_set_.push_front(*this);
389 inline void Element::make_inactive()
391 if (active_element_set_hook.is_linked())
392 xbt::intrusive_erase(constraint->active_element_set_, *this);
398 class XBT_PUBLIC System {
401 * @brief Create a new Linear MaxMim system
402 * @param selective_update whether we should do lazy updates
404 explicit System(bool selective_update);
405 /** @brief Free an existing Linear MaxMin system */
409 * @brief Create a new Linear MaxMin constraint
410 * @param id Data associated to the constraint (e.g.: a network link)
411 * @param bound_value The bound value of the constraint
413 Constraint* constraint_new(resource::Resource* id, double bound_value);
416 * @brief Create a new Linear MaxMin variable
417 * @param id Data associated to the variable (e.g.: a network communication)
418 * @param sharing_penalty The weight of the variable (0.0 if not used)
419 * @param bound The maximum value of the variable (-1.0 if no maximum value)
420 * @param number_of_constraints The maximum number of constraints to associate to the variable
422 Variable* variable_new(resource::Action* id, double sharing_penalty, double bound = -1.0,
423 size_t number_of_constraints = 1);
426 * @brief Free a variable
427 * @param var The variable to free
429 void variable_free(Variable * var);
431 /** @brief Free all variables */
432 void variable_free_all();
435 * @brief Associate a variable to a constraint with a coefficient
436 * @param cnst A constraint
437 * @param var A variable
438 * @param value The coefficient associated to the variable in the constraint
440 void expand(Constraint * cnst, Variable * var, double value);
443 * @brief Add value to the coefficient between a constraint and a variable or create one
444 * @param cnst A constraint
445 * @param var A variable
446 * @param value The value to add to the coefficient associated to the variable in the constraint
448 void expand_add(Constraint * cnst, Variable * var, double value);
450 /** @brief Update the bound of a variable */
451 void update_variable_bound(Variable * var, double bound);
453 /** @brief Update the sharing penalty of a variable */
454 void update_variable_penalty(Variable* var, double penalty);
456 /** @brief Update a constraint bound */
457 void update_constraint_bound(Constraint * cnst, double bound);
459 int constraint_used(const Constraint* cnst) const { return cnst->active_constraint_set_hook_.is_linked(); }
461 /** @brief Print the lmm system */
464 /** @brief Solve the lmm system */
467 /** @brief Solve the lmm system. May be specialized in subclasses. */
468 virtual void solve() { lmm_solve(); }
471 static void* variable_mallocator_new_f();
472 static void variable_mallocator_free_f(void* var);
474 void var_free(Variable * var);
475 void cnst_free(Constraint * cnst);
476 Variable* extract_variable()
478 if (variable_set.empty())
480 Variable* res = &variable_set.front();
481 variable_set.pop_front();
484 Constraint* extract_constraint()
486 if (constraint_set.empty())
488 Constraint* res = &constraint_set.front();
489 constraint_set.pop_front();
492 void insert_constraint(Constraint * cnst) { constraint_set.push_back(*cnst); }
493 void remove_variable(Variable * var)
495 if (var->variable_set_hook_.is_linked())
496 xbt::intrusive_erase(variable_set, *var);
497 if (var->saturated_variable_set_hook_.is_linked())
498 xbt::intrusive_erase(saturated_variable_set, *var);
500 void make_constraint_active(Constraint * cnst)
502 if (not cnst->active_constraint_set_hook_.is_linked())
503 active_constraint_set.push_back(*cnst);
505 void make_constraint_inactive(Constraint * cnst)
507 if (cnst->active_constraint_set_hook_.is_linked())
508 xbt::intrusive_erase(active_constraint_set, *cnst);
509 if (cnst->modified_constraint_set_hook_.is_linked())
510 xbt::intrusive_erase(modified_constraint_set, *cnst);
513 void enable_var(Variable * var);
514 void disable_var(Variable * var);
515 void on_disabled_var(Constraint * cnstr);
518 * @brief Update the value of element linking the constraint and the variable
519 * @param cnst A constraint
520 * @param var A variable
521 * @param value The new value
523 void update(Constraint * cnst, Variable * var, double value);
525 void update_modified_set(Constraint* cnst);
526 void update_modified_set_rec(const Constraint* cnst);
528 /** @brief Remove all constraints of the modified_constraint_set. */
529 void remove_all_modified_set();
530 void check_concurrency() const;
532 template <class CnstList> void lmm_solve(CnstList& cnst_list);
535 bool modified_ = false;
536 boost::intrusive::list<Variable, boost::intrusive::member_hook<Variable, boost::intrusive::list_member_hook<>,
537 &Variable::variable_set_hook_>>
539 boost::intrusive::list<Constraint, boost::intrusive::member_hook<Constraint, boost::intrusive::list_member_hook<>,
540 &Constraint::active_constraint_set_hook_>>
541 active_constraint_set;
542 boost::intrusive::list<Variable, boost::intrusive::member_hook<Variable, boost::intrusive::list_member_hook<>,
543 &Variable::saturated_variable_set_hook_>>
544 saturated_variable_set;
545 boost::intrusive::list<Constraint, boost::intrusive::member_hook<Constraint, boost::intrusive::list_member_hook<>,
546 &Constraint::saturated_constraint_set_hook_>>
547 saturated_constraint_set;
549 std::unique_ptr<resource::Action::ModifiedSet> modified_set_ = nullptr;
552 bool selective_update_active; /* flag to update partially the system only selecting changed portions */
553 boost::intrusive::list<Constraint, boost::intrusive::member_hook<Constraint, boost::intrusive::list_member_hook<>,
554 &Constraint::modified_constraint_set_hook_>>
555 modified_constraint_set;
558 using dyn_light_t = std::vector<int>;
560 //Data used in lmm::solve
561 std::vector<ConstraintLight> cnst_light_vec;
562 dyn_light_t saturated_constraints;
564 unsigned visited_counter_ = 1; /* used by System::update_modified_set() and System::remove_all_modified_set() to
565 * cleverly (un-)flag the constraints (more details in these functions) */
566 boost::intrusive::list<Constraint, boost::intrusive::member_hook<Constraint, boost::intrusive::list_member_hook<>,
567 &Constraint::constraint_set_hook_>>
569 xbt_mallocator_t variable_mallocator_ =
570 xbt_mallocator_new(65536, System::variable_mallocator_new_f, System::variable_mallocator_free_f, nullptr);
573 class XBT_PUBLIC FairBottleneck : public System {
575 using System::System;
576 void solve() final { bottleneck_solve(); }
579 void bottleneck_solve();
584 } // namespace kernel
585 } // namespace simgrid