RCE : Quelques corrections

[rce2015.git] / paper.tex

diff --git a/paper.tex b/paper.tex
index df664fb869316f25afc5e12b12bb10601472d9cc..64c70c892ffbf183f609e7d939557d45bee9bec0 100644 (file)
--- a/paper.tex
+++ b/paper.tex
@@ -56,6 +56,8 @@
 \newcommand{\MIG}{\mathit{maxit_{gmres}}}
 \newcommand{\TOLM}{\mathit{tol_{multi}}}
 \newcommand{\MIM}{\mathit{maxit_{multi}}}
 \newcommand{\MIG}{\mathit{maxit_{gmres}}}
 \newcommand{\TOLM}{\mathit{tol_{multi}}}
 \newcommand{\MIM}{\mathit{maxit_{multi}}}

+\newcommand{\TOLC}{\mathit{tol_{cgls}}}
+\newcommand{\MIC}{\mathit{maxit_{cgls}}}

 
 \usepackage{array}
 \usepackage{color, colortbl}
 
 \usepackage{array}
 \usepackage{color, colortbl}


@@ -90,14 +92,27 @@
 %% Lilia Ziane Khodja: Department of Aerospace \& Mechanical Engineering\\ Non Linear Computational Mechanics\\ University of Liege\\ Liege, Belgium. Email: l.zianekhodja@ulg.ac.be
 
 \begin{abstract}
 %% Lilia Ziane Khodja: Department of Aerospace \& Mechanical Engineering\\ Non Linear Computational Mechanics\\ University of Liege\\ Liege, Belgium. Email: l.zianekhodja@ulg.ac.be
 
 \begin{abstract}

-ABSTRACT
+  The behavior of multicore applications is always a challenge to predict, especially with a new architecture for which no experiment has been performed. With some applications, it is difficult, if not impossible, to build accurate performance models. That is why another solution is to use a simulation tool which allows us to change many parameters of the architecture (network bandwidth, latency, number of processors) and to simulate the execution of such applications. We have decided to use SimGrid as it enables to benchmark MPI applications.
+
+In this paper, we focus our attention on two parallel iterative algorithms based
+on the  Multisplitting algorithm  and we  compare them  to the  GMRES algorithm.
+These algorithms  are used to  solve libear  systems. Two different  variantsof the Multisplitting are
+studied: one  using synchronoous  iterations and  another one  with asynchronous
+iterations. For each algorithm we have  tested different parameters to see their
+influence.  We strongly  recommend people  interested  by investing  into a  new
+expensive  hardware  architecture  to   benchmark  their  applications  using  a
+simulation tool before.
+
+  
+
+  

 \end{abstract}
 
 \keywords{Algorithm; distributed; iterative; asynchronous; simulation; simgrid; performance}
 
 \maketitle
 
 \end{abstract}
 
 \keywords{Algorithm; distributed; iterative; asynchronous; simulation; simgrid; performance}
 
 \maketitle
 

-\section{Introduction}
+\section{Introduction} 

 
 \section{The asynchronous iteration model}
 
 
 \section{The asynchronous iteration model}
 


@@ -125,76 +140,127 @@ where $x_\ell$ are sub-vectors of the solution $x$, $b_\ell$ are the sub-vectors
 A_{\ell\ell} x_\ell = c_\ell,\mbox{~for~}\ell=1,\ldots,L,
 \label{eq:03}
 \end{equation}
 A_{\ell\ell} x_\ell = c_\ell,\mbox{~for~}\ell=1,\ldots,L,
 \label{eq:03}
 \end{equation}

