From: David Laiymani Date: Wed, 6 May 2015 15:21:33 +0000 (+0200) Subject: DL : expé X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/rce2015.git/commitdiff_plain/7c8fb94ad3ce704f81876b1dade93846a931a5a8?ds=inline;hp=-c DL : expé --- 7c8fb94ad3ce704f81876b1dade93846a931a5a8 diff --git a/paper.tex b/paper.tex index 4d0bfe2..46ecc39 100644 --- a/paper.tex +++ b/paper.tex @@ -715,7 +715,7 @@ get the highest \textit{"relative gain"} (exec\_time$_{GMRES}$ / exec\_time$_{multisplitting}$) in comparison with the classical GMRES time. -The test conditions are summarized in the table below : \\ +The test conditions are summarized in the table below: \\ \begin{figure} [ht!] \centering @@ -731,14 +731,14 @@ The test conditions are summarized in the table below : \\ \end{figure} Again, comprehensive and extensive tests have been conducted with different -parametes as the CPU power, the network parameters (bandwidth and latency) in -the simulator tool and with different problem size. The relative gains greater -than 1 between the two algorithms have been captured after each step of the -test. In Figure~\ref{table:01} are reported the best grid configurations -allowing the multisplitting method to be more than 2.5 times faster than the +parameters as the CPU power, the network parameters (bandwidth and latency) +and with different problem size. The relative gains greater than $1$ between the +two algorithms have been captured after each step of the test. In +Figure~\ref{table:01} are reported the best grid configurations allowing +the multisplitting method to be more than $2.5$ times faster than the classical GMRES. These experiments also show the relative tolerance of the multisplitting algorithm when using a low speed network as usually observed with -geographically distant clusters throuth the internet. +geographically distant clusters through the internet. % use the same column width for the following three tables \newlength{\mytablew}\settowidth{\mytablew}{\footnotesize\np{E-11}}