X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/blobdiff_plain/664f844ffe608be37e65a2061489a0c09ebb731d..ac30077e87171235d063d4565a5c594cfab44106:/hpcc.tex?ds=inline

diff --git a/hpcc.tex b/hpcc.tex
index ae3a229..cc69424 100644
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -452,6 +452,7 @@ As mentioned, upon this adaptation, the algorithm is executed as in the real lif
 global variables have been moved to local to subroutine. Indeed, global variables generate side effects arising from the concurrent access of 
 shared memory used by threads simulating each computing unit in the SimGrid architecture. 
 Second, some compilation errors on MPI\_Waitall and MPI\_Finalize primitives have been fixed with the latest version of SimGrid.
+\AG{compilation or run-time error?}
 In total, the initial MPI program running on the simulation environment SMPI gave after a very simple adaptation the same results as those obtained in a real 
 environment. We have successfully executed the code in synchronous mode using parallel GMRES algorithm compared with our multisplitting algorithm in asynchronous mode after few modifications. 
 
@@ -489,7 +490,7 @@ The algorithm was run on a two clusters based network with 50 hosts each, totali
 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
 $\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 speeder than the synchronous mode. 
+\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}
 % use the same column width for the following three tables
@@ -637,13 +638,14 @@ Note that the program was run with the following parameters:
 \paragraph*{Arguments of the program}
 
 \begin{itemize}
-	\item Description of the cluster architecture matching the format <Number of cluster> <Number of hosts in cluster\_1> <Number of hosts in cluster\_2>;
-	\item Maximum number of iterations;
-	\item Precisions on the residual error;
-	\item Matrix size $N_x$, $N_y$ and $N_z$;
-	\item Matrix diagonal value: \np{1.0} 	(See (3));
-	\item Matrix off-diagonal value: $-\frac{1}{6}$ 	(See(3));
-	\item Communication mode: Asynchronous.
+\item Description of the cluster architecture matching the format <Number of
+  cluster> <Number of hosts in cluster1> <Number of hosts in cluster2>;
+\item Maximum number of iterations;
+\item Precisions on the residual error;
+\item Matrix size $N_x$, $N_y$ and $N_z$;
+\item Matrix diagonal value: \np{1.0} (See~(\ref{eq:03}));
+\item Matrix off-diagonal value: \np{-1}/\np{6} (See~(\ref{eq:03}));
+\item Communication mode: asynchronous.
 \end{itemize}
 
 \paragraph*{Interpretations and comments}