-where right-hand sides $c_\ell=b_\ell-\sum_{m\neq\ell}A_{\ell m}x_m$ are computed using the shared vectors $x_m$. In this paper, we use the well-known iterative method GMRES ({\it Generalized Minimal RESidual})~\cite{saad86} as an inner iteration to approximate the solutions of the different splittings arising from the block Jacobi multisplitting of matrix $A$. Algorithm~\ref{alg:01} shows the main key points of our block Jacobi two-stage method executed by a cluster of processors. In line~\ref{solve}, the linear sub-system~(\ref{eq:03}) is solved in parallel using GMRES method where $\MIG$ and $\TOLG$ are the maximum number of inner iterations and the tolerance threshold of GMRES respectively.  
+where right-hand sides $c_\ell=b_\ell-\sum_{m\neq\ell}A_{\ell m}x_m$ are computed using the shared vectors $x_m$. In this paper, we use the well-known iterative method GMRES ({\it Generalized Minimal RESidual})~\cite{saad86} as an inner iteration to approximate the solutions of the different splittings arising from the block Jacobi multisplitting of matrix $A$. The algorithm in Figure~\ref{alg:01} shows the main key points of our block Jacobi two-stage method executed by a cluster of processors. In line~\ref{solve}, the linear sub-system~(\ref{eq:03}) is solved in parallel using GMRES method where $\MIG$ and $\TOLG$ are the maximum number of inner iterations and the tolerance threshold for GMRES respectively. The convergence of the two-stage multisplitting methods, based on synchronous or asynchronous iterations, is studied by many authors for example~\cite{Bru95,bahi07}. 

 
 

-\begin{algorithm}[t]
-\caption{Block Jacobi two-stage multisplitting method}
+\begin{figure}[t]
+%\begin{algorithm}[t]
+%\caption{Block Jacobi two-stage multisplitting method}

 \begin{algorithmic}[1]
   \Input $A_\ell$ (sparse matrix), $b_\ell$ (right-hand side)
   \Output $x_\ell$ (solution vector)\vspace{0.2cm}
   \State Set the initial guess $x^0$
   \For {$k=1,2,3,\ldots$ until convergence}
     \State $c_\ell=b_\ell-\sum_{m\neq\ell}A_{\ell m}x_m^{k-1}$
 \begin{algorithmic}[1]
   \Input $A_\ell$ (sparse matrix), $b_\ell$ (right-hand side)
   \Output $x_\ell$ (solution vector)\vspace{0.2cm}
   \State Set the initial guess $x^0$
   \For {$k=1,2,3,\ldots$ until convergence}
     \State $c_\ell=b_\ell-\sum_{m\neq\ell}A_{\ell m}x_m^{k-1}$

-    \State $x^k_\ell=Solve(A_{\ell\ell},c_\ell,x^{k-1}_\ell,\MIG,\TOLG)$\label{solve}
+    \State $x^k_\ell=Solve_{gmres}(A_{\ell\ell},c_\ell,x^{k-1}_\ell,\MIG,\TOLG)$\label{solve}

     \State Send $x_\ell^k$ to neighboring clusters\label{send}
     \State Receive $\{x_m^k\}_{m\neq\ell}$ from neighboring clusters\label{recv}
   \EndFor
 \end{algorithmic}
     \State Send $x_\ell^k$ to neighboring clusters\label{send}
     \State Receive $\{x_m^k\}_{m\neq\ell}$ from neighboring clusters\label{recv}
   \EndFor
 \end{algorithmic}

+\caption{Block Jacobi two-stage multisplitting method}

 \label{alg:01}
 \label{alg:01}

-\end{algorithm}
-
-The convergence of the two-stage multisplitting methods, based on synchronous or asynchronous iterations, is studied by many authors for example~\cite{Szyld92,Bru95,Bai99,bahi07}. The multisplitting methods are convergent: 
-\begin{itemize}
-\item if $A^{-1}>0$ and the splittings of matrix $A$ are weak regular when the iterations are synchronous, or
-\item if $A$ is M-matrix and its splittings are regular when the iterations are asynchronous.
-\end{itemize}
+%\end{algorithm} 
+\end{figure}

 
 

