X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper2.git/blobdiff_plain/ddc3794278a5e10aa4895f7c8582a07fb06f3e88..6690e4dc2d54dee46bca4d1c54bf8f1444659d71:/paper.tex?ds=sidebyside

diff --git a/paper.tex b/paper.tex
index 41c5960..2644e4b 100644
--- a/paper.tex
+++ b/paper.tex
@@ -663,23 +663,38 @@ 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 method contains 4 steps. The first step consists of the initial approximations of all the roots of the polynomial.\LZK{Pas compris??}
-The second step initializes the solution vector $Z$ using the Guggenheimer method~\cite{Gugg86} to ensure the distinction of the initial vector roots.\LZK{Quelle est la différence entre la 1st step et la 2nd step? Que veut dire " 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.\LZK{On ne peut pas expliquer un peu plus comment? Donner des formules comment elle se base sur la méthode de Newton et de l'opérateur de  Weiestrass?}
+This method contains 4 steps. The first step consists in the
+initializing the polynomial.\LZK{Pas compris?? \RC{changé}}.
+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. \LZK{Quelle est la différence entre la 1st
+  step et la 2nd step? Que veut dire " to ensure the distinction of
+  the initial vector roots"? \RC{reformulé}} 
+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 EA method will converge to the roots of the
+considered polynomial.\LZK{On ne peut pas expliquer un peu plus
+  comment? Donner des formules comment elle se base sur la méthode de
+  Newton et de l'opérateur de  Weiestrass? \RC{amélioré}}
 \LZK{Elle est où la 4th step??}
-\LZK{Conclusion: Méthode mal présentée et j'ai presque rien compris!}
+\LZK{Conclusion: Méthode mal présentée et j'ai presque rien compris!
+  \RC{après} }
 
 
-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 $\epsilon$.
+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<\epsilon
 \end{equation}
 
-\LZK{On ne dit pas plutôt "the relative errors" à la place de "root modules"? Raph nous confirmera quelle critère d'arrêt a utilisé.}
+\LZK{On ne dit pas plutôt "the relative errors" à la place de "root
+  modules"? Raph nous confirmera quelle critère d'arrêt a
+  utilisé. \RC{normalement c'est bon, l'erreur est calculée avec le
+    module de chaque racine}}
 
 \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.
@@ -715,7 +730,11 @@ Q(z^k_i) = \exp(\ln(p(z^k_i)) - \ln(p'(z^k_i)) + \ln(\sum_{i\neq j}^n\frac{1}{z^
 
 
 %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~\cite{Karimall98}. \LZK{Je n'ai pas compris cette dernière phrase?}
+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}. \LZK{Je n'ai pas compris cette dernière
+  phrase? \RC{changé : on veut dire on manipule des valeurs plus petites en valeur absolues}}
 
 %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}.
@@ -729,16 +748,17 @@ 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!}
+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 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 kernels which are part of 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 second one is
+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
@@ -757,6 +777,7 @@ 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}
@@ -776,39 +797,41 @@ 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$}{
-   $ kernel\_save(ZPrec,Z)$\;
-   $ kernel\_update(Z,P,Pu)$\;
- $\Delta z_{max}=kernel\_testConverge(Z,ZPrec)$\;
+   $ 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}
-
+\RC{Si l'algo vous convient, il faudrait le détailler précisément}
  
 \section{The EA algorithm on Multiple GPUs}
 \label{sec4}
 \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 owns 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. Then all GPUs will have a grid of computation organized
+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. Each thread
-starts by copying all the previous roots inside its GPU. Then each GPU
-will compute an iteration of the EA method on its own roots. For that
-all the other roots are used. At the end of an iteration, the updated
-roots are copied from the GPU to the CPU. The convergence is checked
-on the new roots. Finally each CPU will update its own roots in the
-shared memory arrays containing all the roots.
+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).
 
@@ -856,11 +879,8 @@ shared memory arrays containing all the roots.
 Initialization of P\;
 Initialization of Pu\;
 Initialization of the solution vector $Z^{0}$\;
-omp\_set\_num\_threads(num\_gpus)\;
-\#pragma omp parallel shared(Z,$\Delta z$,P)\;
-\Indp
-{
-gpu\_id=cudaGetDevice()\;
+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$}{
@@ -871,8 +891,6 @@ $\Delta z[gpu\_id] = kernel\_testConv(Z_{loc},ZPrec_{loc})$\;
 $  error= Max(\Delta z)$\;
   copy $Z_{loc}$ from GPU to Z in CPU
 }
-\Indm}
-\RC{Est ce qu'on fait apparaitre le pragma? J'hésite...}
 \end{algorithm}
 
 
@@ -910,7 +928,7 @@ $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$\;
+Copy $Z_{loc}$ from GPU to CPU\;
 $Z=MPI\_AlltoAll(Z_{loc})$\;
 }
 \end{algorithm}