X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/blobdiff_plain/b13fc7fa257018cdf2c847b8aace0b386e38d166..f85fa60f36ab8e5b94e91ce13cdb1b283274d991:/hpcc.tex?ds=inline diff --git a/hpcc.tex b/hpcc.tex index 3d861f3..dc68db9 100644 --- a/hpcc.tex +++ b/hpcc.tex @@ -332,7 +332,7 @@ shared memory used by threads simulating each computing units in the Simgrid arc also to be reviewed. Finally, some compilation errors on MPI\_waitall and MPI\_Finalise primitives have been fixed with the latest version of Simgrid. In total, the initial MPI program running on the simulation environment SMPI gave after a very simple adaptation the same results as those obtained in a real environment. We have tested in synchronous mode with a simulated platform starting from a modest 2 or 3 clusters grid to a larger configuration like simulating -Grid5000 with more than 1500 hosts with 5000 cores [?]. Once the code debugging and adaptation were complete, the next section shows our methodology and experimental +Grid5000 with more than 1500 hosts with 5000 cores~\cite{bolze2006grid}. Once the code debugging and adaptation were complete, the next section shows our methodology and experimental results. @@ -554,7 +554,6 @@ computers organized with interconnected clusters have been presented. Our work has demonstrated that using such a simulation tool allow us to reach the following three objectives: -\newcounter{numberedCntD} \begin{enumerate} \item To have a flexible configurable execution platform resolving the hard exercise to access to very limited but so solicited physical @@ -564,7 +563,6 @@ iteration number ; \item and finally and more importantly, to find the correct combination of the cluster and network specifications permitting to save time in executing the algorithm in asynchronous mode. -\setcounter{numberedCntD}{\theenumi} \end{enumerate} Our results have shown that in certain conditions, asynchronous mode is speeder up to \np[\%]{40} than executing the algorithm in synchronous mode