From dea60eccf9392a4db51bae0ae16bbabc4203facb Mon Sep 17 00:00:00 2001
From: Kahina <kahina@kahina-VPCEH3K1E.(none)>
Date: Tue, 3 Nov 2015 13:16:15 +0100
Subject: [PATCH 1/1] Conclusion
---
paper.tex | 11 ++++++++---
1 file changed, 8 insertions(+), 3 deletions(-)
diff --git a/paper.tex b/paper.tex
index 694ae43..d2016d1 100644
--- a/paper.tex
+++ b/paper.tex
@@ -746,14 +746,19 @@ This figure show the execution time of the both algorithm EA and DK with sparse
%\subsubsection{The execution time of Ehrlich-Aberth algorithm on OpenMP(1 core, 4 cores) vs. on a Tesla GPU}
+\section{Conclusion and perspective}
+\label{sec7}
+In this paper we have presented the parallel implementation Ehrlich-Aberth method on GPU and on CPU (openMP) for the problem of finding roots polynomial. Moreover, we have improved the classical Ehrlich-Aberth method witch suffer of overflow problems, the exp.log solution applying to the iterative function to resolve high degree polynomial.
+Then, we have described the parallel implementation of the Ehrlich-Aberth algorithm on GPU.
+We have performed some experiments on Ehrlich-Aberth algorithm in CPU and GPU from the both sparse and full polynomial. These experiments lead us to conclude that the iterative methods using data-parallel operations are more efficient on the GPU than on the CPU. Moreover, the experiment showed that Ehrlich-Aberth algorithm on GPU converge from the both sparse and full polynomials with precision of $10^{-7}$ and the execution time very faster than the CPU version.
+The experiences showed that the improvement brought to Ehrlich-Aberth allows to resolve very large degree polynomial exceed 100,000.
+Finally, we have compared Ehrlich-Aberth algorithm to Durand-Kerner algorithm, we have conclude that Ehrlich-Aberth converges more quickly than Durand-Kerner in execution time, it is due in fact that Ehrlich-Aberth has cubic one convergence While Durand-Kerner is quadratic. In counterpart, the execution time per iteration are very low for Durand-Kerner algorithm compare to the Ehrlich-Aberth algorithm, consequently, it need lot of iterations to converge. We have to notice that Durand-Kerner does not converge for full polynomial which exceed 5000 degrees while Ehrlich-Aberth was able to solve full polynomial of degree 500,000.
+In future work, we plan to perform some experiments using several GPU with a cluster of GPU. So it is interesting to implement algorithms using at least two forms of parallelism on GPU and CPU.
-\section{Conclusion and perspective}
-
-\label{sec7}
\bibliography{mybibfile}
\end{document}
--
2.39.5