1 /* Copyright (c) 2007-2019. 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 #include "src/kernel/lmm/maxmin.hpp"
7 #include "src/surf/surf_interface.hpp"
8 #include "xbt/sysdep.h"
14 #include <xbt/utility.hpp>
16 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(surf_maxmin);
18 simgrid::kernel::lmm::System* simgrid::kernel::lmm::make_new_fair_bottleneck_system(bool selective_update)
20 return new simgrid::kernel::lmm::FairBottleneck(selective_update);
23 void simgrid::kernel::lmm::FairBottleneck::bottleneck_solve()
28 XBT_DEBUG("Variable set : %zu", variable_set.size());
29 for (Variable& var : variable_set) {
31 XBT_DEBUG("Handling variable %p", &var);
32 if (var.sharing_penalty_ > 0.0 && std::find_if(begin(var.cnsts_), end(var.cnsts_), [](Element const& x) {
33 return x.consumption_weight != 0.0;
34 }) != end(var.cnsts_)) {
35 saturated_variable_set.push_back(var);
37 XBT_DEBUG("Err, finally, there is no need to take care of variable %p", &var);
38 if (var.sharing_penalty_ > 0.0)
43 XBT_DEBUG("Active constraints : %zu", active_constraint_set.size());
44 for (Constraint& cnst : active_constraint_set) {
45 saturated_constraint_set.push_back(cnst);
47 for (Constraint& cnst : saturated_constraint_set) {
48 cnst.remaining_ = cnst.bound_;
52 XBT_DEBUG("Fair bottleneck Initialized");
55 * Compute Usage and store the variables that reach the maximum.
57 auto& var_list = saturated_variable_set;
58 auto& cnst_list = saturated_constraint_set;
60 if (XBT_LOG_ISENABLED(surf_maxmin, xbt_log_priority_debug)) {
61 XBT_DEBUG("Fair bottleneck done");
64 XBT_DEBUG("******* Constraints to process: %zu *******", cnst_list.size());
65 for (auto iter = std::begin(cnst_list); iter != std::end(cnst_list);) {
66 Constraint& cnst = *iter;
68 XBT_DEBUG("Processing cnst %p ", &cnst);
70 for (Element& elem : cnst.enabled_element_set_) {
71 xbt_assert(elem.variable->sharing_penalty_ > 0);
72 if (elem.consumption_weight > 0 && elem.variable->saturated_variable_set_hook_.is_linked())
75 XBT_DEBUG("\tThere are %d variables", nb);
76 if (nb > 0 && cnst.sharing_policy_ == s4u::Link::SharingPolicy::FATPIPE)
79 cnst.remaining_ = 0.0;
81 iter = cnst_list.erase(iter);
83 cnst.usage_ = cnst.remaining_ / nb;
84 XBT_DEBUG("\tConstraint Usage %p : %f with %d variables", &cnst, cnst.usage_, nb);
89 for (auto iter = std::begin(var_list); iter != std::end(var_list);) {
90 Variable& var = *iter;
91 double min_inc = DBL_MAX;
92 for (Element const& elm : var.cnsts_) {
93 if (elm.consumption_weight > 0)
94 min_inc = std::min(min_inc, elm.constraint->usage_ / elm.consumption_weight);
97 min_inc = std::min(min_inc, var.bound_ - var.value_);
99 XBT_DEBUG("Updating variable %p maximum increment: %g", &var, var.mu_);
100 var.value_ += var.mu_;
101 if (var.value_ == var.bound_)
102 iter = var_list.erase(iter);
107 for (auto iter = std::begin(cnst_list); iter != std::end(cnst_list);) {
108 Constraint& cnst = *iter;
109 XBT_DEBUG("Updating cnst %p ", &cnst);
110 if (cnst.sharing_policy_ != s4u::Link::SharingPolicy::FATPIPE) {
111 for (Element& elem : cnst.enabled_element_set_) {
112 xbt_assert(elem.variable->sharing_penalty_ > 0);
113 XBT_DEBUG("\tUpdate constraint %p (%g) with variable %p by %g", &cnst, cnst.remaining_, elem.variable,
115 double_update(&cnst.remaining_, elem.consumption_weight * elem.variable->mu_, sg_maxmin_precision);
118 for (Element& elem : cnst.enabled_element_set_) {
119 xbt_assert(elem.variable->sharing_penalty_ > 0);
120 XBT_DEBUG("\tNon-Shared variable. Update constraint usage of %p (%g) with variable %p by %g", &cnst,
121 cnst.usage_, elem.variable, elem.variable->mu_);
122 cnst.usage_ = std::min(cnst.usage_, elem.consumption_weight * elem.variable->mu_);
124 XBT_DEBUG("\tUpdate constraint %p (%g) by %g", &cnst, cnst.remaining_, cnst.usage_);
125 double_update(&cnst.remaining_, cnst.usage_, sg_maxmin_precision);
128 XBT_DEBUG("\tRemaining for %p : %g", &cnst, cnst.remaining_);
129 if (cnst.remaining_ <= 0.0) {
130 XBT_DEBUG("\tGet rid of constraint %p", &cnst);
132 iter = cnst_list.erase(iter);
133 for (Element& elem : cnst.enabled_element_set_) {
134 if (elem.variable->sharing_penalty_ <= 0)
136 if (elem.consumption_weight > 0 && elem.variable->saturated_variable_set_hook_.is_linked()) {
137 XBT_DEBUG("\t\tGet rid of variable %p", elem.variable);
138 simgrid::xbt::intrusive_erase(var_list, *elem.variable);
145 } while (not var_list.empty());
149 if (XBT_LOG_ISENABLED(surf_maxmin, xbt_log_priority_debug)) {
150 XBT_DEBUG("Fair bottleneck done");