X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/blobdiff_plain/85bdede0dce3662616d21678eafc402be648bb87..abc7ee50fcd018c2c756f80d084b182a712b245e:/hpcc.tex?ds=sidebyside

diff --git a/hpcc.tex b/hpcc.tex
index aeafb67..622a2f0 100644
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -707,17 +707,18 @@ of the cluster and network specifications permitting to save time in
 executing the algorithm in asynchronous mode.
 \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
+speeder up to \np[\%]{40} comparing to the synchronous GMRES method
 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 
+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. 
 
-\LZK{Perspectives???}
+For our futur works, we plan to extend our experimentations to larger scale platforms by increasing the number of computing cores and the number of clusters. 
+We will also have to increase the size of the input problem which will require the use of a more powerful simulation platform. At last, we expect to compare our simulation results to real execution results on real architectures in order to experimentally validate our study.
 
 \section*{Acknowledgment}
 
