X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper2.git/blobdiff_plain/2bf774646b9314d29be9cbe5d5e6771c391ae7c7..ebc3cd7d745664101ef0a6988b3c5164c260b917:/paper.tex?ds=inline

diff --git a/paper.tex b/paper.tex
index 81a5e46..bae5b94 100644
--- a/paper.tex
+++ b/paper.tex
@@ -178,7 +178,7 @@
 
 % *** SPECIALIZED LIST PACKAGES ***
 %
-\usepackage{algorithmic}
+
 % algorithmic.sty was written by Peter Williams and Rogerio Brito.
 % This package provides an algorithmic environment fo describing algorithms.
 % You can use the algorithmic environment in-text or within a figure
@@ -328,7 +328,10 @@
   \todo[color=red!10,#1]{\sffamily\textbf{LZK:} #2}\xspace}
 \newcommand{\RC}[2][inline]{%
   \todo[color=blue!10,#1]{\sffamily\textbf{RC:} #2}\xspace}
-
+\newcommand{\KG}[2][inline]{%
+  \todo[color=green!10,#1]{\sffamily\textbf{KG:} #2}\xspace}
+\newcommand{\AS}[2][inline]{%
+  \todo[color=orange!10,#1]{\sffamily\textbf{AS:} #2}\xspace}
 
 
 
@@ -347,22 +350,16 @@
 % author names and affiliations
 % use a multiple column layout for up to three different
 % affiliations
-\author{\IEEEauthorblockN{Michael Shell}
-\IEEEauthorblockA{School of Electrical and\\Computer Engineering\\
-Georgia Institute of Technology\\
-Atlanta, Georgia 30332--0250\\
-Email: http://www.michaelshell.org/contact.html}
+\author{\IEEEauthorblockN{Kahina Guidouche, Abderrahmane Sider }
+  \IEEEauthorblockA{Laboratoire LIMED\\
+    Faculté des sciences exactes\\
+    Université de Bejaia, 06000, Algeria\\
+Email: \{kahina.ghidouche,ar.sider\}@univ-bejaia.dz}
 \and
-\IEEEauthorblockN{Homer Simpson}
-\IEEEauthorblockA{Twentieth Century Fox\\
-Springfield, USA\\
-Email: homer@thesimpsons.com}
-\and
-\IEEEauthorblockN{James Kirk\\ and Montgomery Scott}
-\IEEEauthorblockA{Starfleet Academy\\
-San Francisco, California 96678--2391\\
-Telephone: (800) 555--1212\\
-Fax: (888) 555--1212}}
+\IEEEauthorblockN{Lilia Ziane Khodja, Raphaël Couturier}
+\IEEEauthorblockA{FEMTO-ST Institute\\
+  University of   Bourgogne Franche-Comte, France\\
+Email: zianekhodja.lilia@gmail.com\\ raphael.couturier@univ-fcomte.fr}}
 
 % conference papers do not typically use \thanks and this command
 % is locked out in conference mode. If really needed, such as for
@@ -411,10 +408,11 @@ using different parallel paradigms: OpenMP or MPI. The experiments
 show a quasi-linear speedup by using up-to 4 GPU devices compared to 1
 GPU to find roots of polynomials of degree up-to 1.4
 million. Moreover, other experiments show it is possible to find roots
-of polynomials of degree up to 5 millions.
+of polynomials of degree up-to 5 millions.
 \end{abstract}
 
 % no keywords
+\LZK{Faut pas mettre des keywords?}
 
 
 
@@ -443,7 +441,7 @@ of polynomials of degree up to 5 millions.
 
 Finding roots of polynomials of very high degrees arises in many complex problems in various domains such as algebra, biology or physics. A polynomial $p(x)$ in $\mathbb{C}$ in one variable $x$ is an algebraic expression in $x$ of the form:
 \begin{equation}
-p(x) = \displaystyle\sum^n_{i=0}{a_ix^i},a_n\neq 0. 
+p(x) = \displaystyle\sum^n_{i=0}{a_ix^i},a_n\neq 0, 
 \end{equation}
 where $\{a_i\}_{0\leq i\leq n}$ are complex coefficients and $n$ is a high integer number. If $a_n\neq0$ then $n$ is called the degree of the polynomial. The root-finding problem consists in finding the $n$ different values of the unknown variable $x$ for which $p(x)=0$. Such values are called roots of $p(x)$. Let $\{z_i\}_{1\leq i\leq n}$ be the roots of polynomial $p(x)$, then $p(x)$ can be written as :
 \begin{equation}
@@ -493,11 +491,11 @@ of parallelization for a shared memory architecture with OpenMP and
 for a distributed memory one with MPI. They are able to compute the
 roots of sparse polynomials of degree 10,000 in 116 seconds with
 OpenMP and 135 seconds with MPI only by using 8 personal computers and
-2 communications per iteration. \RC{si on donne des temps faut donner
-  le proc, comme c'est vieux à mon avis faut supprimer ca, votre avis?} The authors showed an interesting
+2 communications per iteration. The authors showed an interesting
 speedup comparing to the sequential implementation which takes up-to
 3,300 seconds to obtain same results. 
-\LZK{``only by using 8 personal computers and 2 communications per iteration''. Pour MPI? et Pour OpenMP: Rep: c'est MPI seulement}
+\RC{si on donne des temps faut donner le proc, comme c'est vieux à mon avis faut supprimer ca, votre avis?} 
+\LZK{Supprimons ces détails et mettons une référence s'il y en a une}
 
 Very few work had been performed since then until the appearing of the Compute Unified Device Architecture (CUDA)~\cite{CUDA15}, a parallel computing platform and a programming model invented by NVIDIA. The computing power of GPUs (Graphics Processing Units) has exceeded that of traditional processors CPUs. However, CUDA adopts a totally new computing architecture to use the hardware resources provided by the GPU in order to offer a stronger computing ability to the massive data computing. Ghidouche et al.~\cite{Kahinall14} proposed an implementation of the Durand-Kerner method on a single GPU. Their main results showed that a parallel CUDA implementation is about 10 times faster than the sequential implementation on a single CPU for sparse polynomials of degree 48,000.
 
@@ -505,19 +503,22 @@ Very few work had been performed since then until the appearing of the Compute U
 %\LZK{Cette partie est réécrite. \\ Sinon qu'est ce qui a été fait pour l'accuracy dans ce papier (Finding polynomial roots rapidly and accurately is the main objective of our work.)?}
 %\LZK{Les contributions ne sont pas définies !!}
 
-In this paper we propose the parallelization of Ehrlich-Aberth method using two parallel programming paradigms OpenMP and MPI on CUDA multi-GPU platforms. Our CUDA/MPI and CUDA/OpenMP codes are the first implementations of Ehrlich-Aberth method with multiple GPUs for finding roots of polynomials. Our major contributions include:
-\LZK{Pourquoi la méthode Ehrlich-Aberth et pas autres? the Ehrlich-Aberth have very good convergence  and it is suitable to be implemented in parallel computers.}
+%In this paper we propose the parallelization of Ehrlich-Aberth method using two parallel programming paradigms OpenMP and MPI on CUDA multi-GPU platforms. Our CUDA-MPI and CUDA-OpenMP codes are the first implementations of Ehrlich-Aberth method with multiple GPUs for finding roots of polynomials. Our major contributions include:
+%\LZK{Pourquoi la méthode Ehrlich-Aberth et pas autres? the Ehrlich-Aberth have very good convergence  and it is suitable to be implemented in parallel computers.}
+In this paper we propose the parallelization of Ehrlich-Aberth method which has a good convergence and it is suitable to be implemented in parallel computers. We use two parallel programming paradigms OpenMP and MPI on CUDA multi-GPU platforms. Our CUDA-MPI and CUDA-OpenMP codes are the first implementations of Ehrlich-Aberth method with multiple GPUs for finding roots of polynomials. Our major contributions include:
+\LZK{J'ai ajouté une phrase pour justifier notre choix de la méthode Ehrlich-Aberth. A revérifier.}
  \begin{itemize}
- \item An improvements for the Ehrlich-Aberth method using the exponential logarithm in order to be able to solve sparse and full polynomial of degree up to 1, 000, 000.\RC{j'ai envie de virer ca, car c'est pas la nouveauté dans ce papier}
- \item A parallel implementation of Ehrlich-Aberth method on single GPU with CUDA.\RC{idem}
+ %\item An improvements for the Ehrlich-Aberth method using the exponential logarithm in order to be able to solve sparse and full polynomial of degree up to 1, 000, 000.\RC{j'ai envie de virer ca, car c'est pas la nouveauté dans ce papier}
+ %\item A parallel implementation of Ehrlich-Aberth method on single GPU with CUDA.\RC{idem}
 \item The parallel implementation of Ehrlich-Aberth algorithm on a multi-GPU platform with a shared memory using OpenMP API. It is based on threads created from the same system process, such that each thread is attached to one GPU. In this case the communications between GPUs are done by OpenMP threads through shared memory.
-\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. 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.
+\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}
-\LZK{Pas d'autres contributions possibles?: j'ai rajouté 2}
+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.}
 
 %This paper is organized as follows. In Section~\ref{sec2} we recall the Ehrlich-Aberth method. In section~\ref{sec3} we present EA algorithm on single GPU. In section~\ref{sec4} we propose the EA algorithm implementation on Multi-GPU for (OpenMP-CUDA) approach and (MPI-CUDA) approach. In sectioné\ref{sec5} we present our experiments and discus it. Finally, Section~\ref{sec6} concludes this paper and gives some hints for future research directions in this topic.}
 
-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 Multi-GPU using the OpenMP and MPI approaches. In section\ref{sec5} we present our experiments and discus it. Finally, Section~\ref{sec6} concludes this paper and gives some hints for future research directions in this topic. 
+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. 
 %\LZK{A revoir toute cette organization: je viens de la revoir}
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
@@ -657,153 +658,169 @@ CUDA (Compute Unified Device Architecture) is a parallel computing architecture
 The Ehrlich-Aberth method is a simultaneous method~\cite{Aberth73} using the following iteration
 \begin{equation}
 \label{Eq:EA1}
-EA: z^{k+1}_{i}=z_{i}^{k}-\frac{\frac{p(z_{i}^{k})}{p'(z_{i}^{k})}}
-{1-\frac{p(z_{i}^{k})}{p'(z_{i}^{k})}\sum_{j=1,j\neq i}^{j=n}{\frac{1}{(z_{i}^{k}-z_{j}^{k})}}}, i=1,. . . .,n
+z^{k+1}_{i}=z_{i}^{k}-\frac{\frac{p(z_{i}^{k})}{p'(z_{i}^{k})}}
+{1-\frac{p(z_{i}^{k})}{p'(z_{i}^{k})}\sum_{j=1,j\neq i}^{j=n}{\frac{1}{(z_{i}^{k}-z_{j}^{k})}}}, i=1,\ldots,n
 \end{equation}
 
-This methods contains 4 steps. The first step consists of the initial
-approximations of all the roots of the polynomial. The second step
-initializes the solution vector $Z$ using the Guggenheimer
-method~\cite{Gugg86} to ensure the distinction of the initial vector
-roots. In step 3, the iterative function based on the Newton's
-method~\cite{newt70} and Weiestrass operator~\cite{Weierstrass03} is
-applied. With this step the computation of roots will converge,
-provided that all roots are different.
-
-
-In order to stop the iterative function, a stop condition is
-applied. This condition checks that all the root modules are lower
-than a fixed value $\xi$.
+This method contains 4 steps. The first step consists in the initializing the polynomial. The second step initializes the solution vector $Z$ using the Guggenheimer method~\cite{Gugg86} to ensure that initial roots are all distinct from each other. In step 3, the iterative function based on the Newton's method~\cite{newt70} and Weiestrass operator~\cite{Weierstrass03} is applied. In our case, the Ehrlich-Aberth is applied as in~(\ref{Eq:EA1}). Iterations of the Ehrlich-Aberth method will converge to the roots of the considered polynomial. In order to stop the iterative function, a stop condition is applied, this is the 4th step. This condition checks that all the root modules are lower than a fixed value $\epsilon$.
 
 \begin{equation}
 \label{eq:Aberth-Conv-Cond}
-\forall i \in [1,n];\vert\frac{z_{i}^{k}-z_{i}^{k-1}}{z_{i}^{k}}\vert<\xi
+\forall i\in[1,n],~\vert\frac{z_i^k-z_i^{k-1}}{z_i^k}\vert<\epsilon
 \end{equation}
+
 \subsection{Improving Ehrlich-Aberth method}
-With high degree polynomials, the Ehrlich-Aberth method suffers from
-floating point overflows due to the mantissa of floating points
-representations. This induces errors in the computation of $p(z)$ when
-$z$ is large.
+With high degree polynomials, the Ehrlich-Aberth method suffers from floating point overflows due to the mantissa of floating points representations. This induces errors in the computation of $p(z)$ when $z$ is large.
  
-Experimentally, it is very difficult to solve polynomials with Ehrlich-Aberth method and have roots which except the circle of unit, represented by the radius $r$ evaluated as: 
-
-\begin{equation}
-\label{R.EL}
-R = exp(log(DBL\_MAX)/(2*n) );
-\end{equation}
-
+%Experimentally, it is very difficult to solve polynomials with the Ehrlich-Aberth method and have roots which except the circle of unit, represented by the radius $r$ evaluated as: 
 
 %\begin{equation}
-
-%R = \exp( \log(DBL\_MAX) / (2*n) )
+%\label{R.EL}
+%R = exp(log(DBL\_MAX)/(2*n) );
 %\end{equation}
- where \verb=DBL_MAX= stands for the maximum representable \verb=double= value.
- 
-In order to hold into account the limit of size of floats, we propose to modifying the iterative function and compute the logarithm of:
 
-\begin{equation}
-EA: z^{k+1}_{i}=z_{i}^{k}-\frac{\frac{p(z_{i}^{k})}{p'(z_{i}^{k})}}
-{1-\frac{p(z_{i}^{k})}{p'(z_{i}^{k})}\sum_{j=1,j\neq i}^{j=n}{\frac{1}{(z_{i}^{k}-z_{j}^{k})}}}, i=1,. . . .,n
-\end{equation}
 
-This method allows, indeed, to exceed the computation of the polynomials of degree 100,000 and to reach a degree upper to 1,000,000. For that purpose, it is necessary to use the logarithm and the exponential of a complex. The iterative  function of Ehrlich-Aberth method with exponential and logarithm is given as following:
+
+% where \verb=DBL_MAX= stands for the maximum representable \verb=double= value.
+ 
+In order to solve this problem, we propose to modify the iterative
+function by using the logarithm and the exponential of a complex and
+we propose a new version of the Ehrlich-Aberth method.  This method
+allows us to exceed the computation of the polynomials of degree
+100,000 and to reach a degree up to more than 1,000,000. The reformulation of the iteration~(\ref{Eq:EA1}) of the Ehrlich-Aberth method with exponential and logarithm is defined as follows, for $i=1,\dots,n$:
 
 \begin{equation}
 \label{Log_H2}
-z^{k+1}_{i}=z_{i}^{k}-\exp \left(\ln \left(
-p(z_{i}^{k})\right)-\ln\left(p'(z^{k}_{i})\right)- \ln\left(1-Q(z^{k}_{i})\right)\right),
+z^{k+1}_i = z_i^k - \exp(\ln(p(z_i^k)) - \ln(p'(z^k_i)) - \ln(1-Q(z^k_i))),
 \end{equation}
 
 where:
 
 \begin{equation}
 \label{Log_H1}
-Q(z^{k}_{i})=\exp\left( \ln (p(z^{k}_{i}))-\ln(p'(z^{k}_{i}))+\ln \left(
-\sum_{i\neq j}^{n}\frac{1}{z^{k}_{i}-z^{k}_{j}}\right)\right)i=1,...,n,
+Q(z^k_i) = \exp(\ln(p(z^k_i)) - \ln(p'(z^k_i)) + \ln(\sum_{i\neq j}^n\frac{1}{z^k_i-z^k_j})).
 \end{equation}
 
 
 %We propose to use the logarithm and the exponential of a complex in order to compute the power at a high exponent. 
-Using the logarithm  and the exponential operators, we can replace any multiplications and divisions with additions and subtractions. Consequently, computations manipulate lower absolute values and the roots for large polynomial degrees can be looked for successfully~\cite{Karimall98}.
+Using the logarithm  and the exponential operators, we can replace any multiplications and divisions with additions and subtractions. Consequently, computations manipulate lower values in absolute values~\cite{Karimall98}. 
 
 %This problem was discussed earlier in~\cite{Karimall98} for the Durand-Kerner method. The authors
 %propose to use the logarithm and the exponential of a complex in order to compute the power at a high exponent. Using the logarithm  and the exponential operators, we can replace any multiplications and divisions with additions and subtractions. Consequently, computations manipulate lower absolute values and the roots for large polynomial degrees can be looked for successfully~\cite{Karimall98}.
 
-\subsection{Ehrlich-Aberth parallel implementation on CUDA}
-We introduced three paradigms of parallel programming. Our objective consists in implementing a root finding polynomial algorithm on multiple GPUs. To this end, it is primordial to know how to manage CUDA contexts of different GPUs. A direct method for controlling the various GPUs is to use as many threads or processes as GPU devices. We can choose the GPU index based on the identifier of OpenMP thread or the rank of the MPI process. Both approaches will be investigated.
+\subsection{The Ehrlich-Aberth parallel implementation on CUDA}
+%We introduced three paradigms of parallel programming.
 
+Our objective consists in implementing a root finding polynomial
+algorithm on multiple GPUs. To this end, it is primordial to know how
+to manage CUDA contexts of different GPUs. A direct method for
+controlling the various GPUs is to use as many threads or processes as
+GPU devices. We can choose the GPU index based on the identifier of
+OpenMP thread or the rank of the MPI process. Both approaches will be
+investigated. \LZK{Répétition! Le même texte est déjà écrit comme
+  intro dans la section II. Sinon ici on parle seulement de
+  l'implémentation cuda sans mpi et openmp! \RC{Je suis d'accord à
+    revoir après, quand les 2 parties suivantes seront plus stables}}
 
 
 
-Like any parallel code, a GPU parallel implementation first
-requires to determine the sequential tasks and the
-parallelizable parts of the sequential version of the
-program/algorithm. In our case, all the operations that are easy
-to execute in parallel must be made by the GPU to accelerate
-the execution of the application, like the step 3 and step 4. On the other hand, all the
-sequential operations and the operations that have data
-dependencies between threads or recursive computations must
-be executed by only one CUDA or CPU thread (step 1 and step 2). Initially, we specify the organization of parallel threads, by specifying the dimension of the grid Dimgrid, the number of blocks per grid DimBlock and the number of threads per block. 
 
-The code is organized  by what is named kernels, portions code that are run on GPU devices. For step 3, there are two kernels, the
-first named \textit{save} is used to save vector $Z^{K-1}$ and the seconde one is named
-\textit{update} and is used to update the $Z^{K}$ vector. For step 4, a kernel 
-tests the convergence of the method. In order to
-compute the function H, we have two possibilities: either to use
-the Jacobi mode, or the Gauss-Seidel mode of iterating which uses the
-most recent computed roots. It is well known that the Gauss-
-Seidel mode converges more quickly. So, we used the Gauss-Seidel mode of iteration. To
-parallelize the code, we created kernels and many functions to
-be executed on the GPU for all the operations dealing with the
+Like any parallel code, a GPU parallel implementation first requires to determine the sequential code and the data-parallel operations of a algorithm. In fact, all the operations that are easy to execute in parallel must be made by the GPU to accelerate the execution, like the steps 3 and 4. On the other hand, all the sequential operations and the operations that have data dependencies between CUDA threads or recursive computations must be executed by only one CUDA thread or a CPU thread (the steps 1 and 2).\LZK{La méthode est déjà mal présentée, dans ce cas c'est encore plus difficile de comprendre que représentent ces différentes étapes!} Initially, we specify the organization of parallel threads by specifying the dimension of the grid \verb+Dimgrid+, the number of blocks per grid \verb+DimBlock+ and the number of threads per block.
+
+The code is organized as kernels which are parts of code that are run on GPU devices. For step 3, there are two kernels, the first is named \textit{save} is used to save vector $Z^{K-1}$ and the second one is
+named \textit{update} and is used to update the $Z^{K}$ vector. For
+step 4, a kernel tests the convergence of the method. In order to
+compute the function H, we have two possibilities: either to use the
+Jacobi mode, or the Gauss-Seidel mode of iterating which uses the most
+recent computed roots. It is well known that the Gauss-Seidel mode
+converges more quickly. So, we use Gauss-Seidel iterations. To
+parallelize the code, we create kernels and many functions to be
+executed on the GPU for all the operations dealing with the
 computation on complex numbers and the evaluation of the
-polynomials. As said previously, we managed both functions
-of evaluation of a polynomial: the normal method, based on
-the method of Horner and the method based on the logarithm
-of the polynomial. All these methods were rather long to
-implement, as the development of corresponding kernels with
-CUDA is longer than on a CPU host. This comes in particular
-from the fact that it is very difficult to debug CUDA running
-threads like threads on a CPU host. In the following paragraph
-Algorithm~\ref{alg1-cuda} shows the GPU parallel implementation of Ehrlich-Aberth method.
-
-\begin{enumerate}
-\begin{algorithm}[htpb]
-\label{alg1-cuda}
+polynomials. As said previously, we manage both functions of
+evaluation: the normal method, based on the method of
+Horner and the method based on the logarithm of the polynomial. All
+these methods were rather long to implement, as the development of
+corresponding kernels with CUDA is longer than on a CPU host. This
+comes in particular from the fact that it is very difficult to debug
+CUDA running threads like threads on a CPU host. In the following
+paragraph Algorithm~\ref{alg1-cuda} shows the GPU parallel
+implementation of Ehrlich-Aberth method.
+\LZK{Vaut mieux expliquer l'implémentation en faisant référence à l'algo séquentiel que de parler des différentes steps.}
+
+%\begin{algorithm}[htpb]
+%\label{alg1-cuda}
 %\LinesNumbered
-\caption{CUDA Algorithm to find roots with the Ehrlich-Aberth method}
-
-\KwIn{$Z^{0}$ (Initial root's vector), $\varepsilon$ (Error tolerance
-  threshold), P (Polynomial to solve), Pu (Derivative of P), $n$ (Polynomial degrees), $\Delta z_{max}$ (Maximum value of stop condition)}
-
-\KwOut {$Z$ (Solution root's vector), $ZPrec$ (Previous solution root's vector)}
+%\SetAlgoNoLine
+%\caption{CUDA Algorithm to find polynomial roots with the Ehrlich-Aberth method}
+%\KwIn{$Z^{0}$ (Initial vector of roots), $\epsilon$ (Error tolerance threshold), P (Polynomial to solve), Pu (Derivative of P), $n$ (Polynomial degree), $\Delta z_{max}$ (Maximum value of stop condition)}
+%\KwOut{$Z$ (Solution vector of roots)}
 
 %\BlankLine
 
-\item Initialization of P\;
-\item Initialization of Pu\;
-\item Initialization of the solution vector $Z^{0}$\;
-\item Allocate and copy initial data to the GPU global memory\;
-\item k=0\;
-\item \While {$\Delta z_{max} > \epsilon$}{
-\item   Let $\Delta z_{max}=0$\;
-\item   $ kernel\_save(ZPrec,Z)$\;
-\item   k=k+1\;
-\item   $ kernel\_update(Z,P,Pu)$\;
-\item $kernel\_testConverge(\Delta z_{max},Z,ZPrec)$\;
+%Initialization of P\; 
+%Initialization of Pu\;
+%Initialization of the solution vector $Z^{0}$\;
+%Allocate and copy initial data to the GPU global memory\;
+%\While {$\Delta z_{max} > \epsilon$}{
+%   $ ZPres=kernel\_save(Z)$\;
+%   $ Z=kernel\_update(Z,P,Pu)$\;
+% $\Delta z_{max}=kernel\_testConv(Z,ZPrec)$\;
 
+%}
+%Copy results from GPU memory to CPU memory\;
+%\end{algorithm}
+
+\begin{algorithm}[htpb]
+\LinesNumbered
+\SetAlgoNoLine
+\caption{Finding roots of polynomials with the Ehrlich-Aberth method on a GPU}
+\KwIn{$n$ (polynomial's degree), $\epsilon$ (tolerance threshold)}
+\KwOut{$Z$ (solution vector of roots)}
+Initialize the polynomial $P$ and its derivative $P'$\;
+Set the initial values of vector $Z$\;
+Copy $P$, $P'$ and $Z$ from CPU to GPU\;
+\While{\emph{not convergence}}{
+  $Z^{prev}$ = KernelSave($Z,n$)\;
+  $Z$ = KernelUpdate($P,P',Z^{prev},n$)\;
+  $\Delta Z$ = KernelComputeError($Z,Z^{prev},n$)\;
+  $\Delta Z_{max}$ = CudaMaxFunction($\Delta Z,n$)\;
+  TestConvergence($\Delta Z_{max},\epsilon$)\;
 }
-\item Copy results from GPU memory to CPU memory\;
+Copy $Z$ from GPU to CPU\;
+\label{alg1-cuda}
+\RC{Si l'algo vous convient, il faudrait le détailler précisément\LZK{J'ai modifié l'algo. Sinon, est ce qu'on doit mettre en paramètre $Z^{prev}$ ou $Z$ tout court (dans le cas où on exploite l'asynchronisme des threads cuda!) pour le Kernel\_Update? }}
 \end{algorithm}
-\end{enumerate}
-~\\ 
-
 
  
 \section{The EA algorithm on Multiple GPUs}
 \label{sec4}
-\subsection{M-GPU : an OpenMP-CUDA approach}
-Our OpenMP-CUDA implementation of EA algorithm is based on the hybrid OpenMP and CUDA programming model. It works as follows.
-Based on the metadata, a shared memory is used to make data evenly shared among OpenMP threads. The shared data are the solution vector $Z$, the polynomial to solve $P$, and  the error vector $\Delta z$. Let (T\_omp) the number of OpenMP threads be equal to the number of GPUs, each OpenMP thread binds to one GPU,  and controls a part of the shared memory, that is a part of the vector Z , that is $(n/num\_gpu)$ roots where $n$ is the polynomial's degree and $num\_gpu$ the total number of available GPUs. Each OpenMP thread copies its data from host memory to GPU’s device memory. Then every GPU will have a grid of computation organized according to the device performance and the size of data on which it runs the computation kernels. %In principle a grid is set by two parameter DimGrid, the number of block per grid, DimBloc: the number of threads per block. The following schema  shows the architecture of (CUDA,OpenMP).
+\subsection{an OpenMP-CUDA approach}
+Our OpenMP-CUDA implementation of EA algorithm is based on the hybrid
+OpenMP and CUDA programming model.  All the data are shared with
+OpenMP amoung all the OpenMP threads. The shared data are the solution
+vector $Z$, the polynomial to solve $P$, and the error vector $\Delta
+z$. The number of OpenMP threads is equal to the number of GPUs, each
+OpenMP thread binds to one GPU, and it controls a part of the shared
+memory. More precisely each OpenMP thread will be responsible to
+update its owns part of the vector Z. This part is call $Z_{loc}$ in
+the following. Then all GPUs will have a grid of computation organized
+according to the device performance and the size of data on which it
+runs the computation kernels.
+
+To compute one iteration of the EA method each GPU performs the
+followings steps. First roots are shared with OpenMP and the
+computation of the local size for each GPU is performed (lines 5-7 in
+Algo\ref{alg2-cuda-openmp}). Each thread starts by copying all the
+previous roots inside its GPU (line 9). Then each GPU will copy the
+previous roots (line 10) and it will compute an iteration of the EA
+method on its own roots (line 11).  For that all the other roots are
+used. The convergence is checked on the new roots (line 12). At the end
+of an iteration, the updated roots are copied from the GPU to the
+CPU (line 14) by direcly updating its own roots in the shared memory
+arrays containing all the roots.
+
+%In principle a grid is set by two parameter DimGrid, the number of block per grid, DimBloc: the number of threads per block. The following schema  shows the architecture of (CUDA,OpenMP).
 
 %\begin{figure}[htbp]
 %\centering
@@ -813,47 +830,88 @@ Based on the metadata, a shared memory is used to make data evenly shared among
 %\end{figure}
 %Each thread OpenMP compute the kernels on GPUs,than after each iteration they copy out the data from GPU memory to CPU shared memory. The kernels are re-runs is up to the roots converge sufficiently. Here are below the corresponding algorithm:
 
-$num\_gpus$ OpenMP threads  are created using \verb=omp_set_num_threads();=function (step $3$, Algorithm \ref{alg2-cuda-openmp}), the shared memory is created using \verb=#pragma omp parallel shared()= OpenMP function (line $5$, Algorithm\ref{alg2-cuda-openmp}), then each OpenMP thread allocates memory and copies initial data from CPU memory to GPU global memory, executes the kernels on GPU, but computes only his portion of roots indicated with variable \textit{index} initialized in (line 5, Algorithm \ref{alg2-cuda-openmp}), used as input data in the $kernel\_update$ (line 10, Algorithm \ref{alg2-cuda-openmp}). After each iteration, all OpenMP threads synchronize using \verb=#pragma omp barrier;= to gather all the correct values of $\Delta z$, thus allowing the computation the maximum stop condition on vector $\Delta z$ (line 12, Algorithm \ref{alg2-cuda-openmp}). Finally, threads copy the results from GPU memories to CPU memory. The OpenMP threads execute kernels until the roots sufficiently converge.  
-\begin{enumerate}
+%% \RC{Surement à virer ou réécrire pour etre compris sans algo}
+%% $num\_gpus$ OpenMP threads  are created using
+%% \verb=omp_set_num_threads();=function (step $3$, Algorithm
+%% \ref{alg2-cuda-openmp}), the shared memory is created using
+%% \verb=#pragma omp parallel shared()= OpenMP function (line $5$,
+%% Algorithm\ref{alg2-cuda-openmp}), then each OpenMP thread allocates
+%% memory and copies initial data from CPU memory to GPU global memory,
+%% executes the kernels on GPU, but computes only his portion of roots
+%% indicated with variable \textit{index} initialized in (line 5,
+%% Algorithm \ref{alg2-cuda-openmp}), used as input data in the
+%% $kernel\_update$ (line 10, Algorithm \ref{alg2-cuda-openmp}). After
+%% each iteration, all OpenMP threads synchronize using
+%% \verb=#pragma omp barrier;= to gather all the correct values of
+%% $\Delta z$, thus allowing the computation the maximum stop condition
+%% on vector $\Delta z$ (line 12, Algorithm
+%% \ref{alg2-cuda-openmp}). Finally, threads copy the results from GPU
+%% memories to CPU memory. The OpenMP threads execute kernels until the
+%% roots sufficiently converge.
+
+
+%% \begin{algorithm}[h]
+%%   \label{alg2-cuda-openmp}
+%%   \LinesNumbered
+%%   \SetAlgoNoLine
+%%   \caption{CUDA-OpenMP Algorithm to find roots with the Ehrlich-Aberth method}
+
+%%   \KwIn{$Z^{0}$ (Initial root's vector), $\varepsilon$ (Error tolerance
+%%     threshold), P (Polynomial to solve), Pu (Derivative of P), $n$ (Polynomial degree), $\Delta z$ ( Vector of errors for stop condition), $num\_gpus$ (number of OpenMP threads/ Number of GPUs), $Size$ (number of roots)}
+
+%%   \KwOut {$Z$ ( Root's vector), $ZPrec$ (Previous root's vector)}
+
+%%   \BlankLine
+
+%%   Initialization of P\;
+%%   Initialization of Pu\;
+%%   Initialization of the solution vector $Z^{0}$\;
+%%   Start of a parallel part with OpenMP (Z, $\Delta z$, P are shared variables)\;
+%%   gpu\_id=cudaGetDevice()\; 
+%%   Allocate memory on GPU\;
+%%   Compute local size and offet according to gpu\_id\;
+%%   \While {$error > \epsilon$}{
+%%     copy Z from CPU to GPU\;
+%%     $ ZPrec_{loc}=kernel\_save(Z_{loc})$\;
+%%     $ Z_{loc}=kernel\_update(Z,P,Pu)$\;
+%%     $\Delta z[gpu\_id] = kernel\_testConv(Z_{loc},ZPrec_{loc})$\;
+%%     $  error= Max(\Delta z)$\;
+%%     copy $Z_{loc}$ from GPU to Z in CPU
+%%   }
+%%\end{algorithm}
+
 \begin{algorithm}[htpb]
+\LinesNumbered
+\SetAlgoNoLine
+\caption{Finding roots of polynomials with the Ehrlich-Aberth method on multiple GPUs using OpenMP}
+\KwIn{$n$ (polynomial's degree), $\epsilon$ (tolerance threshold), $ngpu$ (number of GPUs)}
+\KwOut{$Z$ (solution vector of roots)}
+Initialize the polynomial $P$ and its derivative $P'$\;
+Set the initial values of vector $Z$\;
+Start of a parallel part with OpenMP ($Z$, $\Delta Z$, $\Delta Z_{max}$, $P$ are shared variables)\;
+$id_{gpu}$ = cudaGetDevice()\;
+$n_{loc}$ = $n/ngpu$ (local size)\;
+%$idx$ = $id_{gpu}\times n_{loc}$ (local offset)\;
+Copy $P$, $P'$ from CPU to GPU\;
+\While{\emph{not convergence}}{
+  Copy $Z$ from CPU to GPU\;
+  $Z^{prev}$ = KernelSave($Z,n$)\;
+  $Z_{loc}$ = KernelUpdate($P,P',Z^{prev},n_{loc}$)\;
+  $\Delta Z_{loc}$ = KernelComputeError($Z_{loc},Z^{prev}_{loc},n_{loc}$)\;
+  $\Delta Z_{max}[id_{gpu}]$ = CudaMaxFunction($\Delta Z_{loc},n_{loc}$)\;
+  Copy $Z_{loc}$ from GPU to $Z$ in CPU\;
+  $max$ = MaxFunction($\Delta Z_{max},ngpu$)\;
+  TestConvergence($max,\epsilon$)\;
+}
 \label{alg2-cuda-openmp}
-%\LinesNumbered
-\caption{CUDA-OpenMP Algorithm to find roots with the Ehrlich-Aberth method}
-
-\KwIn{$Z^{0}$ (Initial root's vector), $\varepsilon$ (Error tolerance
-  threshold), P (Polynomial to solve), Pu (Derivative of P), $n$ (Polynomial degree), $\Delta z$ ( Vector of errors for stop condition), $num_gpus$ (number of OpenMP threads/ Number of GPUs), $Size$ (number of roots)}
-
-\KwOut {$Z$ ( Root's vector), $ZPrec$ (Previous root's vector)}
-
-\BlankLine
+\LZK{J'ai modifié l'algo. Le $P$ est mis shared. Qu'en est-il pour $P'$?}
+\end{algorithm}
 
-\item Initialization of P\;
-\item Initialization of Pu\;
-\item Initialization of the solution vector $Z^{0}$\;
-\verb=omp_set_num_threads(num_gpus);=
-\verb=#pragma omp parallel shared(Z,$\Delta$ z,P);=
-\verb=cudaGetDevice(gpu_id);=
-\item Allocate and copy initial data from CPU memory to the GPU global memories\;
-\item index= $Size/num\_gpus$\;
-\item k=0\;
-\While {$error > \epsilon$}{
-\item Let $\Delta z=0$\;
-\item $ kernel\_save(ZPrec,Z)$\;
-\item  k=k+1\;
-\item $ kernel\_update(Z,P,Pu,index)$\;
-\item $kernel\_testConverge(\Delta z[gpu\_id],Z,ZPrec)$\;
-%\verb=#pragma omp barrier;=
-\item error= Max($\Delta z$)\;
-}
 
-\item Copy results from GPU memories to CPU memory\;
-\end{algorithm}
-\end{enumerate}
-~\\ 
 
 
 
-\subsection{Multi-GPU : an MPI-CUDA approach}
+\subsection{an MPI-CUDA approach}
 %\begin{figure}[htbp]
 %\centering
  % \includegraphics[angle=-90,width=0.2\textwidth]{MPI-CUDA}
@@ -864,7 +922,6 @@ Our parallel implementation of EA to find root of polynomials using a CUDA-MPI a
 
 Since a GPU works only on data already allocated in its memory, all local input data, $Z_{k}$, $ZPrec$ and $\Delta z_{k}$, must be transferred from CPU memories to the corresponding GPU memories. Afterwards, the same EA algorithm (Algorithm \ref{alg1-cuda}) is run by all processes but on different polynomial subset of roots $ p(x)_{k}=\sum_{i=1}^{n} a_{i}x^{i}, k=1,...,p$.  Each MPI process executes the  loop \verb=(While(...)...do)= containing the CUDA kernels but each MPI process  computes only its own portion of the roots according to the rule ``''owner computes``''. The local range of roots is indicated with the \textit{index} variable initialized at (line 5, Algorithm \ref{alg2-cuda-mpi}), and passed as an input variable to $kernel\_update$ (line 10, Algorithm \ref{alg2-cuda-mpi}). After each iteration, MPI processes synchronize  (\verb=MPI_Allreduce= function) by a reduction on $\Delta z_{k}$ in order to compute the maximum error related to the stop condition.   Finally, processes copy the values of new computed roots  from GPU memories to CPU memories, then communicate their results to other processes with \verb=MPI_Alltoall= broadcast. If the stop condition is not verified ($error > \epsilon$) then processes stay withing the loop \verb= while(...)...do= until all the roots sufficiently converge.
 
-\begin{enumerate}
 \begin{algorithm}[htpb]
 \label{alg2-cuda-mpi}
 %\LinesNumbered
@@ -876,26 +933,22 @@ Since a GPU works only on data already allocated in its memory, all local input
 \KwOut {$Z$ (Solution root's vector), $ZPrec$ (Previous solution root's vector)}
 
 \BlankLine
-\item Initialization of P\;
-\item Initialization of Pu\;
-\item Initialization of the solution vector $Z^{0}$\;
-\item Allocate and copy initial data from CPU memories to GPU global memories\;
-\item $index= Size/num_gpus$\;
-\item k=0\;
+Initialization of P\;
+Initialization of Pu\;
+Initialization of the solution vector $Z^{0}$\;
+Distribution of Z\;
+Allocate memory to GPU\;
 \While {$error > \epsilon$}{
-\item Let $\Delta z=0$\;
-\item $kernel\_save(ZPrec,Z)$\;
-\item  k=k+1\;
-\item $kernel\_update(Z,P,Pu,index)$\;
-\item $kernel\_testConverge(\Delta z,Z,ZPrec)$\;
-\item ComputeMaxError($\Delta z$,error)\;
-\item Copy results from GPU memories to CPU memories\;
-\item Send $Z[id]$ to all processes\;
-\item Receive $Z[j]$ from every other process j\;
+copy Z from CPU to GPU\;
+$ZPrec_{loc}=kernel\_save(Z_{loc})$\;
+$Z_{loc}=kernel\_update(Z,P,Pu)$\;
+$\Delta z=kernel\_testConv(Z_{loc},ZPrec_{loc})$\;
+$error=MPI\_Reduce(\Delta z)$\;
+Copy $Z_{loc}$ from GPU to CPU\;
+$Z=MPI\_AlltoAll(Z_{loc})$\;
 }
 \end{algorithm}
-\end{enumerate}
-~\\ 
+
 
 \section{Experiments}
 \label{sec5}
@@ -912,91 +965,105 @@ We study two categories of polynomials: sparse polynomials and full polynomials.
 \begin{equation}
      {\Large \forall a_{i} \in C, i\in N;  p(x)=\sum^{n}_{i=0} a_{i}.x^{i}} 
 \end{equation}
-For our tests, a CPU Intel(R) Xeon(R) CPU E5620@2.40GHz and a GPU K40 (with 6 Go of ram) are used. 
-%SIDER : Une meilleure présentation de l'architecture est à faire ici.
-For our test, a cluster of computing with 72 nodes, 1116 cores, 4 cards GPU tesla Kepler K40 are used,
-In order to evaluate both the M-GPU and Multi-GPU approaches, we performed a set of experiments on a single GPU and multiple GPUs using OpenMP or MPI by EA algorithm, for both sparse and full polynomials of different sizes.
-All experimental results obtained are made in double precision data whereas the convergence threshold of the EA method is set to $10^{-7}$.
-%Since we were more interested in the comparison of the
-%performance behaviors of Ehrlich-Aberth and Durand-Kerner methods on
-%CPUs versus on GPUs.
-The initialization values of the vector solution
-of the methods are given by Guggenheimer method~\cite{Gugg86} %Section~\ref{sec:vec_initialization}.
-
-\subsection{Evaluating the M-GPU (CUDA-OpenMP) approach}
-
-We report here  the results of the set of experiments with the M-GPU approach for full and sparse polynomials of different degrees, and we compare it with a Single GPU execution.
-\subsubsection{Execution time of the EA method for solving sparse polynomials on multiple GPUs using the M-GPU approach}
+
+For our test, 4 cards GPU tesla Kepler K40 are used.  In order to
+evaluate both the GPU and Multi-GPU approaches, we performed a set of
+experiments on a single GPU and multiple GPUs using OpenMP or MPI with
+the EA algorithm, for both sparse and full polynomials of different
+sizes.  All experimental results obtained are perfomed with double
+precision float data and the convergence threshold of the EA method is
+set to $10^{-7}$.  The initialization values of the vector solution of
+the methods are given by Guggenheimer method~\cite{Gugg86}.
+
+
+\subsection{Evaluation of the CUDA-OpenMP approach}
+
+Here we report some experiments witt full and sparse polynomials of
+different degrees with multiple GPUs.
+\subsubsection{Execution times of the EA method to solve sparse polynomials on multiple GPUs}
  
-In this experiments we report the execution time of the EA algorithm, on single GPU and Multi-GPU with (2,3,4) GPUs, for different sparse polynomial degrees ranging from 100,000 to 1,400,000.
+In this experiments we report the execution time of the EA algorithm, on single GPU and multi-GPUs with (2,3,4) GPUs, for different sparse polynomial degrees ranging from 100,000 to 1,400,000.
 
 \begin{figure}[htbp]
 \centering
   \includegraphics[angle=-90,width=0.5\textwidth]{Sparse_omp}
-\caption{Execution time in seconds of the Ehrlich-Aberth method for solving sparse polynomials on multiple GPUs using the M-GPU approach}
+\caption{Execution time in seconds of the Ehrlich-Aberth method to
+  solve sparse polynomials on multiple GPUs with CUDA-OpenMP.}
 \label{fig:01}
 \end{figure}
 
-This figure~\ref{fig:01} shows that the (CUDA-OpenMP) M-GPU approach reduces the execution time by a factor up to 100 w.r.t the single GPU approach and a by a factor of 1000 for polynomials  exceeding degree 1,000,000. It shows the advantage to use the OpenMP parallel paradigm to gather the capabilities of several GPUs and solve polynomials of very high degrees.   
+Figure~\ref{fig:01} shows that the CUDA-OpenMP approach scales well
+with multiple GPUs. This version allows us to solve sparse polynomials
+of very high degrees.
 
-\subsubsection{Execution time in seconds of the Ehrlich-Aberth method for solving full polynomials on multiple GPUs using the M-GPU approach}
+\subsubsection{Execution times of the EA method to solve full polynomials on multiple GPUs}
 
-The experiments shows the execution time of the EA algorithm, on a single GPU and on multiple GPUs using the CUDA OpenMP approach for full polynomials of degrees ranging from 100,000 to 1,400,000.
+These experiments show the execution times of the EA algorithm, on a single GPU and on multiple GPUs using the CUDA OpenMP approach for full polynomials of degrees ranging from 100,000 to 1,400,000.
 
 \begin{figure}[htbp]
 \centering
   \includegraphics[angle=-90,width=0.5\textwidth]{Full_omp}
-\caption{Execution time in seconds of the Ehrlich-Aberth method for solving full polynomials on multiple GPUs using the M-GPU appraoch}
-\label{fig:03}
+\caption{Execution time in seconds of the Ehrlich-Aberth method to
+  solve full polynomials on multiple GPUs with CUDA-OpenMP.}
+\label{fig:02}
 \end{figure}
 
-Results with full polynomials show very important savings in execution time. For a polynomial of degree 1,4 million, the CUDA-OpenMP approach with 4 GPUs solves it 4 times as fast as single GPU, thus achieving a quasi-linear speedup.
+In Figure~\ref{fig:02}, we can observe that with full polynomials the EA version with
+CUDA-OpenMP scales also well. Using 4 GPUs allows us to achieve a
+quasi-linear speedup.
 
-\subsection{Evaluating the Multi-GPU (CUDA-MPI) approach}
-In this part we perform a set of experiments to compare the Multi-GPU (CUDA MPI) approach with a single GPU, for solving full and sparse polynomials of degrees ranging from 100,000 to 1,400,000.
+\subsection{Evaluation of the CUDA-MPI approach}
+In this part we perform some experiments to evaluate the CUDA-MPI
+approach to solve full and sparse polynomials of degrees ranging from
+100,000 to 1,400,000.
 
-\subsubsection{Execution time of the Ehrlich-Aberth method for solving sparse polynomials on multiple GPUs using the Multi-GPU approach}
+\subsubsection{Execution times of the EA method to solve sparse polynomials on multiple GPUs}
 
 \begin{figure}[htbp]
 \centering
   \includegraphics[angle=-90,width=0.5\textwidth]{Sparse_mpi}
-\caption{Execution time in seconds of the Ehrlich-Aberth method for solving sparse polynomials on multiple GPUs using the Multi-GPU approach}
-\label{fig:02}
+\caption{Execution time in seconds of the Ehrlich-Aberth method to
+  solve sparse polynomials on multiple GPUs with CUDA-MPI.}
+\label{fig:03}
 \end{figure}
-~\\
-Figure~\ref{fig:02} shows execution time of EA algorithm, for a single GPU, and multiple GPUs (2, 3, 4) on respectively 2, 3 and four MPI nodes. We can clearly see that the curve for a single GPU is above the other curves, which shows overtime in execution time compared to the Multi-GPU approach. We can see also that the CUDA-MPI approach reduces the execution time by a factor of 10 for polynomials of degree more than 1,000,000. For example, at degree 1,000,000, the execution time with a single GPU amounted to 10 thousand seconds, while with 4 GPUs, it is lowered to about just one thousand seconds which makes it for a tenfold speedup.
-%%SIDER : Je n'ai pas reformuler car je n'ai pas compris la phrase, merci de l'ecrire ici en fran\cais.
-\\cette figure montre 4 courbes de temps d'exécution pour l'algorithme EA, une courbe avec un seul GPU, 3 courbes pour multiple GPUs(2, 3, 4), on peut constaté clairement que la courbe à un seul GPU est au-dessus des autres courbes, vue sa consommation en temps d'exècution. On peut voir aussi qu'avec l'approche Multi-GPU (CUDA-MPI) reduit le temps d'exècution jusqu'à l'echelle 100 pour le polynômes qui dépasse 1,000,000 tandis que Single GPU est de l'echelle 1000.
+Figure~\ref{fig:03} shows the execution times of te EA algorithm,
+for a single GPU, and multiple GPUs (2, 3, 4) with the CUDA-MPI approach.
 
 \subsubsection{Execution time of the Ehrlich-Aberth method for solving full polynomials on multiple GPUs using the Multi-GPU appraoch}
 
 \begin{figure}[htbp]
 \centering
  \includegraphics[angle=-90,width=0.5\textwidth]{Full_mpi}
-\caption{Execution times in seconds of the Ehrlich-Aberth method for full polynomials on GPUs using the Multi-GPU}
+\caption{Execution times in seconds of the Ehrlich-Aberth method for
+  full polynomials on  multiple GPUs with CUDA-MPI.}
 \label{fig:04}
 \end{figure}
 
+In Figure~\ref{fig:04}, we can also observe that the CUDA-MPI approach
+is also efficient to solve full polynimails on multiple GPUs.
 
-	Figure \ref{fig:04} shows execution time for a single GPU, and multiple GPUs (2, 3, 4) on respectively 2, 3 and four MPI nodes. With the CUDA-MPI approach, we notice that the three curves are distinct from each other, more we use GPUs more the execution time decreases. On the other hand the curve for a single GPU is well above the other curves.
-
-This is due to the use of MPI parallel paradigm that divides the problem computations and assigns portions to each GPU. But unlike the single GPU which carries all the computations on a single GPU, data communications are introduced, consequently engendering more execution time. But experiments show that execution time is still highly reduced.
+\subsection{Comparison of  the CUDA-OpenMP and the CUDA-MPI approaches}
 
-
-
-\subsection{Comparing  the CUDA-OpenMP approach and the CUDA-MPI approach}
-
-In the previuos section we saw that both approches are very effective in reducing execution time for sparse as well as full polynomials. At this stage, the interesting question is which approach is better. In the fellowing, we present appropriate experiments comparing the two Multi-GPU approaches to answer the question.
+In the previuos section we saw that both approches are very effecient
+to  reduce the execution times the  sparse and full polynomials. In
+this section we try to compare these two approaches.
 
 \subsubsection{Solving sparse polynomials}
 In this experiment three sparse polynomials of size 200K, 800K and 1,4M are investigated.
 \begin{figure}[htbp]
 \centering
  \includegraphics[angle=-90,width=0.5\textwidth]{Sparse}
-\caption{Execution time  for solving sparse polynomials of three distinct sizes on multiple GPUs using MPI and OpenMP approaches using Ehrlich-Aberth}
+\caption{Execution times  to solvs sparse polynomials of three
+  distinct sizes on multiple GPUs using MPI and OpenMP with the
+  Ehrlich-Aberth method}
 \label{fig:05}
 \end{figure}
-In Figure~\ref{fig:05} there two curves for each polynomial size : one for the MPI-CUDA and another for the OpenMP. We can see that the results are similar between OpenMP and MPI for the polynomials size of 200K. For the size of 800K, the MPI version is a little slower than the OpenMP approach but for the 1,4 millions size, there is a slight advantage for the MPI version.
+In Figure~\ref{fig:05} there is one curve for CUDA-MPI and another one
+for CUDA-OpenMP. We can see that the results are quite similar between
+OpenMP and MPI for the polynomials size of 200K. For the size of 800K,
+the MPI version is a little bit slower than the OpenMP approach but for
+the 1,4 millions size, there is a slight advantage for the MPI
+version.
 
 \subsubsection{Solving full polynomials}
 \begin{figure}[htbp]
@@ -1008,14 +1075,22 @@ In Figure~\ref{fig:05} there two curves for each polynomial size : one for the M
 In Figure~\ref{fig:06}, we can see that when it comes to full polynomials, both approaches are almost equivalent.
 
 \subsubsection{Solving sparse and full polynomials of the same size with CUDA-MPI}
-In this experiment we compare the execution time of the EA algorithm according to the number of GPUs for solving sparse and full polynomials on Multi-GPU using MPI. We chose three sparse and full polynomials of size 200K, 800K  and 1,4M. 
+
+In this experiment we compare the execution time of the EA algorithm
+according to the number of GPUs to solve sparse and full
+polynomials on multiples GPUs using MPI. We chose three sparse and full
+polynomials of size 200K, 800K and 1,4M.
 \begin{figure}[htbp]
 \centering
  \includegraphics[angle=-90,width=0.5\textwidth]{MPI}
-\caption{Execution time for solving sparse and full polynomials of three distinct sizes on multiple GPUs using MPI}
+\caption{Execution times to solve sparse and full polynomials of three distinct sizes on multiple GPUs using MPI.}
 \label{fig:07}
 \end{figure}
-in figure ~\ref{fig:07} we can see that CUDA-MPI can solve sparse and full polynomials of high degrees, the execution time with sparse polynomial are very low comparing to full polynomials. with sparse polynomials the number of monomial are reduce, consequently the number of operation are reduce than the execution time decrease. 
+In Figure~\ref{fig:07} we can see that CUDA-MPI can solve sparse and
+full polynomials of high degrees, the execution times with sparse
+polynomial are very low compared to full polynomials. With sparse
+polynomials the number of monomials is reduced, consequently the number
+of operations is reduced and the execution time decreases.
 
 \subsubsection{Solving sparse and full polynomials of the same size with CUDA-OpenMP}
 
@@ -1026,17 +1101,24 @@ in figure ~\ref{fig:07} we can see that CUDA-MPI can solve sparse and full polyn
 \label{fig:08}
 \end{figure}
 
-Figure ~\ref{fig:08} shows the impact of sparsity on the effectiveness of the CUDA-OpenMP approach. We can see that the impact fellows the same pattern, a difference in execution time in favor of the sparse polynomials. 
-%SIDER : il faut une explication ici. je ne vois pas de prime abords, qu'est-ce qui engendre cette différence, car quelques soient les coefficients nulls ou non nulls, c'est toutes les racines qui sont calculées qu'elles soient similaires ou non (degrés de multiplicité).
-\subsection{Scalability of the EA method on Multi-GPU to solve very high degree polynomials}
-These experiments report the execution time according to the degrees of polynomials ranging from 1,000,000 to 5,000,000 for both approaches with sparse and full  polynomials. 
+Figure ~\ref{fig:08} shows the impact of sparsity on the effectiveness of the CUDA-OpenMP approach. We can see that the impact follows the same pattern, a difference in execution time in favor of the sparse polynomials. 
+
+\subsection{Scalability of the EA method on multiple GPUs to solve very high degree polynomials}
+These experiments report the execution times of the EA method for
+sparse and full polynomials ranging from 1,000,000 to 5,000,000.
 \begin{figure}[htbp]
 \centering
  \includegraphics[angle=-90,width=0.5\textwidth]{big}
  \caption{Execution times in seconds of the Ehrlich-Aberth method for solving full polynomials of high degree on 4 GPUs for sizes ranging from 1M to 5M}
 \label{fig:09}
 \end{figure}
-In figure ~\ref{fig:09} we can see that both approaches are scalable and can solve very high degree polynomials. With full polynomial both approaches give interestingly very similar results. For the sparse case however, there are a noticeable difference in favour of MPI when the degree is above 4M. Between 1M and 3M, the OMP approach is more effective and under 1M degree, OMP and MPI approaches are almost equivalent.
+In Figure~\ref{fig:09} we can see that both approaches are scalable
+and can solve very high degree polynomials. In addition, with full polynomial as well as sparse ones, both
+approaches give very similar results.
+
+%SIDER JE viens de virer \c ca For sparse polynomials here are a noticeable difference in favour of MPI when the degree is
+%above 4 millions. Between 1  and 3 millions, OpenMP is more effecient.
+%Under 1 million, OpenMPI and MPI are almost equivalent.
 
 %SIDER : il faut une explication sur les différences ici aussi.
  
@@ -1140,13 +1222,25 @@ In figure ~\ref{fig:09} we can see that both approaches are scalable and can sol
 
 \section{Conclusion}
 \label{sec6}
-In this paper, we have presented a parallel implementation of Ehrlich-Aberth algorithm for solving full and sparse polynomials, on single GPU with CUDA and on multiple GPUs using two parallel paradigms : shared memory with OpenMP and distributed memory with MPI. These architectures were addressed by a CUDA-OpenMP approach and CUDA-MPI approach, respectively. 
-The experiments show that, using parallel programming model like (OpenMP, MPI), we can efficiently manage multiple graphics cards to work together to solve the same problem and accelerate the parallel execution with 4 GPUs and solve a polynomial of degree 1,000,000, four times faster than on single GPU, that is a quasi-linear speedup.
+In this paper, we have presented a parallel implementation of
+Ehrlich-Aberth algorithm to solve full and sparse polynomials, on
+single GPU with CUDA and on multiple GPUs using two parallel
+paradigms: shared memory with OpenMP and distributed memory with
+MPI. These architectures were addressed by a CUDA-OpenMP approach and
+CUDA-MPI approach, respectively.  Experiments show that, using
+parallel programming model like (OpenMP, MPI). We can efficiently
+manage multiple graphics cards to solve the same
+problem and accelerate the parallel execution with 4 GPUs and solve a
+polynomial of degree up to 5,000,000, four times faster than on single
+GPU. 
 
 
 %In future, we will evaluate our parallel implementation of Ehrlich-Aberth algorithm on other parallel programming model 
 
-Our next objective is to extend the model presented here at clusters of nodes featuring  multiple GPUs, with a three-level scheme: inter-node communication via MPI processes (distributed memory), management of multi-GPU node by OpenMP threads (shared memory).
+Our next objective is to extend the model presented here with clusters
+of GPU nodes, with a three-level scheme: inter-node communication via
+MPI processes (distributed memory), management of multi-GPU node by
+OpenMP threads (shared memory).
 
 %present a communication approach between multiple GPUs. The comparison between MPI and OpenMP as GPUs controllers shows that these
 %solutions can effectively manage multiple graphics cards to work together
@@ -1164,8 +1258,10 @@ Our next objective is to extend the model presented here at clusters of nodes fe
 % use section* for acknowledgment
 \section*{Acknowledgment}
 
+Computations have been performed on the supercomputer facilities of
+the Mésocentre de calcul de Franche-Comté. We also would like to thank
+Nvidia for hardware donation under CUDA Research Center 2014.
 
-The authors would like to thank...