3 /* Copyright (c) 2007 Arnaud Legrand. All rights reserved. */
5 /* This program is free software; you can redistribute it and/or modify it
6 * under the terms of the license (GNU LGPL) which comes with this package. */
9 #include "xbt/sysdep.h"
11 #include "maxmin_private.h"
15 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(surf_maxmin);
16 #define SHOW_EXPR_G(expr) DEBUG1(#expr " = %g",expr);
17 #define SHOW_EXPR_D(expr) DEBUG1(#expr " = %d",expr);
18 #define SHOW_EXPR_P(expr) DEBUG1(#expr " = %p",expr);
20 void bottleneck_solve(lmm_system_t sys)
22 lmm_variable_t var = NULL;
23 lmm_variable_t var_to_update = NULL;
24 lmm_constraint_t cnst = NULL;
25 lmm_constraint_t useless_cnst = NULL;
26 s_lmm_constraint_t s_cnst;
27 lmm_constraint_t cnst_next = NULL;
28 lmm_element_t elem = NULL;
29 xbt_swag_t cnst_list = NULL;
30 xbt_swag_t var_list = NULL;
31 xbt_swag_t elem_list = NULL;
32 double min_usage = -1;
35 static s_xbt_swag_t cnst_to_update;
41 xbt_swag_init(&(cnst_to_update),
42 xbt_swag_offset(s_cnst, saturated_constraint_set_hookup));
44 var_list = &(sys->variable_set);
45 DEBUG1("Variable set : %d", xbt_swag_size(var_list));
46 xbt_swag_foreach(var, var_list) {
49 for (i = 0; i < var->cnsts_number; i++) {
50 if(var->cnsts[i].value==0.0) nb++;
52 if((nb==var->cnsts_number) && (var->weight>0.0))
56 cnst_list = &(sys->active_constraint_set);
57 DEBUG1("Active constraints : %d", xbt_swag_size(cnst_list));
58 xbt_swag_foreach(cnst, cnst_list) {
59 xbt_swag_insert(cnst, &(sys->saturated_constraint_set));
61 cnst_list = &(sys->saturated_constraint_set);
62 xbt_swag_foreach(cnst, cnst_list) {
63 cnst->remaining = cnst->bound;
67 DEBUG0("Fair bottleneck Initialized");
70 * Compute Usage and store the variables that reach the maximum.
73 /* if (XBT_LOG_ISENABLED(surf_maxmin, xbt_log_priority_debug)) { */
74 /* DEBUG0("Fair bottleneck done"); */
77 DEBUG1("******* Constraints to process: %d *******", xbt_swag_size(cnst_list));
79 xbt_swag_foreach_safe(cnst, cnst_next, cnst_list) {
81 double max_elem = 0.0;
82 DEBUG1("Processing cnst %p ", cnst);
83 elem_list = &(cnst->element_set);
85 xbt_swag_foreach(elem, elem_list) {
86 if (elem->variable->weight <= 0)
88 if ((elem->value > 0)) {
92 MAX(max_elem, elem->value / elem->variable->weight);
94 max_elem = elem->value / elem->variable->weight;
96 // make_elem_active(elem);
98 DEBUG2("\tmax_elem : %g with %d variables", max_elem,nb);
99 if(nb>0 && !cnst->shared)
101 cnst->usage = max_elem * nb;
102 DEBUG3("\tConstraint Usage %p : %f with %d variables", cnst, cnst->usage,nb);
104 xbt_swag_remove(cnst, cnst_list);
108 /* Saturated constraints update */
109 if (min_usage < 0 || min_usage > cnst->remaining / cnst->usage) {
110 DEBUG3("Update min_usage (%g) with cnst %p -> %g",min_usage, cnst,
111 cnst->remaining / cnst->usage);
113 min_usage = cnst->remaining / cnst->usage;
114 while ((useless_cnst = xbt_swag_extract(&(cnst_to_update)))) {
115 xbt_swag_insert_at_head(useless_cnst, cnst_list);
117 xbt_swag_remove(cnst, cnst_list);
118 xbt_swag_insert(cnst, &(cnst_to_update));
119 } else if (min_usage == cnst->remaining / cnst->usage) {
120 DEBUG2("Keep min_usage (%g) with cnst %p",min_usage, cnst);
121 xbt_swag_remove(cnst, cnst_list);
122 xbt_swag_insert(cnst, &(cnst_to_update));
124 DEBUG1("\tmin_usage: %f. No update",min_usage);
128 if (!xbt_swag_size(&cnst_to_update))
131 var_list = &(sys->variable_set);
132 var_to_update = NULL;
133 xbt_swag_foreach(var, var_list) {
134 if(!var->value && var->bound>0 &&
135 var->bound<min_usage) {
137 min_usage = var->bound;
141 DEBUG2("\tUpdating var %p (%g)",var_to_update,var_to_update->value);
142 var_to_update->value = var_to_update->bound;
144 for (i = 0; i < var_to_update->cnsts_number; i++) {
145 lmm_element_t elm = &var_to_update->cnsts[i];
146 cnst = elm->constraint;
147 DEBUG1("\t\tUpdating cnst %p",cnst);
148 double_update(&(cnst->remaining), elm->value * var_to_update->value);
149 double_update(&(cnst->usage), elm->value / var_to_update->weight);
150 // make_elem_inactive(elm);
152 while ((cnst = xbt_swag_extract(&cnst_to_update))) {
153 xbt_swag_insert(cnst, cnst_list);
158 while ((cnst_next = xbt_swag_extract(&cnst_to_update))) {
160 double remaining = cnst_next->remaining;
161 elem_list = &(cnst_next->element_set);
162 xbt_swag_foreach(elem, elem_list) {
163 if (elem->variable->weight <= 0)
165 if ((elem->value > 0))
168 if(nb>0 && !(cnst_next->shared))
171 DEBUG1("Updating for cnst %p",cnst_next);
173 xbt_swag_foreach(elem, elem_list) {
174 if (elem->value <= 0) continue;
176 var = elem->variable;
178 if (var->weight <= 0)
180 if (var->value == 0.0) {
181 DEBUG2("\tUpdating var %p (%g)",var,var->value);
182 var->value = var->weight * remaining / (nb * elem->value);
186 for (i = 0; i < var->cnsts_number; i++) {
187 lmm_element_t elm = &var->cnsts[i];
188 cnst = elm->constraint;
189 DEBUG1("\t\tUpdating cnst %p",cnst);
190 double_update(&(cnst->remaining), elm->value * var->value);
191 double_update(&(cnst->usage), elm->value / var->weight);
192 // make_elem_inactive(elm);
200 if (XBT_LOG_ISENABLED(surf_maxmin, xbt_log_priority_debug)) {
201 DEBUG0("Fair bottleneck done");