\end{table}
\subsubsection{Simulations for various grid architectures and scaling-up matrix sizes}
-\ \\
-% environment
+
In this section, we analyze the simulations conducted on various grid
configurations and for different sizes of the 3D Poisson problem. The parameters
of the network between clusters is fixed to $N2$ (see
\subsubsection{Network latency impacts on performance}
-\ \\
+
\begin{table} [ht!]
\centering
\begin{tabular}{r c }
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}
-\ \\
+
\begin{table} [ht!]
\centering
\begin{tabular}{r c }
of $40\%$ which is only around $24\%$ for the classical GMRES.
\subsubsection{Input matrix size impacts on performance}
-\ \\
+
\begin{table} [ht!]
\centering
\begin{tabular}{r c }
size scale up. It should be noticed that the same test has been done with the
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
