From: raphael couturier <couturie@extinction>
Date: Mon, 28 Apr 2014 12:27:49 +0000 (+0200)
Subject: autre modif
X-Git-Tag: hpcc2014_submission~44
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/commitdiff_plain/e3eaeb5f6e4963220fa7da4ba4afec74c5727833?ds=sidebyside;hp=--cc

autre modif
---

e3eaeb5f6e4963220fa7da4ba4afec74c5727833
diff --git a/hpcc.tex b/hpcc.tex
index edba67f..81062de 100644
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -474,8 +474,8 @@ study that the results depend on the following parameters:
 \item Finally, when submitting job batches for execution, the arguments values
   passed to the program like the maximum number of iterations or the precision are critical. They allow us to ensure not only the convergence of the
   algorithm but also to get the main objective in getting an execution time in asynchronous communication less than in
-  synchronous mode. The ratio between the execution time of synchronous
-  compared to the asynchronous mode ($t_\text{sync} / t_\text{async}$) is defined as the \emph{relative gain}. So,
+  synchronous mode. The ratio between the simulated execution time of synchronous GMRES algorithm
+  compared to the asynchronous multisplitting algorithm ($t_\text{GMRES} / t_\text{Multisplitting}$) is defined as the \emph{relative gain}. So,
   our objective running the algorithm in SimGrid is to obtain a relative gain
   greater than 1.
 \end{itemize}
@@ -489,14 +489,13 @@ synchronous mode allowing to get a relative gain greater than 1.  This action
 simulates the case of distant clusters linked with long distance network as in grid computing context.
 
 
-% As a first step, 
-The algorithm was run on a two clusters based network with 50 hosts each, totaling 100 hosts. Various combinations of the above
-factors have provided the results shown in Table~\ref{tab.cluster.2x50}. The algorithm convergence with a 3D
-matrix size ranging from $N_x = N_y = N_z = \text{62}$ to 150 elements (that is from
+
+Both codes were simulated on a two clusters based network with 50 hosts each, totaling 100 hosts. Various combinations of the above
+factors have provided the results shown in Table~\ref{tab.cluster.2x50}. The problem size of the 3D Poisson problem  ranges from $N_x = N_y = N_z = \text{62}$ to 150 elements (that is from
 $\text{62}^\text{3} = \text{\np{238328}}$ to $\text{150}^\text{3} =
-\text{\np{3375000}}$ entries), is obtained in asynchronous in average 2.5 times faster than in the synchronous mode.
-\AG{Expliquer comment lire les tableaux.}
-\CER{J'ai reformulé la phrase par la lecture du tableau. Plus de détails seront lus dans la partie Interprétations et commentaires}
+\text{\np{3375000}}$ entries). With the asynchronous multisplitting algorithm the simulated execution time is in average 2.5 times faster than with the synchronous GMRES one. 
+%\AG{Expliquer comment lire les tableaux.}
+%\CER{J'ai reformulé la phrase par la lecture du tableau. Plus de détails seront lus dans la partie Interprétations et commentaires}
 % use the same column width for the following three tables
 \newlength{\mytablew}\settowidth{\mytablew}{\footnotesize\np{E-11}}
 \newenvironment{mytable}[1]{% #1: number of columns for data