From: couturie Date: Thu, 7 May 2015 15:24:39 +0000 (+0200) Subject: ok pour les contrib de mon point de vue X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/rce2015.git/commitdiff_plain/d82538505eacc4b261cdfde4170ad69f2956c048?ds=inline ok pour les contrib de mon point de vue --- diff --git a/paper.tex b/paper.tex index 4d7ef2b..1b7b9eb 100644 --- a/paper.tex +++ b/paper.tex @@ -171,40 +171,24 @@ very different execution times. In this challenging context we think that the use of a simulation tool can greatly leverage the possibility of testing various platform scenarios. -The main contribution of this paper is to show that the use of a simulation tool -(i.e. the SimGrid toolkit~\cite{SimGrid}) in the context of real parallel -applications (i.e. large linear system solvers) can help developers to better -tune their application for a given multi-core architecture. To show the validity -of this approach we first compare the simulated execution of the multisplitting -algorithm with the GMRES (Generalized Minimal Residual) -solver~\cite{saad86} in synchronous mode. The simulation results allow us to -determine which method to choose given a specified multi-core architecture. - -\LZK{Pas trop convainquant comme argument pour valider l'approche de simulation. \\On peut dire par exemple: on a pu simuler différents algos itératifs à large échelle (le plus connu GMRES et deux variantes de multisplitting) et la simulation nous a permis (sans avoir le vrai matériel) de déterminer quelle serait la meilleure solution pour une telle configuration de l'archi ou vice versa.\\A revoir...} -\DL{OK : ajout d'une phrase précisant tout cela} - -Moreover the obtained results on different simulated multi-core architectures -confirm the real results previously obtained on non simulated architectures. +The {\bf main contribution of this paper} is to show that the use of a +simulation tool (i.e. the SimGrid toolkit~\cite{SimGrid}) in the context of real +parallel applications (i.e. large linear system solvers) can help developers to +better tune their application for a given multi-core architecture. To show the +validity of this approach we first compare the simulated execution of the Krylov +multisplitting algorithm with the GMRES (Generalized Minimal Residual) +solver~\cite{saad86} in synchronous mode. The simulation results allow us to +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~\cite{couturier15}, which show that the synchronous -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. Simulated results also confirm the efficiency of the +asynchronous multisplitting algorithm compared to the synchronous GMRES +especially in case of geographically distant 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} - -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 +In this way and with a simple computing architecture (a laptop) SimGrid allows us to run a test campaign of a real parallel iterative applications on different simulated multi-core architectures. To our knowledge, there is no related work on the large-scale multi-core simulation of a real synchronous and @@ -217,8 +201,6 @@ Section~\ref{sec:04} details the different solvers that we use. Finally our experimental results are presented in section~\ref{sec:expe} followed by some concluding remarks and perspectives. -\LZK{Proposition d'un titre pour le papier: Grid-enabled simulation of large-scale linear iterative solvers.} - \section{The asynchronous iteration model and the motivations of our work} \label{sec:asynchro}