-In this paper, we propose two algorithms of two-stage multisplitting methods. The first algorithm is based on asynchronous model which allows the communications to be overlapped by computations and reduces the idle times resulting from the synchronizations. So in the asynchronous mode, our two-stage algorithm uses asynchronous outer iterations and asynchronous communications between clusters. The communications (i.e. lines~\ref{send} and~\ref{recv} in Algorithm~\ref{alg:01}) are performed by message passing using MPI non-blocking communication routines. The convergence of the asynchronous iterations is detected when all clusters have locally converged
+In this paper, we propose two algorithms of two-stage multisplitting methods. The first algorithm is based on asynchronous model which allows the communications to be overlapped by computations and reduces the idle times resulting from the synchronizations. So in the asynchronous mode, our two-stage algorithm uses asynchronous outer iterations and asynchronous communications between clusters. The communications (i.e. lines~\ref{send} and~\ref{recv} in Figure~\ref{alg:01}) are performed by message passing using MPI non-blocking communication routines. The convergence of the asynchronous iterations is detected when all clusters have locally converged

 \begin{equation}
 k\geq\MIM\mbox{~or~}\|x_\ell^{k+1}-x_\ell^k\|_{\infty }\leq\TOLM,
 \label{eq:04}
 \end{equation}    
 \begin{equation}
 k\geq\MIM\mbox{~or~}\|x_\ell^{k+1}-x_\ell^k\|_{\infty }\leq\TOLM,
 \label{eq:04}
 \end{equation}    

-where $\MIM$ is the maximum number of outer iterations and $\TOLM$ is the tolerance threshold of the two-stage algorithm. 
+where $\MIM$ is the maximum number of outer iterations and $\TOLM$ is the tolerance threshold for the two-stage algorithm. 
+
+The second two-stage algorithm is based on synchronous outer iterations. We propose to use the Krylov iteration based on residual minimization to improve the slow convergence of the multisplitting methods. In this case, a $n\times s$ matrix $S$ is set using solutions issued from the inner iteration 
+\begin{equation}
+S=[x^1,x^2,\ldots,x^s],~s\ll n.
+\label{eq:05}
+\end{equation}   
+At each $s$ outer iterations, the algorithm computes a new approximation $\tilde{x}=S\alpha$ which minimizes the residual
+\begin{equation}
+\min_{\alpha\in\mathbb{R}^s}{\|b-AS\alpha\|_2}.
+\label{eq:06}
+\end{equation} 
+The algorithm in Figure~\ref{alg:02} includes the procedure of the residual minimization and the outer iteration is restarted with a new approximation $\tilde{x}$ at every $s$ iterations. The least-squares problem~(\ref{eq:06}) is solved in parallel by all clusters using CGLS method~\cite{Hestenes52} such that $\MIC$ is the maximum number of iterations and $\TOLC$ is the tolerance threshold for this method (line~\ref{cgls} in Figure~\ref{alg:02}).

  
  

+\begin{figure}[t]
+%\begin{algorithm}[t]
+%\caption{Krylov two-stage method using block Jacobi multisplitting}
+\begin{algorithmic}[1]
+  \Input $A_\ell$ (sparse matrix), $b_\ell$ (right-hand side)
+  \Output $x_\ell$ (solution vector)\vspace{0.2cm}
+  \State Set the initial guess $x^0$
+  \For {$k=1,2,3,\ldots$ until convergence}
+    \State $c_\ell=b_\ell-\sum_{m\neq\ell}A_{\ell m}x_m^{k-1}$
+    \State $x^k_\ell=Solve_{gmres}(A_{\ell\ell},c_\ell,x^{k-1}_\ell,\MIG,\TOLG)$
+    \State $S_{\ell,k\mod s}=x_\ell^k$
+    \If{$k\mod s = 0$}
+       \State $\alpha = Solve_{cgls}(AS,b,\MIC,\TOLC)$\label{cgls}
+       \State $\tilde{x_\ell}=S_\ell\alpha$
+       \State Send $\tilde{x_\ell}$ to neighboring clusters
+       \Else 
+         \State Send $x_\ell^k$ to neighboring clusters
+    \EndIf
+    \State Receive $\{x_m^k\}_{m\neq\ell}$ from neighboring clusters
+  \EndFor
+\end{algorithmic}
+\caption{Krylov two-stage method using block Jacobi multisplitting}
+\label{alg:02}
+%\end{algorithm} 
+\end{figure}

 
 

+\subsection{Simulation of two-stage methods using SimGrid framework}
+\label{sec:04.02}

 
 

