X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/rce2015.git/blobdiff_plain/f98e8137319ffebaec402d37b163f962c34a82b9..d82538505eacc4b261cdfde4170ad69f2956c048:/paper.tex?ds=sidebyside diff --git a/paper.tex b/paper.tex index 9e09b31..1b7b9eb 100644 --- a/paper.tex +++ b/paper.tex @@ -70,8 +70,8 @@ -\begin{document} \RCE{Titre a confirmer.} \title{Comparative performance -analysis of simulated grid-enabled numerical iterative algorithms} +\begin{document} +\title{Grid-enabled simulation of large-scale linear iterative solvers} %\itshape{\journalnamelc}\footnotemark[2]} \author{Charles Emile Ramamonjisoa\affil{1}, @@ -165,34 +165,30 @@ application on a given multi-core architecture. Finding good resource allocations policies under varying CPU power, network speeds and loads is very challenging and labor intensive~\cite{Calheiros:2011:CTM:1951445.1951450}. This problematic is even more difficult for the asynchronous scheme where a small -parameter variation of the execution platform can lead to very different numbers -of iterations to reach the converge and so to 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. - -\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...} - -The obtained results on different -simulated multi-core architectures confirm the real results previously obtained -on non simulated architectures. - -\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.} - -We also confirm the efficiency of the -asynchronous multisplitting algorithm compared to the synchronous GMRES. - -\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é)} - -In -this way and with a simple computing architecture (a laptop) SimGrid allows us +parameter variation of the execution platform and of the application data can +lead to very different numbers of iterations to reach the converge and so to +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 {\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. Simulated results also confirm the efficiency of the +asynchronous multisplitting algorithm compared to the synchronous GMRES +especially in case of geographically distant clusters. + +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 @@ -205,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} @@ -886,9 +880,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}