X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper2.git/blobdiff_plain/610b7d4815a2fd9055e42d8615c88f262b2c7fba..fc95f058592ab359f3dd6db1cccee14dad959494:/paper.tex?ds=sidebyside

diff --git a/paper.tex b/paper.tex
index 83d482a..1352fe9 100644
--- a/paper.tex
+++ b/paper.tex
@@ -834,6 +834,10 @@ This figure shows 4 curves of execution time of EA algorithm, a curve with singl
 \label{fig:04}
 \end{figure}
 
+
+this figure shows the execution time of the algorithm EA, on single GPU and Multi-GPUS with (2, 3, 4) GPUs for full polynomials. With (CUDA-MPI) approach we notice that the three curves are distinct from each other, more we use GPUs more the execution time decreases, on the other hand the curve with single GPU is well above the other curves.
+This is due to the use of parallelization MPI paradigm that divides the polynomial into sub polynomials assigned to each GPU. unlike the single GPU which solves all the polynomial on a single GPU, consequently it engenders more execution time.
+
 \begin{figure}[htbp]
 \centering
   \includegraphics[angle=-90,width=0.5\textwidth]{Sparse}
