X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/blobdiff_plain/549b5689e29828e7d7a2ea9dc3af2da5fa46555e..85bdede0dce3662616d21678eafc402be648bb87:/hpcc.tex?ds=inline

diff --git a/hpcc.tex b/hpcc.tex
index cb85b00..aeafb67 100644
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -483,7 +483,7 @@ 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.
 A priori, obtaining a relative gain greater than 1 would be difficult in a local
-area network configuration where the synchronous mode will take advantage on the
+area network configuration where the synchronous GMRES method will take advantage on the
 rapid exchange of information on such high-speed links. Thus, the methodology
 adopted was to launch the application on a clustered network. In this
 configuration, degrading the inter-cluster network performance will penalize the
@@ -660,7 +660,7 @@ the results have given a relative gain more than 2.5, showing the effectiveness
 asynchronous multiplsitting  compared to GMRES with two distant clusters.
 
 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