X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/blobdiff_plain/9db72b31bc5ae56df6c06f94f031aeb35876dd01..0d3de76a4d7b1dae39911fa91801f25f009d3cf9:/hpcc.tex diff --git a/hpcc.tex b/hpcc.tex index 2e791d7..5e4bea6 100644 --- a/hpcc.tex +++ b/hpcc.tex @@ -8,7 +8,6 @@ \usepackage{algpseudocode} %\usepackage{amsthm} \usepackage{graphicx} -%\usepackage{xspace} \usepackage[american]{babel} % Extension pour les liens intra-documents (tagged PDF) % et l'affichage correct des URL (commande \url{http://example.com}) @@ -22,6 +21,11 @@ \renewcommand*\npunitcommand[1]{\text{#1}} \npthousandthpartsep{}} +\usepackage{xspace} +\usepackage[textsize=footnotesize]{todonotes} +\newcommand{\AG}[2][inline]{% + \todo[color=green!50,#1]{\sffamily\textbf{AG:} #2}\xspace} + \algnewcommand\algorithmicinput{\textbf{Input:}} \algnewcommand\Input{\item[\algorithmicinput]} @@ -35,21 +39,23 @@ \author{% \IEEEauthorblockN{% - Raphaël Couturier, - Arnaud Giersch, + Charles Emile Ramamonjisoa and David Laiymani and - Charles Emile Ramamonjisoa + Arnaud Giersch and + Lilia Ziane Khodja and + Raphaël Couturier } \IEEEauthorblockA{% Femto-ST Institute - DISC Department\\ Université de Franche-Comté\\ Belfort\\ - Email: \email{raphael.couturier@univ-fcomte.fr} + Email: \email{{raphael.couturier,arnaud.giersch,david.laiymani,charles.ramamonjisoa}@univ-fcomte.fr} } } \maketitle +\AG{Ordre des autheurs pas définitif} \begin{abstract} The abstract goes here. \end{abstract} @@ -71,13 +77,13 @@ iterations ($X_{n +1} = f(X_{n})$) from an initial value $X_{0}$ to find an approximate value $X^*$ of the solution with a very low residual error. Several well-known methods demonstrate the convergence of these algorithms. Generally, to reduce the complexity and the -execution time, the problem is divided into several "pieces" that will +execution time, the problem is divided into several \emph{pieces} that will be solved in parallel on multiple processing units. The latter will communicate each intermediate results before a new iteration starts until the approximate solution is reached. These distributed parallel -computations can be performed either in "synchronous" communication mode +computations can be performed either in \emph{synchronous} communication mode where a new iteration begin only when all nodes communications are -completed, either "asynchronous" mode where processors can continue +completed, either \emph{asynchronous} mode where processors can continue independently without or few synchronization points. Despite the effectiveness of iterative approach, a major drawback of the method is the requirement of huge resources in terms of computing capacity, @@ -224,7 +230,7 @@ A priori, obtaining a speedup less than 1 would be difficult in a local area network configuration where the synchronous mode will take advantage on the rapid exchange of information on such high-speed links. Thus, the methodology adopted was to launch the application on clustered network. In this last configuration, -degrading the inter-cluster network performance will "penalize" the synchronous +degrading the inter-cluster network performance will \emph{penalize} the synchronous mode allowing to get a speedup lower than 1. This action simulates the case of clusters linked with long distance network like Internet. @@ -270,6 +276,7 @@ lat latency, \dots{}). \centering \caption{2 clusters X 50 nodes} \label{tab.cluster.2x50} + \AG{Les images manquent dans le dépôt Git. Si ce sont vraiment des tableaux, utiliser un format vectoriel (eps ou pdf), et surtout pas de jpeg!} \includegraphics[width=209pt]{img1.jpg} \end{table} @@ -277,6 +284,7 @@ lat latency, \dots{}). \centering \caption{3 clusters X 33 nodes} \label{tab.cluster.3x33} + \AG{Le fichier manque.} \includegraphics[width=209pt]{img2.jpg} \end{table} @@ -284,6 +292,7 @@ lat latency, \dots{}). \centering \caption{3 clusters X 67 nodes} \label{tab.cluster.3x67} + \AG{Le fichier manque.} % \includegraphics[width=160pt]{img3.jpg} \includegraphics[scale=0.5]{img3.jpg} \end{table}