From: ziane Date: Thu, 7 May 2015 15:37:09 +0000 (+0200) Subject: Modifs dans le summary X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/rce2015.git/commitdiff_plain/533d18cef01dbe327cc5021d722f927a4eec55ff?ds=sidebyside Modifs dans le summary --- diff --git a/paper.tex b/paper.tex index 9cfb258..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}