repondre au commentaire de Lilia

diff --git a/mybibfile.bib b/mybibfile.bib
index 7513da061b8f8d5591cfd415e27a48db676fd1a2..08f415a29bbc33944dd7773de63fdbca2b262795 100644 (file)
--- a/mybibfile.bib
+++ b/mybibfile.bib
@@ -493,4 +493,67 @@ OPTannote = {•}
 }
 
 
 }
 
 

+@InBook{Wei72,
+  author =     "K. Weierstrass",
+  title =      "{\"U}ber continuirliche {F}unctionen eines reellen
+                {A}rguments, die f{\"u}r keinen {W}erth des letzteren
+                einen bestimmten {D}ifferentialquotienten besitzen",
+  pages =      "71--74",
+  publisher =  "Berlin: Mayer \& {M\"u}ller ({H}erausgegeben unter
+                {M}itwirkung einer von der k{\"o}niglich
+                preu\ss{}ischen Akademie der {W}issenschaften
+                eingesetzten {C}ommission)",
+  year =       "1872",
+  volume =     "2",
+  series =     "Mathematische Werke",
+}
+
+@Article{Gugg86,
+  author =     "H. Guggenheimer",
+  title =      "Initial approximations in {Durand--Kerner}'s root
+                finding method",
+  journal =    "BIT",
+  volume =     "26",
+  number =     "4",
+  pages =      "537--539",
+  month =      dec,
+  year =       "1986",
+  CODEN =      "BITTEL, NBITAB",
+  doi =        "http://dx.doi.org/10.1007/BF01935059",
+  ISSN =       "0006-3835 (print), 1572-9125 (electronic)",
+  issn-l =     "0006-3835",
+  bibdate =    "Wed Jan 4 18:52:19 MST 2006",
+  bibsource =  "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0006-3835&volume=26&issue=4;
+                http://www.math.utah.edu/pub/tex/bib/bit.bib",
+  URL =        "http://www.springerlink.com/openurl.asp?genre=article&issn=0006-3835&volume=26&issue=4&spage=537",
+  acknowledgement = "Nelson H. F. Beebe, University of Utah, Department
+                of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake
+                City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1
+                801 581 4148, e-mail: \path|beebe@math.utah.edu|,
+                \path|beebe@acm.org|, \path|beebe@computer.org|
+                (Internet), URL:
+                \path|http://www.math.utah.edu/~beebe/|",
+  journal-url =  "http://link.springer.com/journal/10543",
+  doi-url =    "http://dx.doi.org/10.1007/BF01935059",
+}
+
+
+
+@InCollection{newt70,
+  author =     "Isaac Newton",
+  year =       "1670--71?",
+  title =      "Tractatus de Methodis Serierum et Fluxionum",
+  booktitle =  "The Mathematical Papers of Isaac Newton, III",
+  editor =     "D. T. Whiteside",
+  pages =      "32--353",
+  publisher =  "Cambridge University Press, Cambridge",
+  kwds =       "na, history, Newton's method",
+}
+
+
+
+
+
+
+

 
 

diff --git a/paper.tex b/paper.tex
index 52ab448fa8338b6bcf14132da7668556fc6c7868..15031f87ea647951689a5fcccb10ed41a76763e7 100644 (file)
--- a/paper.tex
+++ b/paper.tex
@@ -433,17 +433,17 @@ Finding roots of polynomials is a very important part of solving real-life probl
 
 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}
 
 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},
+p(x) = \displaystyle\sum^n_{i=0}{a_ix^i},a_0\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}
 \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}

- p(x)=a_n\displaystyle\prod_{i=1}^n(x-z_i), a_0 a_n\neq 0.
+ p(x)=a_n\displaystyle\prod_{i=1}^n(x-z_i), a_n\neq 0.

 \end{equation}
 \end{equation}

