explication du kernel

[kahina_paper1.git] / maj.tex

diff --git a/maj.tex b/maj.tex
index c5a0bebe3c8e46fdac9c03faf99cdfa109d3504d..30c1a9e33d1189b479c84deef8d540c839c544ce 100644 (file)
--- a/maj.tex
+++ b/maj.tex
@@ -765,11 +765,11 @@ This kernel is executed by a large number of GPU threads such that each thread i
 
 Each GPU threads in grid compute one root en parallel, if the polynomial size exceed the capacity of the grid the G.S schema are finely executed, like the grid can only compute << Blocks,Threads>> roots at the same time, if we ned to compute more roots, the grid can used the roots previously executed to compute other root ih the same iteration, like the following schema:
 
 
 Each GPU threads in grid compute one root en parallel, if the polynomial size exceed the capacity of the grid the G.S schema are finely executed, like the grid can only compute << Blocks,Threads>> roots at the same time, if we ned to compute more roots, the grid can used the roots previously executed to compute other root ih the same iteration, like the following schema:
 

-\begin{figure}[htbp]
-\centering
-  \includegraphics[width=0.8\textwidth]{figures/G.S}
-\caption{Gauss Seidel iteration}
-\label{fig:08}
+%\begin{figure}[htbp]
+%\centering
+ % \includegraphics[width=0.8\textwidth]{figures/G.S}
+%\caption{Gauss Seidel iteration}
+%\label{fig:08}

 
 The kernel are executed from << DimGrid, DimBlock>>, 
 The last kernel checks the convergence of the roots after each update
 
 The kernel are executed from << DimGrid, DimBlock>>, 
 The last kernel checks the convergence of the roots after each update