X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/blobdiff_plain/8af7de742ea7a8327a7d2fb131d94fca23d31c28..b8a5e3cc097f2de701771aa2fc854e91ca363f59:/hpcc.tex

diff --git a/hpcc.tex b/hpcc.tex
index c457958..573bb48 100644
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -319,38 +319,19 @@
 
 
 \usepackage[T1]{fontenc}
-\usepackage{ucs}
-%\usepackage[utf8x]{inputenc}
-\usepackage{lmodern}
-\usepackage{color}
-%% Jolis entetes %%
-\usepackage[Glenn]{fncychap}
+\usepackage[utf8]{inputenc}
 %\usepackage{amsmath}
 %\usepackage{amsthm}
 %\usepackage{amsfonts}
 %\usepackage{graphicx}
 %\usepackage{xspace}
-% Definition des marges
-\usepackage{vmargin}
-\setpapersize[portrait]{A4}
-\usepackage[francais]{babel}
+\usepackage[american]{babel}
 % Extension pour les graphiques EPS
 %\usepackage[dvips]{graphicx}
 \usepackage[pdftex,final]{graphicx}
 % Extension pour les liens intra-documents (tagged PDF)
 % et l'affichage correct des URL (commande \url{http://example.com})
-\usepackage{hyperref}
-
-\ifCLASSINFOpdf
-   \usepackage[pdftex]{graphicx}
-   \DeclareGraphicsExtensions{.pdf,.jpeg,.png}
-\else
-\fi
-
-
-
-% correct bad hyphenation here
-\hyphenation{op-tical net-works semi-conduc-tor}
+%\usepackage{hyperref}
 
 
 \begin{document}
@@ -363,9 +344,9 @@
 % author names and affiliations
 % use a multiple column layout for up to three different
 % affiliations