-\LZK{Pourquoi $a_0a_n\neq 0$ ?}
+\LZK{Pourquoi $a_0a_n\neq 0$ ?: $a_0$ pour la premiere equation et $a_n$ pour la deuxieme equation }

 
 %The problem of finding the roots of polynomials can be encountered in numerous applications. \LZK{A mon avis on peut supprimer cette phrase}
 
 %The problem of finding the roots of polynomials can be encountered in numerous applications. \LZK{A mon avis on peut supprimer cette phrase}

-Most of the numerical methods that deal with the polynomial root-finding problem are simultaneous methods, \textit{i.e.} the iterative methods to find simultaneous approximations of the $n$ polynomial roots. These methods start from the initial approximations of all $n$ polynomial roots and give a sequence of approximations that converge to the roots of the polynomial. Two examples of well-known simultaneous methods for root-finding problem of polynomials are  Durand-Kerner method~\cite{} and Ehrlich-Aberth method~\cite{}.
-\LZK{Pouvez-vous donner des références pour les deux méthodes?}
+Most of the numerical methods that deal with the polynomial root-finding problem are simultaneous methods, \textit{i.e.} the iterative methods to find simultaneous approximations of the $n$ polynomial roots. These methods start from the initial approximations of all $n$ polynomial roots and give a sequence of approximations that converge to the roots of the polynomial. Two examples of well-known simultaneous methods for root-finding problem of polynomials are  Durand-Kerner method~\cite{Durand60,Kerner66} and Ehrlich-Aberth method~\cite{Ehrlich67,Aberth73}.
+\LZK{Pouvez-vous donner des références pour les deux méthodes?, c'est fait}

 
 %The first method of this group is Durand-Kerner method:
 %\begin{equation}
 
 %The first method of this group is Durand-Kerner method:
 %\begin{equation}


@@ -463,7 +463,7 @@ Most of the numerical methods that deal with the polynomial root-finding problem
 %the Ehrlich-Aberth method (EA) has a cubic order of convergence for simple roots whereas the Durand-Kerner has a quadratic order of %convergence.
 
 The main problem of the simultaneous methods is that the necessary time needed for the convergence increases with the increasing of the polynomial's degree. Many authors have treated the problem of implementing  simultaneous methods in parallel. Freeman~\cite{Freeman89} implemented and compared Durand-Kerner method, Ehrlich-Aberth method and another method of the fourth order of convergence proposed by Farmer and Loizou~\cite{Loizou83} on a 8-processor linear chain, for polynomials of degree up-to 8. The method of Farmer and Loizou~\cite{Loizou83} often diverges, but the first two methods (Durand-Kerner and Ehrlich-Aberth methods) have a speed-up equals to 5.5. Later, Freeman and Bane~\cite{Freemanall90} considered asynchronous algorithms in which each processor continues to update its approximations even though the latest values of other approximations $z^{k}_{i}$ have not been received from the other processors, in contrast with synchronous algorithms where it would wait those values before making a new iteration. Couturier et al.~\cite{Raphaelall01} proposed two methods 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. The authors showed an interesting speedup comparing to the sequential implementation which takes up-to 3,300 seconds to obtain same results.
 %the Ehrlich-Aberth method (EA) has a cubic order of convergence for simple roots whereas the Durand-Kerner has a quadratic order of %convergence.
 
 The main problem of the simultaneous methods is that the necessary time needed for the convergence increases with the increasing of the polynomial's degree. Many authors have treated the problem of implementing  simultaneous methods in parallel. Freeman~\cite{Freeman89} implemented and compared Durand-Kerner method, Ehrlich-Aberth method and another method of the fourth order of convergence proposed by Farmer and Loizou~\cite{Loizou83} on a 8-processor linear chain, for polynomials of degree up-to 8. The method of Farmer and Loizou~\cite{Loizou83} often diverges, but the first two methods (Durand-Kerner and Ehrlich-Aberth methods) have a speed-up equals to 5.5. Later, Freeman and Bane~\cite{Freemanall90} considered asynchronous algorithms in which each processor continues to update its approximations even though the latest values of other approximations $z^{k}_{i}$ have not been received from the other processors, in contrast with synchronous algorithms where it would wait those values before making a new iteration. Couturier et al.~\cite{Raphaelall01} proposed two methods 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. 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?}
+\LZK{``only by using 8 personal computers and 2 communications per iteration''. Pour MPI? et Pour OpenMP: Rep: c'est MPI seulement}

 
 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.
 
 
 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.
 


@@ -472,17 +472,19 @@ Very few work had been performed since then until the appearing of the Compute U
 %\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{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?}
+\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.}

  \begin{itemize}
  \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.
+ \item A parallel implementation of Ehrlich-Aberth method on single GPU with CUDA.

 \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.
  \end{itemize}
 \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.
  \end{itemize}

-\LZK{Pas d'autres contributions possibles?}
+\LZK{Pas d'autres contributions possibles?: j'ai rajouté 2}

 
 %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.}
 
 
 %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.
-\LZK{A revoir toute cette organization}
+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. 
+\LZK{A revoir toute cette organization: je viens de la revoir}

 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%


@@ -616,27 +618,29 @@ CUDA (Compute Unified Device Architecture) is a parallel computing architecture
 %\label{fig:03}
 %\end{figure}
 
 %\label{fig:03}
 %\end{figure}
 

-%the Ehrlich-Aberth method is an iterative  method, contain 4 steps, start from the initial approximations of all the roots of the polynomial,the second step initialize the solution vector $Z$ using the Guggenheimer method to assure the distinction of the initial vector roots, than in step 3 we apply the the iterative function based on the Newton's method and Weiestrass operator~\cite{,}, wich will make it possible to converge to the roots solution, provided that all the root are different.
+%the Ehrlich-Aberth method is an iterative  method, contain 4 steps, start from the initial approximations of all the roots of the polynomial,the second step initialize the solution vector $Z$ using the Guggenheimer method to assure the distinction of the initial vector roots, than in step 3 we apply the the iterative function based on the Newton's method and Weiestrass operator~\cite{,}, witch will make it possible to converge to the roots solution, provided that all the root are different.

 
 The Ehrlich-Aberth method is a simultaneous method~\cite{} using the following iteration
 \begin{equation}
 \label{Eq:EA1}
 
 The Ehrlich-Aberth method is a simultaneous method~\cite{} using the following iteration
 \begin{equation}
 \label{Eq:EA1}

-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)}\displaystyle\sum\limits_{\substack{j=1 \\ j\neq i}}^{j=n}{\frac{1}{(z_i^k-z_j^k)}}}, i=1,\ldots,n,
+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}
 \end{equation}

