v3

[hpcc2014.git] / hpcc.tex

diff --git a/hpcc.tex b/hpcc.tex
index b2509c119c84cd4f4a25a59a14f7793db335008c..5a03bb293cdd65ef887504ba7897d83ac5cef7c8 100644 (file)
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -232,7 +232,7 @@ 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
 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
 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