X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/rce2015.git/blobdiff_plain/1c9222109c2b98b9a8efaf2752f1bb4806f93ddf..533d18cef01dbe327cc5021d722f927a4eec55ff:/paper.tex?ds=sidebyside

diff --git a/paper.tex b/paper.tex
index a21da9a..9bd9b8b 100644
--- a/paper.tex
+++ b/paper.tex
@@ -94,7 +94,7 @@ analysis of simulated grid-enabled numerical iterative algorithms}
   Email:~\email{l.zianekhodja@ulg.ac.be}
 }
 
-\begin{abstract}   The behavior of multi-core applications is always a challenge
+\begin{abstract} The behavior of multi-core applications is always a challenge
 to predict, especially with a new architecture for which no experiment has been
 performed. With some applications, it is difficult, if not impossible, to build
 accurate performance models. That is why another solution is to use a simulation
@@ -102,19 +102,23 @@ tool which allows us to change many parameters of the architecture (network
 bandwidth, latency, number of processors) and to simulate the execution of such
 applications. The main contribution of this paper is to show that the use of a
 simulation tool (here we have decided to use the SimGrid toolkit) can really
-help developpers to better tune their applications for a given multi-core
+help developers to better tune their applications for a given multi-core
 architecture.
 
-In particular we focus our attention on two parallel iterative algorithms based
-on the  Multisplitting algorithm  and we  compare them  to the  GMRES algorithm.
-These algorithms  are used to  solve linear  systems. Two different  variants of
-the Multisplitting are studied: one  using synchronoous  iterations and  another
-one  with asynchronous iterations. For each algorithm we have simulated
+%In particular we focus our attention on two parallel iterative algorithms based
+%on the  Multisplitting algorithm  and we  compare them  to the  GMRES algorithm.
+%These algorithms  are used to  solve linear  systems. Two different  variants of
+%the Multisplitting are studied: one  using synchronoous  iterations and  another
+%one  with asynchronous iterations.
+In this paper we focus our attention on the simulation of iterative algorithms to solve sparse linear systems on large clusters. We study the behavior of the widely used GMRES algorithm and two different variants of the Multisplitting algorithms: one using synchronous iterations and another one with asynchronous iterations.  
+For each algorithm we have simulated
 different architecture parameters to evaluate their influence on the overall
-execution time.  The obtain simulated results confirm the real results
-previously obtained on different real multi-core architectures and also confirm
-the efficiency of the asynchronous multisplitting algorithm compared to the
-synchronous GMRES method.
+execution time. 
+%The obtain simulated results confirm the real results
+%previously obtained on different real multi-core architectures and also confirm
+%the efficiency of the asynchronous Multisplitting algorithm compared to the
+%synchronous GMRES method.
+The simulations confirm the real results previously obtained on different real multi-core architectures and also confirm the efficiency of the asynchronous Multisplitting algorithm on distant clusters compared to the synchronous GMRES algorithm.
 
 \end{abstract}
 
@@ -186,16 +190,22 @@ determine which method to choose given a specified multi-core architecture.
 Moreover the obtained results on different simulated multi-core architectures
 confirm the real results previously obtained on non simulated architectures.
 More precisely the simulated results are in accordance (i.e. with the same order
-of magnitude) with the works presented in [], which show that the multisplitting
-method is more efficient than GMRES for large scale clusters.
+of magnitude) with the works presented in~\cite{couturier15}, which show that the synchronous
+multisplitting method is more efficient than GMRES for large scale clusters.
 
-\LZK{Il n y a pas dans la partie expÃ© cette comparaison et confirmation des rÃ©sultats entre la simulation et l'exÃ©cution rÃ©elle des algos sur les vrais clusters.\\ Sinon on pourrait ajouter dans la partie expÃ© une rÃ©fÃ©rence vers le journal supercomput de krylov multi pour confirmer que cette mÃ©thode est meilleure que GMRES sur les clusters large Ã©chelle.}
-\DL{OK ajout d'une phrase. Par contre je n'ai pas la ref. Merci de la mettre}
+\LZK{Il n y a pas dans la partie expÃ© cette comparaison et confirmation des
+rÃ©sultats entre la simulation et l'exÃ©cution rÃ©elle des algos sur les vrais
+clusters.\\ Sinon on pourrait ajouter dans la partie expÃ© une rÃ©fÃ©rence vers le
+journal supercomput de krylov multi pour confirmer que cette mÃ©thode est
+meilleure que GMRES sur les clusters large Ã©chelle.} \DL{OK ajout d'une phrase.
+Par contre je n'ai pas la ref. Merci de la mettre}
 
-We also confirm  the efficiency  of the
-asynchronous  multisplitting algorithm compared to the synchronous  GMRES.
+Simulated results  also confirm  the efficiency  of the asynchronous
+multisplitting algorithm compared to the synchronous GMRES especially in case of
+geographically distant clusters.
 
 \LZK{P.S.: Pour tout le papier, le principal objectif n'est pas de faire des comparaisons entre des mÃ©thodes itÃ©ratives!!\\Sinon, les deux algorithmes Krylov multisplitting synchrone et multisplitting asynchrone sont plus efficaces que GMRES sur des clusters Ã  large Ã©chelle.\\Et prÃ©ciser, si c'est vraiment le cas, que le multisplitting asynchrone est plus efficace et adaptÃ© aux clusters distants par rapport aux deux autres algos (je n'ai pas encore lu la partie expÃ©)}
+\DL{Tu as raison on s'est posÃ© la question de garder ou non cette partie des rÃ©sultats. On a dÃ©cidÃ© de la garder pour avoir plus de chose Ã  montrer. J'ai essayer de clarifier un peu}
 
 In
 this way and with a simple computing architecture (a laptop) SimGrid allows us
@@ -892,9 +902,7 @@ This work is partially funded by the Labex ACTION program (contract ANR-11-LABX-
 
 \bibliographystyle{wileyj}
 \bibliography{biblio}
-\AG{Warning bibtex Ã  corriger (%
-  \texttt{empty booktitle in Bru95}%
-).}
+
 
 \end{document}
 
