From: laiymani Date: Mon, 28 Apr 2014 13:03:02 +0000 (+0200) Subject: corrections X-Git-Tag: hpcc2014_submission~40 X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/commitdiff_plain/b0ee8b83448638cdcf35adfbbc1e6186b8ae7acf?ds=inline corrections --- diff --git a/hpcc.tex b/hpcc.tex index 318a85e..530ddb7 100644 --- a/hpcc.tex +++ b/hpcc.tex @@ -477,12 +477,12 @@ study that the results depend on the following parameters: \item Finally, when submitting job batches for execution, the arguments values passed to the program like the maximum number of iterations or the precision are critical. They allow us to ensure not only the convergence of the algorithm but also to get the main objective in getting an execution time in asynchronous communication less than in - synchronous mode. The ratio between the simulated execution time of synchronous GMRES algorithm - compared to the asynchronous multisplitting algorithm ($t_\text{GMRES} / t_\text{Multisplitting}$) is defined as the \emph{relative gain}. So, - our objective running the algorithm in SimGrid is to obtain a relative gain - greater than 1. -\end{itemize} + synchronous mode (i.e. GMRES). + \end{itemize} +The ratio between the simulated execution time of synchronous GMRES algorithm +compared to the asynchronous multisplitting algorithm ($t_\text{GMRES} / t_\text{Multisplitting}$) is defined as the \emph{relative gain}. So, +our objective running the algorithm in SimGrid is to obtain a relative gain greater than 1. A priori, obtaining a relative gain greater than 1 would be difficult in a local area network configuration where the synchronous mode will take advantage on the rapid exchange of information on such high-speed links. Thus, the methodology