X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/rce2015.git/blobdiff_plain/10e29ec6c99b9f2d163484f8e73c99adcfb8ed1d..59da6f755ef66f1836438561750b66573b663c86:/paper.tex?ds=sidebyside

diff --git a/paper.tex b/paper.tex
index 9cc8e03..9c5f093 100644
--- a/paper.tex
+++ b/paper.tex
@@ -679,7 +679,7 @@ network  latency  from  $8.10^{-6}$  to $6.10^{-5}$  implies  an  absolute  time
 increase of more than $75\%$ (resp.   $82\%$) of the execution for the classical
 GMRES  (resp.   Krylov  multisplitting)  algorithm. The  execution  time  factor
 between the two algorithms  varies from 2.2 to 1.5 times  with a network latency
-decreasing from $8.10^{-6}$ to $6.10^{-5}$.
+decreasing from $8.10^{-6}$ to $6.10^{-5}$ second.
 
 
 \subsubsection{Network bandwidth impacts on performance}
@@ -750,9 +750,10 @@ lot. Consequently the execution times in that cases also varies.
 These  findings may  help a  lot end  users to  setup the  best and  the optimal
 targeted environment for the application deployment when focusing on the problem
 size scale up.  It  should be noticed that the same test has  been done with the
-grid 2 $\times$ 16 leading to the same conclusion.
+grid 4 $\times$ 8 leading to the same conclusion.
+
+\subsubsection{CPU Power impacts on performance\\}
 
-\subsubsection{CPU Power impacts on performance}
 
 \begin{table} [htbp]
 \centering
