XBT_LOG_NEW_DEFAULT_SUBCATEGORY(surf_lagrange, surf, "Logging specific to SURF (lagrange)");
-
/*
* Local prototypes to implement the lagrangian optimization with optimal step, also called dicotomi.
*/
double partial_diff_mu (double mu, void * param_var);
//computes the value of the differential of constraint param_cnst applied to lambda
double partial_diff_lambda (double lambda, void * param_cnst);
-
+//auxiliar function to compute the partial_diff
+double diff_aux(lmm_variable_t var, double x);
void lagrange_solve(lmm_system_t sys)
* Lagrange Variables.
*/
int max_iterations= 10000;
- double epsilon_min_error = 1e-4;
- double dicotomi_min_error = 1e-8;
+ double epsilon_min_error = 1e-6;
+ double dicotomi_min_error = 1e-6;
double overall_error = 1;
-
/*
* Variables to manipulate the data structure proposed to model the maxmin
* fairness. See docummentation for more details.
xbt_swag_t var_list = NULL;
lmm_variable_t var = NULL;
-
/*
* Auxiliar variables.
*/
var_list = &(sys->variable_set);
i=0;
xbt_swag_foreach(var, var_list) {
- if((var->bound > 0.0) || (var->weight <= 0.0)){
- DEBUG1("#### NOTE var(%d) is a boundless variable", i);
+ if((var->bound < 0.0) || (var->weight <= 0.0)){
+ DEBUG1("#### NOTE var(%d) is a boundless (or inactive) variable", i);
var->mu = -1.0;
} else{
var->mu = 1.0;
var->new_mu = 2.0;
}
- DEBUG2("#### var(%d)->mu : %e", i, var->mu);
- DEBUG2("#### var(%d)->weight: %e", i, var->weight);
+ DEBUG3("#### var(%d) %p ->mu : %e", i, var, var->mu);
+ DEBUG3("#### var(%d) %p ->weight: %e", i, var, var->weight);
+ DEBUG3("#### var(%d) %p ->bound: %e", i, var, var->bound);
i++;
}
if((var->bound >= 0) && (var->weight > 0) ){
var->new_mu = dicotomi(var->mu, partial_diff_mu, var, dicotomi_min_error);
if(var->new_mu < 0) var->new_mu = 0;
- }
+ DEBUG2("====> var->mu (%p) = %e", var, var->new_mu);
+ var->mu = var->new_mu;
+ }
}
/*
xbt_swag_foreach(cnst, cnst_list) {
cnst->new_lambda = dicotomi(cnst->lambda, partial_diff_lambda, cnst, dicotomi_min_error);
DEBUG2("====> cnst->lambda (%p) = %e", cnst, cnst->new_lambda);
- }
-
- /*
- * Update values of mu and lambda
- */
- //forall mu_i in mu_1, mu_2, ..., mu_n
- xbt_swag_foreach(var, var_list) {
- var->mu = var->new_mu ;
- }
-
- //forall lambda_i in lambda_1, lambda_2, ..., lambda_n
- xbt_swag_foreach(cnst, cnst_list) {
cnst->lambda = cnst->new_lambda;
}
if(var->weight <=0)
var->value = 0.0;
else {
+ //compute sigma_i + mu_i
tmp = 0;
for(i=0; i<var->cnsts_number; i++){
tmp += (var->cnsts[i].constraint)->lambda;
- if(var->bound > 0)
- tmp+=var->mu;
}
+ if(var->bound > 0)
+ tmp+=var->mu;
+ DEBUG3("\t Working on var (%p). cost = %e; Df = %e", var, tmp, var->df);
- if(tmp == 0.0)
- WARN0("CAUTION: division by 0.0");
+ //uses the partial differential inverse function
+ tmp = var->func_fpi(var, tmp);
- //computes de overall_error
- if(overall_error < fabs(var->value - 1.0/tmp)){
- overall_error = fabs(var->value - 1.0/tmp);
+ //computes de overall_error using normalized value
+ if(overall_error < (fabs(var->value - tmp)/tmp) ){
+ overall_error = (fabs(var->value - tmp)/tmp);
}
- var->value = 1.0 / tmp;
+
+ var->value = tmp;
}
- DEBUG4("======> value of var %s (%p) = %e, overall_error = %e", (char *)var->id, var, var->value, overall_error);
+ DEBUG3("======> value of var (%p) = %e, overall_error = %e", var, var->value, overall_error);
}
}
tmp += var->value;
}
- tmp = tmp - cnst->bound;
-
- if(tmp > epsilon_min_error){
- WARN4("The link %s(%p) doesn't match the KKT property, expected less than %e and got %e", (char *)cnst->id, cnst, epsilon_min_error, tmp);
+ if(tmp - cnst->bound > epsilon_min_error) {
+ WARN3("The link (%p) is over-used. Expected less than %e and got %e", cnst, cnst->bound, tmp);
+ }
+ if(!((fabs(tmp - cnst->bound)<epsilon_min_error && cnst->lambda>=epsilon_min_error) ||
+ (fabs(tmp - cnst->bound)>=epsilon_min_error && cnst->lambda<epsilon_min_error))) {
+ WARN1("The KKT condition is not verified for cnst %p...", cnst);
+ overall_error=1.0;
}
-
}
-
//verify the KKT property of each flow
xbt_swag_foreach(var, var_list){
- if(var->bound <= 0 || var->weight <= 0) continue;
- tmp = 0;
- tmp = (var->value - var->bound);
+ if(var->bound < 0 || var->weight <= 0) continue;
-
- if(tmp != 0 || var->mu != 0){
- WARN4("The flow %s(%p) doesn't match the KKT property, value expected (=0) got (lambda=%e) (sum_rho=%e)", (char *)var->id, var, var->mu, tmp);
+ INFO2("Checking KKT: sat = %e mu = %e",var->value - var->bound,var->mu);
+ if(!((fabs(var->value - var->bound)<epsilon_min_error && var->mu>=epsilon_min_error) ||
+ (fabs(var->value - var->bound)>=epsilon_min_error && var->mu<epsilon_min_error))) {
+ WARN1("The KKT condition is not verified for var %p...",var);
+ overall_error=1.0;
}
+/* tmp = 0; */
+/* tmp = (var->value - var->bound); */
+/* if(tmp != 0.0 || var->mu != 0.0){ */
+/* WARN3("The flow (%p) doesn't match the KKT property, value expected (=0) got (lambda=%e) (sum_rho=%e)", var, var->mu, tmp); */
+/* } */
}
-
if(overall_error <= epsilon_min_error){
- DEBUG1("The method converge in %d iterations.", iteration);
+ DEBUG1("The method converges in %d iterations.", iteration);
}else{
WARN1("Method reach %d iterations, which is the maxmimun number of iterations allowed.", iteration);
}
double min_diff, max_diff, middle_diff;
min = max = init;
+
+ if(init == 0){
+ min = max = 1;
+ }
+
min_diff = max_diff = middle_diff = 0.0;
overall_error = 1;
return 0.0;
}
+ DEBUG0("====> not detected positive diff in 0");
+
while(overall_error > min_error){
+
min_diff = diff(min, var_cnst);
max_diff = diff(max, var_cnst);
+ DEBUG2("DICOTOMI ===> min = %e , max = %e", min, max);
+ DEBUG2("DICOTOMI ===> diffmin = %e , diffmax = %e", min_diff, max_diff);
+
if( min_diff > 0 && max_diff > 0 ){
if(min == max){
min = min / 2.0;
}else if( min_diff < 0 && max_diff > 0 ){
middle = (max + min)/2.0;
middle_diff = diff(middle, var_cnst);
- overall_error = fabs(min - max);
+
+ if(max != 0.0 && min != 0.0){
+ overall_error = fabs(min - max)/max;
+ }
if( middle_diff < 0 ){
min = middle;
*/
double partial_diff_mu(double mu, void *param_var){
double mu_partial=0.0;
+ double sigma_mu=0.0;
lmm_variable_t var = (lmm_variable_t)param_var;
int i;
- //for each link with capacity cnsts[i] that uses flow of variable var do
+ //compute sigma_i
for(i=0; i<var->cnsts_number; i++)
- mu_partial += (var->cnsts[i].constraint)->lambda + mu;
+ sigma_mu += (var->cnsts[i].constraint)->lambda;
+
+ //compute sigma_i + mu_i
+ sigma_mu += mu;
- mu_partial = (-1.0/mu_partial) + var->bound;
+ //use auxiliar function passing (sigma_i + mu_i)
+ mu_partial = diff_aux(var, sigma_mu) ;
+
+ //add the RTT limit
+ mu_partial += var->bound;
return mu_partial;
}
*/
double partial_diff_lambda(double lambda, void *param_cnst){
- double tmp=0.0;
int i;
xbt_swag_t elem_list = NULL;
lmm_element_t elem = NULL;
lmm_variable_t var = NULL;
lmm_constraint_t cnst= (lmm_constraint_t) param_cnst;
double lambda_partial=0.0;
-
+ double sigma_i=0.0;
elem_list = &(cnst->element_set);
-
- DEBUG2("Computting diff of cnst (%p) %s", cnst, (char *)cnst->id);
+ DEBUG1("Computting diff of cnst (%p)", cnst);
xbt_swag_foreach(elem, elem_list) {
var = elem->variable;
if(var->weight<=0) continue;
- tmp = 0;
-
- DEBUG2("===> Variable (%p) %s", var, (char *)var->id);
+ //initilize de sumation variable
+ sigma_i = 0.0;
+ //compute sigma_i of variable var
for(i=0; i<var->cnsts_number; i++){
- tmp += (var->cnsts[i].constraint)->lambda;
- DEBUG1("======> lambda %e + ", (var->cnsts[i].constraint)->lambda);
+ sigma_i += (var->cnsts[i].constraint)->lambda;
}
- if(var->bound > 0)
- tmp += var->mu;
-
-
- DEBUG2("======> lambda - %e + %e ", cnst->lambda, lambda);
+ //add mu_i if this flow has a RTT constraint associated
+ if(var->bound > 0) sigma_i += var->mu;
- tmp = tmp - cnst->lambda + lambda;
+ //replace value of cnst->lambda by the value of parameter lambda
+ sigma_i = (sigma_i - cnst->lambda) + lambda;
- //avoid a disaster value of lambda
- //if(tmp==0) tmp = 10e-8;
-
- lambda_partial += (-1.0/tmp);
-
- DEBUG1("======> %e ", (-1.0/tmp));
+ //use the auxiliar function passing (\sigma_i + \mu_i)
+ lambda_partial += diff_aux(var, sigma_i);
}
lambda_partial += cnst->bound;
- DEBUG1("===> %e ", lambda_partial);
-
return lambda_partial;
}
+
+
+double diff_aux(lmm_variable_t var, double x){
+ double tmp_fp, tmp_fpi, tmp_fpip, result;
+
+ xbt_assert0(var->func_fp, "Initialize the protocol functions first create variables before.");
+
+ tmp_fp = var->func_fp(var, x);
+ tmp_fpi = var->func_fpi(var, x);
+ tmp_fpip = var->func_fpip(var, x);
+
+ result = tmp_fpip*(var->func_fp(var, tmp_fpi));
+ result = result - tmp_fpi;
+
+ result = result - (tmp_fpip * x);
+
+ return result;
+}
+
+
+
+
+
+
+