-\author{\IEEEauthorblockN{Raphaël Couturier and Arnaud Giersch and David Laiymani and Charles-Emile Ramamonjisoa}
+\author{\IEEEauthorblockN{RaphaÃ«l Couturier and Arnaud Giersch and David Laiymani and Charles-Emile Ramamonjisoa}
 \IEEEauthorblockA{Femto-ST Institute - DISC Department\\
-Université de Franche-Comté\\
+UniversitÃ© de Franche-ComtÃ©\\
 Belfort\\
 Email: raphael.couturier@univ-fcomte.fr}
 %\and
@@ -417,20 +398,20 @@ The abstract goes here.
 
 \section{Introduction}
 
-Présenter un bref état de l'art sur la simulation d'algos parallèles. Présenter rapidement les algos itératifs asynchrones et leurs avantages. Parler de leurs inconvénients en particulier la difficulté de déploiement à grande échelle donc il serait bien de simuler. Dire qu'à notre connaissance il n'existe pas de simulation de ce type d'algo.
-Présenter les travaux et les résultats obtenus. Annoncer le plan.
+PrÃ©senter un bref Ã©tat de l'art sur la simulation d'algos parallÃ¨les. PrÃ©senter rapidement les algos itÃ©ratifs asynchrones et leurs avantages. Parler de leurs inconvÃ©nients en particulier la difficultÃ© de dÃ©ploiement Ã  grande Ã©chelle donc il serait bien de simuler. Dire qu'Ã  notre connaissance il n'existe pas de simulation de ce type d'algo.
+PrÃ©senter les travaux et les rÃ©sultats obtenus. Annoncer le plan.
  
 \section{The asynchronous iteration model}
 
-Décrire le modèle asynchrone. Je m'en charge (DL)
+DÃ©crire le modÃ¨le asynchrone. Je m'en charge (DL)
 
 \section{SimGrid}
 
-Décrire SimGrid (Arnaud)
+DÃ©crire SimGrid (Arnaud)
 
 \section{Simulation of the multi-splitting method}
 
-Décrire le problème (algo) traité ainsi que le processus d'adaptation à SimGrid.
+DÃ©crire le problÃ¨me (algo) traitÃ© ainsi que le processus d'adaptation Ã  SimGrid.
 
 \section{Experimental results}
 {\raggedright
@@ -462,7 +443,7 @@ clusters linked with long distance network like Internet.
 {\raggedright
 As a first step, the algorithm was run on a network consisting of two clusters
 containing fifty hosts each, totaling one hundred hosts. Various combinations of
-the above factors have providing the results shown in Table 1 with a matrix size
+the above factors have providing the results shown in Table~\ref{tab.cluster.2x50} with a matrix size
 ranging from Nx = Ny = Nz = 62 to 171 elements or from 62$^{3}$ = 238328 to
 171$^{3}$ = 5,211,000 entries.
 }
@@ -471,13 +452,13 @@ ranging from Nx = Ny = Nz = 62 to 171 elements or from 62$^{3}$ = 238328 to
 Then we have changed the network configuration using three clusters containing
 respectively 33, 33 and 34 hosts, or again by on hundred hosts for all the
 clusters. In the same way as above, a judicious choice of key parameters has
-permitted to get the results in Table 2 which shows the speedups less than 1 with
+permitted to get the results in Table~\ref{tab.cluster.3x33} which shows the speedups less than 1 with
 a matrix size from 62 to 100 elements.
 }
 
 {\raggedright
 In a final step, results of an execution attempt to scale up the three clustered
-configuration but increasing by two hundreds hosts has been recorded in Table 3.
+configuration but increasing by two hundreds hosts has been recorded in Table~\ref{tab.cluster.3x67}.
 }
 
 {\raggedright
@@ -509,19 +490,26 @@ lat latency , ... ).
 	\item Execution Mode: synchronous or asynchronous.
 \end{itemize}
 
-\textbf{Table 1}
-
-\textit{{\scriptsize 2 clusters X 50 nodes}}
-\includegraphics[width=209pt]{img-1.eps}
-
-\textbf{Table 2}
-
-\textit{{\scriptsize 3 clusters X 33 n\oe{}uds}}
-\includegraphics[width=209pt]{img-1.eps}
-\textbf{Table 3}
-
-\textit{{\scriptsize 3 clusters X 67 noeuds}}
-\includegraphics[width=128pt]{img-2.eps}
+\begin{table}
+  \centering
+  \caption{2 clusters X 50 nodes}
+  \label{tab.cluster.2x50}
+  \includegraphics[width=209pt]{img-1.eps}
+\end{table}
+
+\begin{table}
+  \centering
+  \caption{3 clusters X 33 n\oe{}uds}
+  \label{tab.cluster.3x33}
+  \includegraphics[width=209pt]{img-1.eps}
+\end{table}
+
+\begin{table}
+  \centering
+  \caption{3 clusters X 67 noeuds}
+  \label{tab.cluster.3x67}
+  \includegraphics[width=128pt]{img-2.eps}
+\end{table}
 
 {\raggedright
 \textbf{Interpretations and comments}
@@ -529,14 +517,14 @@ lat latency , ... ).
 
 {\raggedright
 After analyzing the outputs, generally, for the configuration with two or three
-clusters including one hundred hosts (Tables 1 and 2), some combinations of the
+clusters including one hundred hosts (Tables~\ref{tab.cluster.2x50} and~\ref{tab.cluster.3x33}), some combinations of the
 used parameters affecting the results have given a speedup less than 1, showing
 the effectiveness of the asynchronous performance compared to the synchronous
 mode.
 }
 
 {\raggedright
-In the case of a two clusters configuration, Table 1 shows that with a
+In the case of a two clusters configuration, Table~\ref{tab.cluster.2x50} shows that with a
 deterioration of inter cluster network set with 5 Mbits/s of bandwidth, a latency
 in order of a hundredth of a millisecond and a system power of one GFlops, an
 efficiency of about 40\% in asynchronous mode is obtained for a matrix size of 62
@@ -551,7 +539,7 @@ side elements .
 }
 
 {\raggedright
-For the 3 clusters architecture including a total of 100 hosts, Table 2 shows
+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 which gives an efficiency of
 asynchronous below 80 \%. Indeed, for a matrix size of 62 elements, equality
 between the performance of the two modes (synchronous and asynchronous) is
@@ -563,7 +551,7 @@ necessary to degrade the inter cluster network bandwidth from 5 to 2 Mbit/s.
 {\raggedright
 A last attempt was made for a configuration of three clusters but more power
 with 200 nodes in total. The convergence with a speedup of 90 \% was obtained
-with a bandwidth of 1 Mbits/s as shown in Table 3.
+with a bandwidth of 1 Mbits/s as shown in Table~\ref{tab.cluster.3x67}.
 }
 
 \section{Conclusion}