+One of our objectives when simulating the application in SIMGRID is, as in real life, to get accurate results (solutions of the problem) but also ensure the test reproducibility under the same conditions. According our experience, very few modifications are required to adapt a MPI program to run in SIMGRID simulator using SMPI (Simulator MPI).The first modification is to include SMPI libraries and related header files (smpi.h). The second and important modification is to eliminate all global variables in moving them to local subroutine or using a Simgrid selector called "runtime automatic switching" (smpi/privatize\_global\_variables). Indeed, global variables can generate side effects on runtime between the threads running in the same process, generated by the Simgrid to simulate the grid environment.The last modification on the MPI program pointed out for some cases, the review of the sequence of the MPI\_Isend, MPI\_Irecv and MPI\_Waitall instructions which might cause an infinite loop.     

 
 
 
 

+\paragraph{SIMGRID Simulator parameters}

 
 

+\begin{itemize}
+       \item hostfile: Hosts description file.
+       \item plarform: File describing the platform architecture : clusters (CPU power,
+\dots{}), intra cluster network description, inter cluster network (bandwidth bw,
+latency lat, \dots{}).
+       \item archi   : Grid computational description (Number of clusters, Number of 
+nodes/processors for each cluster). 
+\end{itemize}

 
 
 
 

-\subsection{Simulation of two-stage methods using SimGrid framework}
+In addition, the following arguments are given to the programs at runtime:
+
+\begin{itemize}
+       \item Maximum number of inner and outer iterations;
+       \item Inner and outer precisions;
+       \item Matrix size (N$_{x}$, N$_{y}$ and N$_{z}$);
+       \item Matrix diagonal value = 6.0;
+       \item Execution Mode: synchronous or asynchronous.
+\end{itemize}
+
+At last, note that the two solver algorithms have been executed with the Simgrid selector -cfg=smpi/running\_power which determine the computational power (here 19GFlops) of the simulator host machine.  

 
 %%%%%%%%%%%%%%%%%%%%%%%%%
 %%%%%%%%%%%%%%%%%%%%%%%%%
 
 
 %%%%%%%%%%%%%%%%%%%%%%%%%
 %%%%%%%%%%%%%%%%%%%%%%%%%
 

-\section{Experimental, Results and Comments}
+\section{Experimental Results}

 
 
 
 

-\textbf{V.1. Setup study and Methodology}
+\subsection{Setup study and Methodology}

 
 To conduct our study, we have put in place the following methodology 
 
 To conduct our study, we have put in place the following methodology 

-which can be reused with any grid-enabled applications.
+which can be reused for any grid-enabled applications.

 
 \textbf{Step 1} : Choose with the end users the class of algorithms or 
 the application to be tested. Numerical parallel iterative algorithms 
 
 \textbf{Step 1} : Choose with the end users the class of algorithms or 
 the application to be tested. Numerical parallel iterative algorithms 

-have been chosen for the study in the paper. 
+have been chosen for the study in this paper. \\

 
 \textbf{Step 2} : Collect the software materials needed for the 
 
 \textbf{Step 2} : Collect the software materials needed for the 

-experimentation. In our case, we have three variants algorithms for the 
-resolution of three 3D-Poisson problem: (1) using the classical GMRES alias Algo-1 in this 
-paper, (2) using the multisplitting method alias Algo-2 and (3) an 
-enhanced version of the multisplitting method as Algo-3. In addition, 
-SIMGRID simulator has been chosen to simulate the behaviors of the 
-distributed applications. SIMGRID is running on the Mesocentre 
-datacenter in Franche-Comte University $[$10$]$ but also in a virtual 
-machine on a laptop.
+experimentation. In our case, we have two variants algorithms for the 
+resolution of three 3D-Poisson problem: (1) using the classical GMRES (Algo-1)(2) and the multisplitting method (Algo-2). In addition, SIMGRID simulator has been chosen to simulate the behaviors of the 
+distributed applications. SIMGRID is running on the Mesocentre datacenter in Franche-Comte University but also in a virtual machine on a laptop. \\

 
 \textbf{Step 3} : Fix the criteria which will be used for the future 
 results comparison and analysis. In the scope of this study, we retain 
 in one hand the algorithm execution mode (synchronous and asynchronous) 
 and in the other hand the execution time and the number of iterations of 
 
 \textbf{Step 3} : Fix the criteria which will be used for the future 
 results comparison and analysis. In the scope of this study, we retain 
 in one hand the algorithm execution mode (synchronous and asynchronous) 
 and in the other hand the execution time and the number of iterations of 

