X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/blobdiff_plain/8c35d2df5432dd07c403167c131d03b03c1c9d6e..79daec76a811fc9c448ca8880c7eae6889ffaa60:/hpcc.tex?ds=sidebyside

diff --git a/hpcc.tex b/hpcc.tex
index dc816e2..31a6964 100644
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -476,8 +476,7 @@ study that the results depend on the following parameters:
 \item Hosts processors power (GFlops) can also influence on the results.
 \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 (i.e. GMRES). 
+  algorithm but also to get the main objective in getting an execution time with the asynchronous multisplitting  less than with synchronous GMRES. 
   \end{itemize}
 
 The ratio between the simulated execution time of synchronous GMRES algorithm
@@ -660,7 +659,7 @@ the results have given a relative gain more than 2.5, showing the effectiveness
 asynchronous performance compared to the synchronous mode.
 
 With these settings, Table~\ref{tab.cluster.2x50} shows
-that after a deterioration of inter cluster network with a bandwidth of \np[Mbit/s]{5} and a latency in order of one hundredth of millisecond and a processor power
+that after setting the bandwidth of the  inter cluster network to  \np[Mbit/s]{5} and a latency in order of one hundredth of millisecond and a processor power
 of one GFlops, an efficiency of about \np[\%]{40} is
 obtained in asynchronous mode for a matrix size of 62 elements. It is noticed that the result remains
 stable even we vary the residual error precision from \np{E-5} to \np{E-9}. By