X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper2.git/blobdiff_plain/b34893a990fb0c4094c477543a475e91d15cde25..19056f53cfad07a463aa7197cef66838543b2777:/paper.tex?ds=inline

diff --git a/paper.tex b/paper.tex
index 0b2d113..02bb637 100644
--- a/paper.tex
+++ b/paper.tex
@@ -1078,14 +1078,22 @@ version.
 In Figure~\ref{fig:06}, we can see that when it comes to full polynomials, both approaches are almost equivalent.
 
 \subsubsection{Solving sparse and full polynomials of the same size with CUDA-MPI}
-In this experiment we compare the execution time of the EA algorithm according to the number of GPUs for solving sparse and full polynomials on Multi-GPU using MPI. We chose three sparse and full polynomials of size 200K, 800K  and 1,4M. 
+
+In this experiment we compare the execution time of the EA algorithm
+according to the number of GPUs to solve sparse and full
+polynomials on multiples GPUs using MPI. We chose three sparse and full
+polynomials of size 200K, 800K and 1,4M.
 \begin{figure}[htbp]
 \centering
  \includegraphics[angle=-90,width=0.5\textwidth]{MPI}
-\caption{Execution time for solving sparse and full polynomials of three distinct sizes on multiple GPUs using MPI}
+\caption{Execution times to solve sparse and full polynomials of three distinct sizes on multiple GPUs using MPI.}
 \label{fig:07}
 \end{figure}
-in figure ~\ref{fig:07} we can see that CUDA-MPI can solve sparse and full polynomials of high degrees, the execution time with sparse polynomial are very low comparing to full polynomials. with sparse polynomials the number of monomial are reduce, consequently the number of operation are reduce than the execution time decrease. 
+In Figure~\ref{fig:07} we can see that CUDA-MPI can solve sparse and
+full polynomials of high degrees, the execution times with sparse
+polynomial are very low compared to full polynomials. With sparse
+polynomials the number of monomials is reduced, consequently the number
+of operations is reduced and the execution time decreases.
 
 \subsubsection{Solving sparse and full polynomials of the same size with CUDA-OpenMP}
 
@@ -1096,17 +1104,23 @@ in figure ~\ref{fig:07} we can see that CUDA-MPI can solve sparse and full polyn
 \label{fig:08}
 \end{figure}
 
-Figure ~\ref{fig:08} shows the impact of sparsity on the effectiveness of the CUDA-OpenMP approach. We can see that the impact fellows the same pattern, a difference in execution time in favor of the sparse polynomials. 
-%SIDER : il faut une explication ici. je ne vois pas de prime abords, qu'est-ce qui engendre cette différence, car quelques soient les coefficients nulls ou non nulls, c'est toutes les racines qui sont calculées qu'elles soient similaires ou non (degrés de multiplicité).
-\subsection{Scalability of the EA method on Multi-GPU to solve very high degree polynomials}
-These experiments report the execution time according to the degrees of polynomials ranging from 1,000,000 to 5,000,000 for both approaches with sparse and full  polynomials. 
+Figure ~\ref{fig:08} shows the impact of sparsity on the effectiveness of the CUDA-OpenMP approach. We can see that the impact follows the same pattern, a difference in execution time in favor of the sparse polynomials. 
+
+\subsection{Scalability of the EA method on multiple GPUs to solve very high degree polynomials}
+These experiments report the execution times of the EA method for
+sparse and full polynomials ranging from 1,000,000 to 5,000,000.
 \begin{figure}[htbp]
 \centering
  \includegraphics[angle=-90,width=0.5\textwidth]{big}
  \caption{Execution times in seconds of the Ehrlich-Aberth method for solving full polynomials of high degree on 4 GPUs for sizes ranging from 1M to 5M}
 \label{fig:09}
 \end{figure}
-In figure ~\ref{fig:09} we can see that both approaches are scalable and can solve very high degree polynomials. With full polynomial both approaches give interestingly very similar results. For the sparse case however, there are a noticeable difference in favour of MPI when the degree is above 4M. Between 1M and 3M, the OMP approach is more effective and under 1M degree, OMP and MPI approaches are almost equivalent.
+In Figure~\ref{fig:09} we can see that both approaches are scalable
+and can solve very high degree polynomials. With full polynomial both
+approaches give very similar results. However, for sparse polynomials
+there are a noticeable difference in favour of MPI when the degree is
+above 4 millions. Between 1  and 3 millions, OpenMP is more effecient.
+Under 1 million, OpenMPI and MPI are almost equivalent.
 
 %SIDER : il faut une explication sur les différences ici aussi.