-the application before obtaining the convergence.
+the application before obtaining the convergence. \\

 
 \textbf{Step 4 }: Setup up the different grid testbeds environment 
 which will be simulated in the simulator tool to run the program. The 
 
 \textbf{Step 4 }: Setup up the different grid testbeds environment 
 which will be simulated in the simulator tool to run the program. The 


@@ -203,17 +269,17 @@ grid containing 2 clusters with 16 hosts (processors/cores) each -, 4x8,
 4x16, 8x8 and 2x50. The network has been designed to operate with a 
 bandwidth equals to 10Gbits (resp. 1Gbits/s) and a latency of 8E-6 
 microseconds (resp. 5E-5) for the intra-clusters links (resp. 
 4x16, 8x8 and 2x50. The network has been designed to operate with a 
 bandwidth equals to 10Gbits (resp. 1Gbits/s) and a latency of 8E-6 
 microseconds (resp. 5E-5) for the intra-clusters links (resp. 

-inter-clusters backbone links).
+inter-clusters backbone links). \\

 
 

-\textbf{Step 5}: Process an extensive and comprehensive testings 
+\textbf{Step 5}: Conduct an extensive and comprehensive testings 

 within these configurations in varying the key parameters, especially 
 the CPU power capacity, the network parameters and also the size of the 
 within these configurations in varying the key parameters, especially 
 the CPU power capacity, the network parameters and also the size of the 

-input matrix. Note that some parameters should be invariant to allow the 
-comparison like some program input arguments.
+input matrix. Note that some parameters should be fixed to be invariant to allow the 
+comparison like some program input arguments. \\

 
 \textbf{Step 6} : Collect and analyze the output results.
 
 
 \textbf{Step 6} : Collect and analyze the output results.
 

-\textbf{ V.2. Factors impacting distributed applications performance in 
+\subsection{Factors impacting distributed applications performance in 

 a grid environment}
 
 From our previous experience on running distributed application in a 
 a grid environment}
 
 From our previous experience on running distributed application in a 


@@ -228,7 +294,7 @@ Another important factor impacting the overall performance of the
 application is the network configuration. Two main network parameters 
 can modify drastically the program output results : (i) the network 
 bandwidth (bw=bits/s) also known as "the data-carrying capacity" 
 application is the network configuration. Two main network parameters 
 can modify drastically the program output results : (i) the network 
 bandwidth (bw=bits/s) also known as "the data-carrying capacity" 

-$[$13$]$ of the network is defined as the maximum of data that can pass 
+of the network is defined as the maximum of data that can pass 

 from one point to another in a unit of time. (ii) the network latency 
 (lat : microsecond) defined as the delay from the start time to send the 
 data from a source and the final time the destination have finished to 
 from one point to another in a unit of time. (ii) the network latency 
 (lat : microsecond) defined as the delay from the start time to send the 
 data from a source and the final time the destination have finished to 


@@ -249,7 +315,7 @@ networks components thru internet with a lower speed. The network
 between distant clusters might be a bottleneck for the global 
 performance of the application. 
 
 between distant clusters might be a bottleneck for the global 
 performance of the application. 
 

-\textbf{V.3 Comparing GMRES and Multisplitting algorithms in 
+\subsection{Comparing GMRES and Multisplitting algorithms in 

 synchronous mode}
 
 In the scope of this paper, our first objective is to demonstrate the 
 synchronous mode}
 
 In the scope of this paper, our first objective is to demonstrate the 


@@ -261,7 +327,7 @@ before reaching the convergence. For a systematic study, the experiments
 should figure out that, for various grid parameters values, the 
 simulator will confirm the targeted outcomes, particularly for poor and 
 slow networks, focusing on the impact on the communication performance 
 should figure out that, for various grid parameters values, the 
 simulator will confirm the targeted outcomes, particularly for poor and 
 slow networks, focusing on the impact on the communication performance 

