X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/blobdiff_plain/a1950af3cc5343a88d03a9a7591f6e7833d51d54..7845b6502c9948b08bc33b38b0ac5293125e565e:/hpcc.tex?ds=sidebyside

diff --git a/hpcc.tex b/hpcc.tex
index bea95a4..b2509c1 100644
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -83,7 +83,7 @@ paper, we show  that it is interesting to use SimGrid  to simulate the behaviors
 of asynchronous  iterative algorithms. For that,  we compare the  behaviour of a
 synchronous  GMRES  algorithm  with  an  asynchronous  multisplitting  one  with
 simulations  which let us easily choose  some parameters.   Both  codes  are real  MPI
-codes ans simulations allow us to see when the asynchronous multisplitting algorithm can be more
+codes and simulations allow us to see when the asynchronous multisplitting algorithm can be more
 efficient than the GMRES one to solve a 3D Poisson problem.
 
 
@@ -103,7 +103,7 @@ suggests, these algorithms solve a given problem by successive iterations ($X_{n
 $X_{0}$ to find an approximate value $X^*$ of the solution with a very low residual error. Several well-known methods
 demonstrate the convergence of these algorithms~\cite{BT89,Bahi07}.
 
-Parallelization of such algorithms generally involve the division of the problem
+Parallelization of such algorithms generally involves the division of the problem
 into  several  \emph{blocks}  that  will  be  solved  in  parallel  on  multiple
 processing units. The latter will communicate each intermediate results before a
 new  iteration starts  and until  the  approximate solution  is reached.   These
@@ -228,7 +228,7 @@ In the context of asynchronous algorithms, the number of iterations to reach the
 convergence depends on  the delay of messages. With  synchronous iterations, the
 number of  iterations is exactly  the same than  in the sequential mode  (if the
 parallelization process does  not change the algorithm). So  the difficulty with
-asynchronous iteratie algorithms comes from the fact it is necessary to run the algorithm
+asynchronous iterative algorithms comes from the fact it is necessary to run the algorithm
 with real data. In fact, from an execution to another the order of messages will
 change and the  number of iterations to reach the  convergence will also change.
 According  to all  the parameters  of the  platform (number  of nodes,  power of