/* This file is part of the Linux Trace Toolkit viewer
- * Copyright (C) 2009 Benjamin Poirier <benjamin.poirier@polymtl.ca>
+ * Copyright (C) 2009, 2010 Benjamin Poirier <benjamin.poirier@polymtl.ca>
*
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU General Public License Version 2 as
- * published by the Free Software Foundation;
+ * This program is free software: you can redistribute it and/or modify it
+ * under the terms of the GNU Lesser General Public License as published by
+ * the Free Software Foundation, either version 2.1 of the License, or (at
+ * your option) any later version.
*
- * This program is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- * GNU General Public License for more details.
+ * This program is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
+ * License for more details.
*
- * You should have received a copy of the GNU General Public License
- * along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston,
- * MA 02111-1307, USA.
+ * You should have received a copy of the GNU Lesser General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#define _GNU_SOURCE
const unsigned int i, const unsigned int j);
// Functions specific to this module
-static void registerAnalysisEval() __attribute__((constructor (102)));
static guint ghfRttKeyHash(gconstpointer key);
static gboolean gefRttKeyEqual(gconstpointer a, gconstpointer b);
static void gdnDestroyRttKey(gpointer data);
static void updateBounds(Bounds** const bounds, Event* const e1, Event* const
e2);
+static void finalizeAnalysisEvalLP(SyncState* const syncState);
// The next group of functions is only needed when computing synchronization
// accuracy.
#ifdef HAVE_LIBGLPK
static void calculateCompleteFactors(glp_prob* const lp, FactorsCHull*
factors);
static FactorsCHull** createAllFactors(const unsigned int traceNb);
-static inline void finalizeAnalysisEvalLP(SyncState* const syncState);
-#else
-static void finalizeAnalysisEvalLP(SyncState* const syncState);
#endif
static ModuleOption optionEvalRttFile= {
.longName= "eval-rtt-file",
.hasArg= REQUIRED_ARG,
- {.arg= NULL},
.optionHelp= "specify the file containing RTT information",
.argHelp= "FILE",
};
/*
* Analysis module registering function
*/
-static void registerAnalysisEval()
+void registerAnalysisEval()
{
binBase= exp10(6. / (BIN_NB - 3));
if (syncState->stats)
{
analysisData->stats= calloc(1, sizeof(AnalysisStatsEval));
- analysisData->stats->broadcastDiffSum= 0.;
+ analysisData->stats->broadcastRangeMin= INFINITY;
+ analysisData->stats->broadcastRangeMax= -INFINITY;
analysisData->stats->messageStats= malloc(syncState->traceNb *
sizeof(MessageStats*));
*/
static void destroyAnalysisEval(SyncState* const syncState)
{
- unsigned int i, j;
+ unsigned int i;
AnalysisDataEval* analysisData;
analysisData= (AnalysisDataEval*) syncState->analysisData;
#ifdef HAVE_LIBGLPK
for (i= 0; i < syncState->traceNb; i++)
{
+ unsigned int j;
+
for (j= 0; j < i; j++)
{
// There seems to be a memory leak in glpk, valgrind reports a
- // loss even if the problem is deleted
+ // loss (reachable) even if the problem is deleted
glp_delete_prob(graphs->lps[i][j]);
}
free(graphs->lps[i]);
g_queue_get_length(broadcast->events), 2.);
if (y > 0)
{
- analysisData->stats->broadcastDiffSum+= sqrt(y);
+ analysisData->stats->broadcastStdevSum+= sqrt(y);
+ }
+
+ if (syncState->traceNb == 2 && g_queue_get_length(broadcast->events)
+ == 2)
+ {
+ Event* e0, * e1;
+ double dd;
+
+ e0= g_queue_peek_head(broadcast->events);
+ e1= g_queue_peek_tail(broadcast->events);
+ if (e0->traceNum > e1->traceNum)
+ {
+ Event* tmp;
+
+ tmp= e0;
+ e0= e1;
+ e1= tmp;
+ }
+
+ dd= wallTimeSub(&e1->wallTime, &e0->wallTime);
+
+ analysisData->stats->broadcastPairNb++;
+ if (dd < analysisData->stats->broadcastRangeMin)
+ {
+ analysisData->stats->broadcastRangeMin= dd;
+ }
+ if (dd > analysisData->stats->broadcastRangeMax)
+ {
+ analysisData->stats->broadcastRangeMax= dd;
+ }
+
+ analysisData->stats->broadcastSum+= dd;
+ analysisData->stats->broadcastSumSquares+= pow(dd, 2);
}
}
printf("Synchronization evaluation analysis stats:\n");
if (analysisData->stats->broadcastNb)
{
- printf("\tsum of broadcast differential delays: %g\n",
- analysisData->stats->broadcastDiffSum);
- printf("\taverage broadcast differential delay: %g\n",
- analysisData->stats->broadcastDiffSum /
+ printf("\tBroadcast differential delay:\n");
+ printf("\t\tsum of standard deviations: %g\n",
+ analysisData->stats->broadcastStdevSum);
+ printf("\t\taverage standard deviation: %g\n",
+ analysisData->stats->broadcastStdevSum /
analysisData->stats->broadcastNb);
+
+ if (syncState->traceNb == 2)
+ {
+ printf("\t\tdifferential delay range: [ %g .. %g ]\n",
+ analysisData->stats->broadcastRangeMin,
+ analysisData->stats->broadcastRangeMax);
+ printf("\t\tdifferential delay average: %g\n",
+ analysisData->stats->broadcastSum /
+ analysisData->stats->broadcastPairNb);
+ printf("\t\tdifferential delay standard deviation: %g\n",
+ sqrt(analysisData->stats->broadcastSumSquares /
+ analysisData->stats->broadcastPairNb -
+ pow(analysisData->stats->broadcastSum /
+ analysisData->stats->broadcastPairNb, 2)));
+ }
}
printf("\tIndividual evaluation:\n"
&analysisData->stats->messageStats[loopValues[k].t1][loopValues[k].t2];
printf("\t\t%3d - %-3d ", loopValues[k].t1, loopValues[k].t2);
- printf("%u (%u%%)%n", messageStats->inversionNb, (unsigned
- int) ceil((double) messageStats->inversionNb /
- messageStats->total * 100), &charNb);
+ printf("%u (%.2f%%)%n", messageStats->inversionNb, (double)
+ messageStats->inversionNb / messageStats->total * 100,
+ &charNb);
printf("%*s", 17 - charNb > 0 ? 17 - charNb + 1: 1, " ");
- printf("%u (%u%%)%n", messageStats->tooFastNb, (unsigned int)
- ceil((double) messageStats->tooFastNb /
- messageStats->total * 100), &charNb);
+ printf("%u (%.2f%%)%n", messageStats->tooFastNb, (double)
+ messageStats->tooFastNb / messageStats->total * 100,
+ &charNb);
printf("%*s%-10u %u\n", 17 - charNb > 0 ? 17 - charNb + 1:
1, " ", messageStats->noRTTInfoNb, messageStats->total);
}
printf("\t\t total ");
- printf("%u (%u%%)%n", totInversion, (unsigned int) ceil((double)
- totInversion / totTotal * 100), &charNb);
+ printf("%u (%.2f%%)%n", totInversion, (double) totInversion / totTotal *
+ 100, &charNb);
printf("%*s", 17 - charNb > 0 ? 17 - charNb + 1: 1, " ");
- printf("%u (%u%%)%n", totTooFast, (unsigned int) ceil((double) totTooFast
- / totTotal * 100), &charNb);
+ printf("%u (%.2f%%)%n", totTooFast, (double) totTooFast / totTotal * 100,
+ &charNb);
printf("%*s%-10u %u\n", 17 - charNb > 0 ? 17 - charNb + 1: 1, " ",
totNoInfo, totTotal);
g_hash_table_foreach(analysisData->stats->exchangeRtt,
&ghfPrintExchangeRtt, analysisData->rttInfo);
+#ifdef HAVE_LIBGLPK
printf("\tConvex hull factors comparisons:\n"
"\t\tTrace pair Factors type Differences (lp - chull)\n"
"\t\t a0 a1\n"
}
}
}
+#endif
}
// Create the LP problem
glp_term_out(GLP_OFF);
- glp_add_rows(lp, hullPointNb);
+ if (hullPointNb > 0)
+ {
+ glp_add_rows(lp, hullPointNb);
+ }
glp_add_cols(lp, 2);
glp_set_col_name(lp, 1, "a0");
* Compute synchronization factors using a linear programming approach.
* Compute the factors using analysis_chull. Compare the two.
*
- * There are two definitions of this function. The empty one is used when the
- * solver library, glpk, is not available at build time. In that case, nothing
- * is actually produced.
+ * When the solver library, glpk, is not available at build time, only compute
+ * the factors using analysis_chull. This is to make sure that module runs its
+ * finalize function so that its graph functions can be called later.
*
* Args:
* syncState: container for synchronization data
*/
-#ifndef HAVE_LIBGLPK
-static inline void finalizeAnalysisEvalLP(SyncState* const syncState)
-{
-}
-#else
static void finalizeAnalysisEvalLP(SyncState* const syncState)
{
- unsigned int i, j;
AnalysisDataEval* analysisData= syncState->analysisData;
+#ifdef HAVE_LIBGLPK
+ unsigned int i, j;
AnalysisDataCHull* chAnalysisData= analysisData->chullSS->analysisData;
- FactorsCHull** lpFactorsArray= createAllFactors(syncState->traceNb);
- FactorsCHull* lpFactors;
+ FactorsCHull** lpFactorsArray;
if (!syncState->stats && !syncState->graphsStream)
{
return;
}
+ /* Because of matching_distributor, this analysis may be called twice.
+ * Only run it once */
if ((syncState->graphsStream && analysisData->graphs->lps != NULL) ||
(syncState->stats && analysisData->stats->chFactorsArray != NULL))
{
return;
}
+ lpFactorsArray= createAllFactors(syncState->traceNb);
+
if (syncState->stats)
{
analysisData->stats->chFactorsArray=
else
{
glp_delete_prob(lp);
- destroyFactorsCHull(lpFactors);
}
}
}
+#endif
g_array_free(analysisData->chullSS->analysisModule->finalizeAnalysis(analysisData->chullSS),
TRUE);
}
-#endif
/*
{
unsigned int it2;
int directions[]= {GLP_MIN, GLP_MAX};
-
glp_set_obj_coef(lp, 1, 1.);
glp_set_obj_coef(lp, 2, xValues[it]);
- fprintf(fp, "%25.9f %25.9f", xValues[it], lpFactors->approx->offset
- + lpFactors->approx->drift * xValues[it]);
+ fprintf(fp, "%25.9f %25.9f", xValues[it],
+ lpFactors->approx->offset + lpFactors->approx->drift *
+ xValues[it]);
for (it2= 0; it2 < sizeof(directions) / sizeof(*directions); it2++)
{
int status;
projects / lttv.git / blobdiff