-to find the roots $Z$

 
 

- contain 4 steps, start from the initial approximations of all the roots of the polynomial,the second step initialize the solution vector $Z$ using the Guggenheimer method to assure the distinction of the initial vector roots, than in step 3 we apply the the iterative function based on the Newton's method and Weiestrass operator~\cite{,}, wich will make it possible to converge to the roots solution, provided that all the root are different.
+contain 4 steps, start from the initial approximations of all the roots of the polynomial,the second step initialize the solution vector $Z$ using the Guggenheimer~\cite{Gugg86} method to assure the distinction of the initial vector roots,

 
 

+ than in step 3 we apply the the iterative function based on the Newton's method~\cite{newt70} and Weiestrass operator~\cite{Weierstrass03}, wich will make it possible to converge to the roots solution, provided that all the root are different.

 
 
 
 

- At the end of each application of the iterative function, a stop condition is verified consists in stopping the iterative process when the whole of the modules of the roots are lower than a fixed value $\xi$ 
+ At the end of each application of the iterative function, a stop condition is verified consists in stopping the iterative process when the whole of the modules of the roots are lower than a fixed value $\xi$. 

 
 \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
 \end{equation}
 
 \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
 \end{equation}

-
-\subsection{EA parallel implementation on CUDA}
+\subsection{Improving Ehrlich-Aberth method}
+......
+\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.
 
 
 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.