X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/blobdiff_plain/71e9a817e3b9fe1daf0e108ff31cdbaba31197ff..42e7f35fe290785950e094b86fd73c998719025f:/hpcc.tex?ds=inline

diff --git a/hpcc.tex b/hpcc.tex
index fdd60b2..5a03bb2 100644
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -228,11 +228,11 @@ 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
-nodes,  inter  and  intra clusrters  bandwith  and  latency,  ....) and  of  the
+nodes,  inter  and  intra clusrters  bandwith  and  latency, etc.) and  of  the
 algorithm  (number   of  splitting  with  the   multisplitting  algorithm),  the
 multisplitting code  will obtain the solution  more or less  quickly. Or course,
 the GMRES method also depends of the same parameters. As it is difficult to have