-on the chosen class of algorithm $[$12$]$.
+on the chosen class of algorithm.

 
 The following paragraphs present the test conditions, the output results 
 and our comments.
 
 The following paragraphs present the test conditions, the output results 
 and our comments.


@@ -280,22 +346,23 @@ architecture scaling up the input matrix size}
  Input matrix size & N$_{x}$ =150 x 150 x 150 and\\ %\hline
  - & N$_{x}$ =170 x 170 x 170    \\ \hline
  \end{tabular}
  Input matrix size & N$_{x}$ =150 x 150 x 150 and\\ %\hline
  - & N$_{x}$ =170 x 170 x 170    \\ \hline
  \end{tabular}

-\end{footnotesize}
+Table 1 : Clusters x Nodes with NX=150 or NX=170 \\

 
 

+\end{footnotesize}

 
 

- Table 1 : Clusters x Nodes with NX=150 or NX=170

 
 

-\RCE{J'ai voulu mettre les tableaux des données mais je pense que c'est inutile et ça va surcharger}
+ 
+%\RCE{J'ai voulu mettre les tableaux des données mais je pense que c'est inutile et ça va surcharger}

 
 
 The results in figure 1 show the non-variation of the number of 
 iterations of classical GMRES for a given input matrix size; it is not 
 the case for the multisplitting method. 
 
 
 
 The results in figure 1 show the non-variation of the number of 
 iterations of classical GMRES for a given input matrix size; it is not 
 the case for the multisplitting method. 
 

-%\begin{wrapfigure}{l}{60mm}
+%\begin{wrapfigure}{l}{100mm}

 \begin{figure} [ht!]
 \centering
 \begin{figure} [ht!]
 \centering

-\includegraphics[width=60mm]{cluster_x_nodes_nx_150_and_nx_170.pdf}
+\includegraphics[width=100mm]{cluster_x_nodes_nx_150_and_nx_170.pdf}

 \caption{Cluster x Nodes NX=150 and NX=170} 
 %\label{overflow}}
 \end{figure}
 \caption{Cluster x Nodes NX=150 and NX=170} 
 %\label{overflow}}
 \end{figure}


@@ -309,7 +376,7 @@ experiment concludes the low sensitivity of the multisplitting method
 (compared with the classical GMRES) when scaling up to higher input 
 matrix size. 
 
 (compared with the classical GMRES) when scaling up to higher input 
 matrix size. 
 

-\textit{3.b Running on various computational grid architecture}
+\textit{\\3.b Running on various computational grid architecture\\}

 
 % environment
 \begin{footnotesize}
 
 % environment
 \begin{footnotesize}


@@ -320,16 +387,16 @@ matrix size.
  - & N2 : bw=1Gbs-lat=5E-05 \\
  Input matrix size & N$_{x}$ =150 x 150 x 150\\ \hline \\
  \end{tabular}
  - & N2 : bw=1Gbs-lat=5E-05 \\
  Input matrix size & N$_{x}$ =150 x 150 x 150\\ \hline \\
  \end{tabular}

-\end{footnotesize}
+Table 2 : Clusters x Nodes - Networks N1 x N2 \\

 
 

-%Table 2 : Clusters x Nodes - Networks N1 x N2
-%\RCE{idem pour tous les tableaux de donnees}
+ \end{footnotesize}

 
 
 
 

-%\begin{wrapfigure}{l}{60mm}
+
+%\begin{wrapfigure}{l}{100mm}

 \begin{figure} [ht!]
 \centering
 \begin{figure} [ht!]
 \centering

-\includegraphics[width=60mm]{cluster_x_nodes_n1_x_n2.pdf}
+\includegraphics[width=100mm]{cluster_x_nodes_n1_x_n2.pdf}

 \caption{Cluster x Nodes N1 x N2}
 %\label{overflow}}
 \end{figure}
 \caption{Cluster x Nodes N1 x N2}
 %\label{overflow}}
 \end{figure}


@@ -343,7 +410,7 @@ performance was increased in a factor of 2. The results depict also that
 when the network speed drops down, the difference between the execution 
 times can reach more than 25\%. 
 
 when the network speed drops down, the difference between the execution 
 times can reach more than 25\%. 
 

