X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper1.git/blobdiff_plain/10844d40f853b6fad58b5f366618e3b2aec1066c..12b2d99947e482e179e6954270d38c8b632a4f8e:/paper.tex?ds=inline

diff --git a/paper.tex b/paper.tex
index 8f03506..2dcee57 100644
--- a/paper.tex
+++ b/paper.tex
@@ -345,14 +345,12 @@ propose to use the logarithm and the exponential of a complex in order to comput
 Using the logarithm (eq.~\ref{deflncomplex}) and the exponential (eq.~\ref{defexpcomplex}) operators, we can replace any multiplications and divisions with additions and subtractions. Consequently, computations
 manipulate lower absolute values and the roots for large polynomial's degrees can be looked for successfully~\cite{Karimall98}.
 
-Applying this solution for the Ehrlich-Aberth method we obtain the
-iteration function with exponential and logarithm:
+Applying this solution for the iteration function Eq.~\ref{Eq:Hi} of Ehrlich-Aberth method, we obtain the iteration function with exponential and logarithm:
 %%$$ \exp \bigl(  \ln(p(z)_{k})-ln(\ln(p(z)_{k}^{'}))- \ln(1- \exp(\ln(p(z)_{k})-ln(\ln(p(z)_{k}^{'})+\ln\sum_{i\neq j}^{n}\frac{1}{z_{k}-z_{j}})$$
 \begin{equation}
 \label{Log_H2}
 EA.EL: 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),
