Merge branch 'master' of ssh://info.iut-bm.univ-fcomte.fr/hpcc2014

diff --git a/hpcc.tex b/hpcc.tex
index fd2b6ff029c88a879094f6589034c806d094a7ca..a5aeb12943dcc6f3137d74d8b9b84b1a2ece1c96 100644 (file)
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -82,8 +82,8 @@ what parameters  could influence or not  the behaviors of an  algorithm. In this
 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  in  which we  choose  some parameters.   Both  codes  are real  MPI
-codes. Simulations allow us to see when the multisplitting algorithm can be more
+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
 efficient than the GMRES one to solve a 3D Poisson problem.