-\textit{\\\\\\\\\\\\\\\\\\3.c Network latency impacts on performance}
+\textit{\\3.c Network latency impacts on performance\\}

 
 % environment
 \begin{footnotesize}
 
 % environment
 \begin{footnotesize}


@@ -353,14 +420,16 @@ times can reach more than 25\%.
  Network & N1 : bw=1Gbs \\ %\hline
  Input matrix size & N$_{x}$ =150 x 150 x 150\\ \hline\\
  \end{tabular}
  Network & N1 : bw=1Gbs \\ %\hline
  Input matrix size & N$_{x}$ =150 x 150 x 150\\ \hline\\
  \end{tabular}

+
+Table 3 : Network latency impact \\
+

 \end{footnotesize}
 
 \end{footnotesize}
 

-Table 3 : Network latency impact

 
 
 \begin{figure} [ht!]
 \centering
 
 
 \begin{figure} [ht!]
 \centering

-\includegraphics[width=60mm]{network_latency_impact_on_execution_time.pdf}
+\includegraphics[width=100mm]{network_latency_impact_on_execution_time.pdf}

 \caption{Network latency impact on execution time}
 %\label{overflow}}
 \end{figure}
 \caption{Network latency impact on execution time}
 %\label{overflow}}
 \end{figure}


@@ -376,7 +445,7 @@ a less rate increase. Consequently, in the worst case (lat=6.10$^{-5
 the multisplitting, even though, the performance was on the same order 
 of magnitude with a latency of 8.10$^{-6}$. 
 
 the multisplitting, even though, the performance was on the same order 
 of magnitude with a latency of 8.10$^{-6}$. 
 

-\textit{3.d Network bandwidth impacts on performance}
+\textit{\\3.d Network bandwidth impacts on performance\\}

 
 % environment
 \begin{footnotesize}
 
 % environment
 \begin{footnotesize}


@@ -386,13 +455,15 @@ of magnitude with a latency of 8.10$^{-6}$.
  Network & N1 : bw=1Gbs - lat=5E-05 \\ %\hline
  Input matrix size & N$_{x}$ =150 x 150 x 150\\ \hline
  \end{tabular}
  Network & N1 : bw=1Gbs - lat=5E-05 \\ %\hline
  Input matrix size & N$_{x}$ =150 x 150 x 150\\ \hline
  \end{tabular}

+
+Table 4 : Network bandwidth impact \\
+

 \end{footnotesize}
 
 \end{footnotesize}
 

-Table 4 : Network bandwidth impact

 
 \begin{figure} [ht!]
 \centering
 
 \begin{figure} [ht!]
 \centering

-\includegraphics[width=60mm]{network_bandwith_impact_on_execution_time.pdf}
+\includegraphics[width=100mm]{network_bandwith_impact_on_execution_time.pdf}

 \caption{Network bandwith impact on execution time}
 %\label{overflow}
 \end{figure}
 \caption{Network bandwith impact on execution time}
 %\label{overflow}
 \end{figure}


@@ -405,7 +476,7 @@ algorithms. However, and again in this case, the multisplitting method
 presents a better performance in the considered bandwidth interval with 
 a gain of 40\% which is only around 24\% for classical GMRES.
 
 presents a better performance in the considered bandwidth interval with 
 a gain of 40\% which is only around 24\% for classical GMRES.
 

-\textit{3.e Input matrix size impacts on performance}
+\textit{\\3.e Input matrix size impacts on performance\\}

 
 % environment
 \begin{footnotesize}
 
 % environment
 \begin{footnotesize}


@@ -415,13 +486,14 @@ a gain of 40\% which is only around 24\% for classical GMRES.
  Network & N2 : bw=1Gbs - lat=5E-05 \\ %\hline
  Input matrix size & N$_{x}$ = From 40 to 200\\ \hline
  \end{tabular}
  Network & N2 : bw=1Gbs - lat=5E-05 \\ %\hline
  Input matrix size & N$_{x}$ = From 40 to 200\\ \hline
  \end{tabular}

+Table 5 : Input matrix size impact\\
+

 \end{footnotesize}
 
 \end{footnotesize}
 

-Table 5 : Input matrix size impact

 
 \begin{figure} [ht!]
 \centering
 
 \begin{figure} [ht!]
 \centering

-\includegraphics[width=60mm]{pb_size_impact_on_execution_time.pdf}
+\includegraphics[width=100mm]{pb_size_impact_on_execution_time.pdf}

 \caption{Pb size impact on execution time}
 %\label{overflow}}
 \end{figure}
 \caption{Pb size impact on execution time}
 %\label{overflow}}
 \end{figure}


