X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper2.git/blobdiff_plain/cebad47898c16e7229d945e3a8fe361d18316cb4..de1136ccefae31eda903086fc7310086c7a0ed57:/paper.tex

diff --git a/paper.tex b/paper.tex
index 9733c3d..2d47f22 100644
--- a/paper.tex
+++ b/paper.tex
@@ -109,7 +109,8 @@ In this paper we propose the parallelization of Ehrlich-Aberth method which has
 \item The parallel implementation of Ehrlich-Aberth algorithm on a multi-GPU platform with a distributed memory using MPI API, such that each GPU is attached and managed by a MPI process. The GPUs exchange their data by message-passing communications. 
  \end{itemize}
 This latter approach is more used on clusters to solve very complex problems that are too large for traditional supercomputers, which are very expensive to build and run.
-\LZK{Pas d'autres contributions possibles? J'ai supprimÃ© les deux premiers points proposÃ©s prÃ©cÃ©demment.}
+\LZK{Pas d'autres contributions possibles? J'ai supprimÃ© les deux premiers points proposÃ©s prÃ©cÃ©demment.
+\AS{La rÃ©solution du problÃ¨me pour des polynomes pleins de degrÃ© 6M est une contribution aussi Ã  mon avis}}
 
 The paper is organized as follows. In Section~\ref{sec2} we present three different parallel programming models OpenMP, MPI and CUDA. In Section~\ref{sec3} we present the implementation of the Ehrlich-Aberth algorithm on a single GPU. In Section~\ref{sec4} we present the parallel implementations of the Ehrlich-Aberth algorithm on multiple GPUs using the OpenMP and MPI approaches. In section~\ref{sec5} we present our experiments and discuss them. Finally, Section~\ref{sec6} concludes this paper and gives some hints for future research directions in this topic. 
 
