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

diff --git a/paper.tex b/paper.tex
index 6affca8..f1f47bf 100644
--- a/paper.tex
+++ b/paper.tex
@@ -461,8 +461,7 @@ transit between the clusters and nodes during the code execution.
  speed.  The network  between distant  clusters might  be a  bottleneck for  the
  global performance of the application.
 
-\subsection{Comparison of GMRES and Krylov Multisplitting algorithms in
-synchronous mode}
+\subsection{Comparison of GMRES and Krylov Multisplitting algorithms in synchronous mode}
 
 In the scope  of this paper, our  first objective is to analyze  when the Krylov
 Multisplitting  method   has  better  performances  than   the  classical  GMRES
@@ -481,7 +480,9 @@ and our comments.\\
 architecture and scaling up the input matrix size}
 \ \\
 % environment
-\begin{footnotesize}
+
+\begin{figure} [ht!]
+\begin{center}
 \begin{tabular}{r c }
  \hline
  Grid & 2x16, 4x8, 4x16 and 8x8\\ %\hline
@@ -489,26 +490,34 @@ architecture and scaling up the input matrix size}
  Input matrix size & N$_{x}$ x N$_{y}$ x N$_{z}$ =150 x 150 x 150\\ %\hline
  - &  N$_{x}$ x N$_{y}$ x N$_{z}$  =170 x 170 x 170    \\ \hline
  \end{tabular}
-Table 1 : Clusters x Nodes with N$_{x}$=150 or N$_{x}$=170 \\
+\caption{Clusters x Nodes with N$_{x}$=150 or N$_{x}$=170 \RC{je ne comprends pas la légende... Ca ne serait pas plutot Characteristics of cluster (mais il faudrait lui donner un nom)}}
+\end{center}
+\end{figure}
 
-\end{footnotesize}
 
 
 
 %\RCE{J'ai voulu mettre les tableaux des données mais je pense que c'est inutile et ça va surcharger}
 
 
-In this section, we compare the algorithms performance running on various grid configuration (2x16, 4x8, 4x16 and 8x8). First, the results in figure 3 show for all grid configuration 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.
+In this  section, we analyze the  performences of algorithms running  on various
+grid configuration  (2x16, 4x8, 4x16  and 8x8). First,  the results in  Figure~\ref{fig:01}
+show for all grid configuration 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.
+
+\RC{CE attention tu n'as pas mis de label dans tes figures, donc c'est le bordel, j'en mets mais vérifie...}
+\RC{Les légendes ne sont pas explicites...}
+
 
-%\begin{wrapfigure}{l}{100mm}
 \begin{figure} [ht!]
-\centering
-\includegraphics[width=100mm]{cluster_x_nodes_nx_150_and_nx_170.pdf}
-\caption{Cluster x Nodes N$_{x}$=150 and N$_{x}$=170}
-%\label{overflow}}
+  \begin{center}
+    \includegraphics[width=100mm]{cluster_x_nodes_nx_150_and_nx_170.pdf}
+  \end{center}
+  \caption{Cluster x Nodes N$_{x}$=150 and N$_{x}$=170}
+  \label{fig:01}
 \end{figure}
-%\end{wrapfigure}
+
 
 The execution time difference between the two algorithms is important when
 comparing between different grid architectures, even with the same number of