X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper2.git/blobdiff_plain/18956ad6588c4d4035809466f3da0088916a3a74..1e4a27cd6dd739a4ee1c228d704a036ac34609c8:/paper.tex?ds=inline

diff --git a/paper.tex b/paper.tex
index d6dd2ff..a236a5a 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
@@ -772,10 +772,9 @@ 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}
-%\LinesNumbered
+\LinesNumbered
 \caption{CUDA Algorithm to find roots with the Ehrlich-Aberth method}
 
 \KwIn{$Z^{0}$ (Initial root's vector), $\varepsilon$ (Error tolerance
@@ -785,19 +784,19 @@ implementation of Ehrlich-Aberth method.
 
 %\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 \While {$\Delta z_{max} > \epsilon$}{
-\item   $ kernel\_save(ZPrec,Z)$\;
-\item   $ kernel\_update(Z,P,Pu)$\;
-\item $\Delta z_{max}=kernel\_testConverge(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$}{
+   $ kernel\_save(ZPrec,Z)$\;
+   $ kernel\_update(Z,P,Pu)$\;
+ $\Delta z_{max}=kernel\_testConverge(Z,ZPrec)$\;
 
 }
-\item Copy results from GPU memory to CPU memory\;
+Copy results from GPU memory to CPU memory\;
 \end{algorithm}
-\end{enumerate}
+
 ~\\ 
 
 \RC{Au final, on laisse ce code, on l'explique, si c'est kahina qui