X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/blobdiff_plain/7845b6502c9948b08bc33b38b0ac5293125e565e..da0f693723513d54a5e075055fef01e4feb5849f:/hpcc.tex

diff --git a/hpcc.tex b/hpcc.tex
index b2509c1..60ed377 100644
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -232,8 +232,8 @@ asynchronous iterative algorithms comes from the fact it is necessary to run the
 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
-algorithm  (number   of  splitting  with  the   multisplitting  algorithm),  the
+nodes,  inter  and  intra clusrters  bandwith  and  latency, etc.) and  of  the
+algorithm  (number   of  splittings  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
 access to  many clusters,  grids or supercomputers  with many  different network