+p(z_{i}^{k})\right)-\ln\left(p'(z^{k}_{i})\right)- \ln\left(1-Q(z^{k}_{i})\right)\right),
 \end{equation}
 
 where:
@@ -364,12 +362,11 @@ Q(z^{k}_{i})=\exp\left( \ln (p(z^{k}_{i}))-\ln(p'(z^{k}_{i}))+\ln \left(
 \end{equation}
 
 This solution is applied when the root except the circle unit, represented by the radius $R$ evaluated in C language as :
+\begin{equation}
 \label{R.EL}
-\begin{center}
-\begin{verbatim}
-R = exp(log(DBL_MAX)/(2*n) );
-\end{verbatim}
-\end{center} 
+R = exp(log(DBL\_MAX)/(2*n) );
+\end{equation}
+
 
 %\begin{equation}
 
@@ -410,7 +407,7 @@ other processors at the end of each iteration (synchronous). Therefore they
 cause a high degree of memory conflict. Recently the author
 in~\cite{Mirankar71} proposed two versions of parallel algorithm
 for the Durand-Kerner method, and Ehrlich-Aberth method on a model of
-Optoelectronic Transpose Interconnection System (OTIS).The
+Optoelectronic Transpose Interconnection System (OTIS). The
 algorithms are mapped on an OTIS-2D torus using $N$ processors. This
 solution needs $N$ processors to compute $N$ roots, which is not
 practical for solving polynomials with large degrees.
@@ -543,7 +540,7 @@ polynomials of 48,000.
 \subsection{Parallel implementation with CUDA }
 
 In order to implement the Ehrlich-Aberth method in CUDA, it is
-possible to use the Jacobi scheme or the Gauss Seidel one.  With the
+possible to use the Jacobi scheme or the Gauss-Seidel one.  With the
 Jacobi iteration, at iteration $k+1$ we need all the previous values
 $z^{k}_{i}$ to compute the new values $z^{k+1}_{i}$, that is :
 
@@ -561,7 +558,7 @@ With the Gauss-Seidel iteration, we have:
 \begin{equation}
 \label{eq:Aberth-H-GS}
 EAGS: 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^{i-1}_{j=1}\frac{1}{z^{k}_{i}-z^{k+1}_{j}}+\sum_{j=1,j\neq i}^{j=n}{\frac{1}{(z_{i}^{k}-z_{j}^{k})}})}, i=1,. . . .,n
+{1-\frac{p(z_{i}^{k})}{p'(z_{i}^{k})}(\sum^{i-1}_{j=1}\frac{1}{z^{k}_{i}-z^{k+1}_{j}}+\sum_{j=i+1}^{j=n}{\frac{1}{(z_{i}^{k}-z_{j}^{k})}})}, i=1,. . . .,n
 \end{equation}
 
 Using Eq.~\ref{eq:Aberth-H-GS} to update the vector solution
@@ -583,7 +580,7 @@ quickly because, just as any Jacobi algorithm (for solving linear systems of equ
 
 %In CUDA programming, all the instructions of the  \verb=for= loop are executed by the GPU as a kernel. A kernel is a function written in CUDA and defined by the  \verb=__global__= qualifier added before a usual \verb=C= function, which instructs the compiler to generate appropriate code to pass it to the CUDA runtime in order to be executed on the GPU. 
 
-Algorithm~\ref{alg2-cuda} shows steps of the Ehrlich-Aberth algorithm using CUDA.
+Algorithm~\ref{alg2-cuda} shows sketch of the Ehrlich-Aberth method using CUDA.
 
 \begin{enumerate}
 \begin{algorithm}[H]
@@ -591,7 +588,7 @@ Algorithm~\ref{alg2-cuda} shows steps of the Ehrlich-Aberth algorithm using CUDA
 %\LinesNumbered
 \caption{CUDA Algorithm to find roots with the Ehrlich-Aberth method}
 
-\KwIn{$Z^{0}$ (Initial root's vector), $\varepsilon$ (error tolerance
+\KwIn{$Z^{0}$ (Initial root's vector), $\varepsilon$ (Error tolerance
   threshold), P (Polynomial to solve), Pu (Derivative of P), $n$ (Polynomial's degrees), $\Delta z_{max}$ (Maximum value of stop condition)}
 
 \KwOut {$Z$ (Solution root's vector), $ZPrec$ (Previous solution root's vector)}
@@ -620,11 +617,11 @@ After the initialization step, all data of the root finding problem
 must be copied from the CPU memory to the GPU global memory. Next, all
 the data-parallel arithmetic operations inside the main loop
 \verb=(while(...))= are executed as kernels by the GPU. The
-first kernel named \textit{save} in line 6 of
+first kernel named \textit{save} in line 7 of
 Algorithm~\ref{alg2-cuda} consists in saving the vector of
 polynomial's root found at the previous time-step in GPU memory, in
 order to check the convergence of the roots after each iteration (line
-8, Algorithm~\ref{alg2-cuda}).
+10, Algorithm~\ref{alg2-cuda}).
 
 The second kernel executes the iterative function and updates
 $Z$, according to Algorithm~\ref{alg3-update}. We notice that the
@@ -648,12 +645,10 @@ The first form executes formula the EA function Eq.~\ref{Eq:Hi} if the modulus
 of the current complex is less than the a certain value called the
 radius i.e. ($ |z^{k}_{i}|<= R$), else the kernel executes the EA.EL
 function Eq.~\ref{Log_H2}
-(with Eq.~\ref{deflncomplex}, Eq.~\ref{defexpcomplex}). The radius $R$ is evaluated as in ~\ref{R.EL} :
-
-$$R = \exp( \log(DBL\_MAX) / (2*n) )$$ where $DBL\_MAX$ stands for the maximum representable double value.
+(with Eq.~\ref{deflncomplex}, Eq.~\ref{defexpcomplex}). The radius $R$ is evaluated as in Eq.~\ref{R.EL}.
 
 The last kernel checks the convergence of the roots after each update
-of $Z^{(k)}$, according to formula Eq.~\ref{eq:Aberth-Conv-Cond}. We used the functions of the CUBLAS Library (CUDA Basic Linear Algebra Subroutines) to implement this kernel. 
+of $Z^{k}$, according to formula Eq.~\ref{eq:Aberth-Conv-Cond}. We used the functions of the CUBLAS Library (CUDA Basic Linear Algebra Subroutines) to implement this kernel. 
 
 The kernel terminates its computations when all the roots have
 converged. It should be noticed that, as blocks of threads are
@@ -702,7 +697,7 @@ all the coefficients are not null. A full polynomial is defined by:
 %polynomials. The execution time remains the
 %element-key which justifies our work of parallelization.
 For our tests, a CPU Intel(R) Xeon(R) CPU
-E5620@2.40GHz and a GPU K40 (with 6 Go of ram) is used. 
+E5620@2.40GHz and a GPU K40 (with 6 Go of ram) are used. 
 
 
 %\subsection{Comparative study}
@@ -737,7 +732,7 @@ of the methods are given in Section~\ref{sec:vec_initialization}.
 In Figure~\ref{fig:01}, we report the execution times of the
 Ehrlich-Aberth method on one core of a Quad-Core Xeon E5620 CPU, on
 four cores on the same machine with \textit{OpenMP} and on a Nvidia
-Tesla K40c GPU.  We chose different sparse polynomials with degrees
+Tesla K40 GPU.  We chose different sparse polynomials with degrees
 ranging from 100,000 to 1,000,000. We can see that the implementation
 on the GPU is faster than those implemented on the CPU.
 However, the execution time for the