X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper2.git/blobdiff_plain/359a1184d00307a809c1f182403eea464e9d61d8..67b37118a273b5e87b90da1ccce91d97a55e09e5:/paper.tex?ds=sidebyside

diff --git a/paper.tex b/paper.tex
index 4a9d058..414bd83 100644
--- a/paper.tex
+++ b/paper.tex
@@ -785,23 +785,25 @@ to $10^{-7}$.
 The initialization values of the vector solution
 of the methods are given in %Section~\ref{sec:vec_initialization}.
 
-\subsection{Test with (CUDA OpenMP) approach}
+\subsection{Test with Multi-GPU (CUDA OpenMP) approach}
 
-In this part we performed  a set of experiments with (CUDA OpenMP) approach on full and sparse polynomials of different degrees.
+In this part we performed  a set of experiments on Multi-GPU (CUDA OpenMP) approach for full and sparse polynomials of different degrees, compare it with Single GPU (CUDA).
  \subsubsection{Execution times in seconds of the Ehrlich-Aberth method for solving sparse polynomials on GPUs using shared memory paradigm with OpenMP}
  
- In this test we report the execution time of the EA algorithm, on single GPU and Multi-GPU with (2,3,4) GPUs, for different sparse polynomial degrees ranging from 100,000 to 1,400,000
-\begin{figure}[htbp]
+ In this experiments we report the execution time of the EA algorithm, on single GPU and Multi-GPU with (2,3,4) GPUs, for different sparse polynomial degrees ranging from 100,000 to 1,400,000
 
+\begin{figure}[htbp]
 \centering
   \includegraphics[angle=-90,width=0.5\textwidth]{Sparse_omp}
 \caption{Execution times in seconds of the Ehrlich-Aberth method for solving sparse polynomials on GPUs using shared memory paradigm with OpenMP}
 \label{fig:01}
 \end{figure}
-in this figure~\ref{fig:01} shows that (CUDA OpenMP) Multi-GPU approach reduce the execution time up to the scale 100 whereas single GPU is of scale 1000 for polynomial who exceed 1,000,000. It shows the advantage to use OpenMP parallel paradigm  to connect the performances of several GPUs and solve a high polynomial of degrees.   
+
+This figure~\ref{fig:01} shows that (CUDA OpenMP) Multi-GPU approach reduce the execution time up to the scale 100 whereas single GPU is of scale 1000 for polynomial who exceed 1,000,000. It shows the advantage to use OpenMP parallel paradigm  to connect the performances of several GPUs and solve a  polynomial of high degrees.   
 
 \subsubsection{Execution times in seconds of the Ehrlich-Aberth method for solving full polynomials on GPUs using shared memory paradigm with OpenMP}
 
+This experiments shows the execution time of the EA algorithm, on single GPU (CUDA) and Multi-GPU (CUDA OpenMP)approach for full polynomials of degrees ranging from 100,000 to 1,400,000
 
 \begin{figure}[htbp]
 \centering
@@ -810,6 +812,7 @@ in this figure~\ref{fig:01} shows that (CUDA OpenMP) Multi-GPU approach reduce t
 \label{fig:03}
 \end{figure}
 
+The second test with full polynomial shows a very important saving of time, for a polynomial of degrees 1,4M (CUDA OpenMP) approach with 4 GPUs compute and solve it 4 times as fast as single GPU. We notice that curves are positioned one below the other one, more the number of used GPUs increases more the execution time decreases.
 
 \begin{figure}[htbp]
 \centering
