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

diff --git a/paper.tex b/paper.tex
index f3b0a91..b0e76b5 100644
--- a/paper.tex
+++ b/paper.tex
@@ -427,12 +427,14 @@ Polynomials are mathematical algebraic structures that play an important role in
 \begin{equation}
 p(x)=\sum_{i=0}^{n}{a_ix^i}.
 \end{equation}
-\LZK{Dans ce cas le polynÃ´me a $n+1$ coefficients !}
+\LZK{Dans ce cas le polynÃ´me a $n+1$ coefficients et non pas $n$!}
 
 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 zeros or roots of $p$. If zeros are $\{\alpha_{i}\}_{1\leq i\leq n}$, then $p(x)$ can be written as :
 \begin{equation}
  p(x)=a_n\prod_{i=1}^n(x-\alpha_i), a_0 a_n\neq 0.
 \end{equation}
+\LZK{C'est $a_n\neq 0$ (polynÃ´me de degrÃ© $n$) et non pas $a_0 a_n\neq 0$, non?}
+\LZK{Est-ce $\alpha_i$ sont les $z_i$ dÃ©finis dans la suite du papier?}
 
 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 ones, \textit{i.e.} the iterative methods to find simultaneous approximations of the $n$ polynomial zeros. 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. The first method of this group is Durand-Kerner method:
@@ -460,6 +462,8 @@ Very few work had been performed since then until the appearing of the Compute U
 
 Finding polynomial roots rapidly and accurately is the main objective of our work. In this paper we propose the parallelization of Ehrlich-Aberth method using two parallel programming paradigms OpenMP and MPI on multi-GPU platforms. We consider two architectures: shared memory and distributed memory computers. The first parallel algorithm is implemented on shared memory computers by 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. The second parallel algorithm uses the 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 distributed memory clusters to solve very complex problems that are too large for traditional supercomputers, which are very expensive to build and run.
 \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 !!}
  
 %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.}
 
