X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/blobdiff_plain/5594049b118b846213874268dd23ac82b6a0adf8..0b32536ffe4215388e35f29db79f6966d02db7d7:/hpcc.tex?ds=sidebyside

diff --git a/hpcc.tex b/hpcc.tex
index 8f0549f..1e90946 100644
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -10,7 +10,7 @@
 \usepackage{graphicx}
 \usepackage[american]{babel}
 % Extension pour les liens intra-documents (tagged PDF)
-% et l'affichage correct des URL (commande \url{http://example.com})
+% et l'affichage correct des UR (commande \url{http://example.com})
 %\usepackage{hyperref}
 
 \usepackage{url}
@@ -420,7 +420,7 @@ condition is satisfied
 \end{equation*}
 where $\MI$ is the maximum number of outer iterations and $\epsilon$ is the
 tolerance threshold of the error computed between two successive local solution
-$X_\ell^k$ and $X_\ell^{k+1}$.
+$X_\ell^k$ and $X_\ell^{k+1}$. It should be noted that with asynchronous iterative algorithms, we cannot use a classical norm (which would require to synchronize all processors), such as $\|X_\ell^k - X_\ell^{k+1}\|_{2}$ for example. Nevertheless, in our experiments, we check that the final result is correct, for this we compute the precision with $max_i | A*x-b |_i$.
 
 
 
@@ -683,7 +683,7 @@ stable even if the residual error precision varies from \np{E-5} to \np{E-9}. By
 increasing the matrix size up to $100^3$ elements, it was necessary to increase the
 CPU power by \np[\%]{50} to \np[GFlops]{1.5} to get the algorithm convergence and the same order of asynchronous mode efficiency.  Maintaining  a relative gain of $2.5$ and such processor power but increasing network throughput inter cluster up to \np[Mbit/s]{50},  is obtained with
 high external precision of \np{E-11} for a matrix size from $110^3$ to $150^3$ side
-elements.
+elements. 
 
 %For the 3 clusters architecture including a total of 100 hosts,
 %Table~\ref{tab.cluster.3x33} shows that it was difficult to have a combination
