From: David Laiymani <david.laiymani@univ-fcomte.fr>
Date: Thu, 7 May 2015 15:50:30 +0000 (+0200)
Subject: Merge branch 'master' of ssh://bilbo.iut-bm.univ-fcomte.fr/rce2015
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/rce2015.git/commitdiff_plain/8a89c7d0f5ad8152c74c9cc31938b78e12b06a96?hp=28c087d41ba7fc0a10381aa9d9f1d9b1d48240f1

Merge branch 'master' of ssh://bilbo.iut-bm.univ-fcomte.fr/rce2015
---

diff --git a/paper.tex b/paper.tex
index 5122a84..e6bf766 100644
--- a/paper.tex
+++ b/paper.tex
@@ -878,7 +878,29 @@ geographically distant clusters through the internet.
 
 
 \section{Conclusion}
-CONCLUSION
+
+In this paper we have presented the simulation of the execution of three
+different parallel solvers on some multi-core architectures. We have show that
+the SimGrid toolkit is an interesting simulation tool that has allowed us to
+determine  which method  to choose  given a  specified multi-core  architecture.
+Moreover the simulated results are in accordance (i.e. with the same order of
+magnitude)  with the works  presented in~\cite{couturier15}. Simulated   results
+also  confirm  the   efficiency  of  the asynchronous  multisplitting
+algorithm  compared  to  the   synchronous  GMRES especially in case of
+geographically distant clusters.
+
+These results are important since it is very  time consuming to find optimal
+configuration  and deployment requirements for a given application  on   a given
+multi-core  architecture. Finding   good  resource allocations policies under
+varying CPU power, network speeds and  loads is very challenging and  labor
+intensive. This problematic is  even more difficult  for the  asynchronous
+scheme where  a small parameter variation of the execution platform and of the
+application data can lead to very different numbers of iterations to reach the
+converge and so to very different execution times.
+
+
+Our future works...
+
 
 
 %\section*{Acknowledgment}