From: RCE <cramamonjisoa@bilbo.iut-bm.univ-fcomte.fr>
Date: Sun, 13 Apr 2014 21:44:49 +0000 (+0200)
Subject: Ajout de sections
X-Git-Tag: hpcc2014_submission~122
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/commitdiff_plain/8b34ea2b1bad6b4287c588f79dab03ee382b66a8

Ajout de sections

1) Abstract
2) Conclusion
---

diff --git a/hpcc.tex b/hpcc.tex
index 47d8102..207c560 100644
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -64,7 +64,35 @@
 \RC{Ordre des autheurs pas définitif.}
 \LZK{Adresse de Lilia: Inria Bordeaux Sud-Ouest, 200 Avenue de la Vieille Tour, 33405 Talence Cedex, France \\ Email: lilia.ziane@inria.fr}
 \begin{abstract}
-The abstract goes here.
+ABSTRACT
+
+In recent years, the scalability of large-scale implementation in a 
+distributed environment of algorithms becoming more and more complex has 
+always been hampered by the limits of physical computing resources 
+capacity. One solution is to run the program in a virtual environment 
+simulating a real interconnected computers architecture. The results are 
+convincing and useful solutions are obtained with far fewer resources 
+than in a real platform. However, challenges remain for the convergence 
+and efficiency of a class of algorithms that concern us here, namely 
+numerical parallel iterative algorithms executed in asynchronous mode, 
+especially in a large scale level. Actually, such algorithm requires a 
+balance and a compromise between computation and communication time 
+during the execution. Two important factors determine the success of the 
+experimentation: the convergence of the iterative algorithm on a large 
+scale and the execution time reduction in asynchronous mode. Once again, 
+from the current work, a simulated environment like Simgrid provides 
+accurate results which are difficult or even impossible to obtain in a 
+physical platform by exploiting the flexibility of the simulator on the 
+computing units clusters and the network structure design. Our 
+experimental outputs showed a saving of up to 40 \% for the algorithm 
+execution time in asynchronous mode compared to the synchronous one with 
+a residual precision up to E-11. Such successful results open 
+perspectives on experimentations for running the algorithm on a 
+simulated large scale growing environment and with larger problem size. 
+
+Keywords : Algorithm distributed iterative asynchronous simulation 
+simgrid
+
 \end{abstract}
 
 \section{Introduction}
@@ -349,11 +377,41 @@ achieved with an inter cluster of \np[Mbits/s]{10} and a latency of \np{E-1} ms.
 challenge an efficiency by \np[\%]{78} with a matrix size of 100 points, it was
 necessary to degrade the inter cluster network bandwidth from 5 to 2 Mbit/s.
 
-A last attempt was made for a configuration of three clusters but more power
+A last attempt was made for a configuration of three clusters but more powerful
 with 200 nodes in total. The convergence with a speedup of \np[\%]{90} was obtained
 with a bandwidth of \np[Mbits/s]{1} as shown in Table~\ref{tab.cluster.3x67}.
 
 \section{Conclusion}
+CONCLUSION
+
+The experimental results on executing a parallel iterative algorithm in 
+asynchronous mode on an environment simulating a large scale of virtual 
+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 
+resources;
+\item to ensure the algorithm convergence with a raisonnable time and 
+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 40 \% than executing the algorithm in synchronous mode 
+which is not negligible for solving complex practical problems with more 
+and more increasing size.
+
+ Several studies have already addressed the performance execution time of 
+this class of algorithm. The work presented in this paper has 
+demonstrated an original solution to optimize the use of a simulation 
+tool to run efficiently an iterative parallel algorithm in asynchronous 
+mode in a grid architecture. 
 
 \section*{Acknowledgment}