From 5432212c4bb6f191fc44cb3d0e4b1e66aa3dd9e8 Mon Sep 17 00:00:00 2001 From: Arnaud Giersch Date: Mon, 18 Mar 2013 23:09:23 +0100 Subject: [PATCH] Describe the graphs. --- loba-besteffort/loba-besteffort.tex | 15 ++++++++------- 1 file changed, 8 insertions(+), 7 deletions(-) diff --git a/loba-besteffort/loba-besteffort.tex b/loba-besteffort/loba-besteffort.tex index d774cce..44a6853 100644 --- a/loba-besteffort/loba-besteffort.tex +++ b/loba-besteffort/loba-besteffort.tex @@ -603,6 +603,7 @@ Anyway, all these the experiments represent more than 240 hours of computing time. \subsubsection{Metrics} +\label{sec.metrics} In order to evaluate and compare the different load balancing strategies we had to define several metrics. Our goal, when choosing these metrics, was to have @@ -708,13 +709,13 @@ On each of the figures~\ref{fig.results1} and~\ref{fig.resultsN}, the results are given for the process topology being, from top to bottom, a line, a torus or an hypercube. -\FIXME{explain how to read the graphs} - -each bar -> times for an algorithm -recall the different times -no bar -> not run or did not converge in allocated time - -repeated for the different platform sizes. +Finally, on the graphs, the vertical bars show the measured times for each of +the algorithms. These measured times are, from bottom to top, the average idle +time, the average convergence date, and the maximum convergence date (see +Section~\ref{sec.metrics}). The measurements are repeated for the different +platform sizes. Some bars are missing, specially for large platforms. This is +either because the algorithm did not reach the convergence state in the +allocated time, or because we simply decided not to run it. \FIXME{donner les premières conclusions, annoncer le plan de la suite} -- 2.39.5