@@ -440,7 +512,7 @@ the best and the optimal targeted environment for the application
 deployment when focusing on the problem size scale up. Note that the 
 same test has been done with the grid 2x16 getting the same conclusion.
 
 deployment when focusing on the problem size scale up. Note that the 
 same test has been done with the grid 2x16 getting the same conclusion.
 

-\textit{3.f CPU Power impact on performance}
+\textit{\\3.f CPU Power impact on performance\\}

 
 % environment
 \begin{footnotesize}
 
 % environment
 \begin{footnotesize}


@@ -450,13 +522,14 @@ same test has been done with the grid 2x16 getting the same conclusion.
  Network & N2 : bw=1Gbs - lat=5E-05 \\ %\hline
  Input matrix size & N$_{x}$ = 150 x 150 x 150\\ \hline
  \end{tabular}
  Network & N2 : bw=1Gbs - lat=5E-05 \\ %\hline
  Input matrix size & N$_{x}$ = 150 x 150 x 150\\ \hline
  \end{tabular}

+Table 6 : CPU Power impact \\
+

 \end{footnotesize}
 
 \end{footnotesize}
 

-Table 6 : CPU Power impact

 
 \begin{figure} [ht!]
 \centering
 
 \begin{figure} [ht!]
 \centering

-\includegraphics[width=60mm]{cpu_power_impact_on_execution_time.pdf}
+\includegraphics[width=100mm]{cpu_power_impact_on_execution_time.pdf}

 \caption{CPU Power impact on execution time}
 %\label{overflow}}
 \end{figure}
 \caption{CPU Power impact on execution time}
 %\label{overflow}}
 \end{figure}


@@ -468,7 +541,7 @@ confirm the performance gain, around 95\% for both of the two methods,
 after adding more powerful CPU. Note that the execution time axis in the 
 figure is in logarithmic scale.
 
 after adding more powerful CPU. Note that the execution time axis in the 
 figure is in logarithmic scale.
 

- \textbf{V.4 Comparing GMRES in native synchronous mode and 
+\subsection{Comparing GMRES in native synchronous mode and 

 Multisplitting algorithms in asynchronous mode}
 
 The previous paragraphs put in evidence the interests to simulate the 
 Multisplitting algorithms in asynchronous mode}
 
 The previous paragraphs put in evidence the interests to simulate the 


@@ -496,7 +569,7 @@ best combination of the grid resources (CPU, Network, input matrix size,
 classical GMRES time. 
 
 
 classical GMRES time. 
 
 

-The test conditions are summarized in the table below : 
+The test conditions are summarized in the table below : \\

 
 % environment
 \begin{footnotesize}
 
 % environment
 \begin{footnotesize}


@@ -507,7 +580,7 @@ The test conditions are summarized in the table below :
    Intra-Network & bw=1.25 Gbits - lat=5E-05 \\ %\hline
    Inter-Network & bw=5 Mbits - lat=2E-02\\
  Input matrix size & N$_{x}$ = From 62 to 150\\ %\hline
    Intra-Network & bw=1.25 Gbits - lat=5E-05 \\ %\hline
    Inter-Network & bw=5 Mbits - lat=2E-02\\
  Input matrix size & N$_{x}$ = From 62 to 150\\ %\hline

- Residual error precision: 10$^{-5}$ to 10$^{-9}$\\ \hline
+ Residual error precision: 10$^{-5}$ to 10$^{-9}$\\ \hline \\

  \end{tabular}
 \end{footnotesize}
 
  \end{tabular}
 \end{footnotesize}