From f34b6d5ff83430d63ac32d2253feb4646b988940 Mon Sep 17 00:00:00 2001 From: couturie Date: Wed, 4 Nov 2015 09:21:25 -0500 Subject: [PATCH] new --- paper.tex | 7 ++++--- 1 file changed, 4 insertions(+), 3 deletions(-) diff --git a/paper.tex b/paper.tex index cd7f270..d0913cc 100644 --- a/paper.tex +++ b/paper.tex @@ -582,7 +582,8 @@ Algorithm~\ref{alg2-cuda} shows a sketch of the Ehrlich-Aberth algorithm using C \caption{CUDA Algorithm to find roots with the Ehrlich-Aberth method} \KwIn{$Z^{0}$ (Initial root's vector), $\varepsilon$ (error tolerance - threshold), P(Polynomial to solve), Pu (the derivative of P), $n$ (Polynomial's degrees),$\Delta z_{max}$ (maximum value of stop condition)} + threshold), P(Polynomial to solve), Pu (the derivative of P), $n$ + (Polynomial's degrees), $\Delta z_{max}$ (maximum value of stop condition)} \KwOut {$Z$ (The solution root's vector), $ZPrec$ (the previous solution root's vector)} @@ -605,7 +606,7 @@ Copy results from GPU memory to CPU memory\; \end{algorithm} ~\\ -After the initialization step, all data of the root finding problem to be solved must be copied from the CPU memory to the GPU global memory, because the GPUs only access data already present in their memories. Next, all the data-parallel arithmetic operations inside the main loop \verb=(do ... while(...))= are executed as kernels by the GPU. The first kernel named \textit{save} in line 6 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}). +After the initialization step, all data of the root finding problem to be solved must be copied from the CPU memory to the GPU global memory, because the GPUs only access data already present in their memories. 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 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}). The second kernel executes the iterative function $H$ and updates $d\_Z$, according to Algorithm~\ref{alg3-update}. We notice that the @@ -616,7 +617,7 @@ exponential logarithm algorithm. \begin{algorithm}[H] \label{alg3-update} %\LinesNumbered -\caption{Kernel update} +\caption{Kernel\_update} \eIf{$(\left|d\_Z\right|<= R)$}{ $kernel\_update((d\_Z,d\_Pcoef,d\_Pdegres,d\_Pucoef,d\_Pudegres)$\;} -- 2.39.5