X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper2.git/blobdiff_plain/652ebc0ed520c817aa5261d341046a3a13826dfb..51b76e69e76be0dbd2c81b750b2e09869faef33d:/paper.tex

diff --git a/paper.tex b/paper.tex
index 6fdcf3a..f40cdc2 100644
--- a/paper.tex
+++ b/paper.tex
@@ -316,6 +316,19 @@
 % argument is your BibTeX string definitions and bibliography database(s)
 %\bibliography{IEEEabrv,../bib/paper}
 %\bibliographystyle{elsarticle-num}
+
+
+
+
+
+\usepackage[textsize=footnotesize]{todonotes}
+\newcommand{\LZK}[2][inline]{%
+  \todo[color=red!10,#1]{\sffamily\textbf{LZK:} #2}\xspace}
+
+
+
+
+
 \begin{document}
 %
 % paper title
@@ -385,7 +398,7 @@ Fax: (888) 555--1212}}
 % As a general rule, do not put math, special symbols or citations
 % in the abstract
 \begin{abstract}
-Finding roots of polynomials is a well-known important but not so very easy problem to solve especially for high degrees.
+Finding roots of polynomials is a well-known important but not so very easy problem to solve especially for high degrees. \LZK{il manque quelque chose dans cette phrase. Proposition: Finding roots of polynomials is a very important part of solving real-life problems but it is not an easy task for polynomials of high degrees.}
 In this paper, we present two different parallel approaches to achieve this gaol for sparse and fully defined polynomials of up to 1.4 billion degree. Our two approaches are based on the well known parallel paradigms of OpenMP and MPI but combined with the novel CUDA GPU technology. Our results show a quasi-linear speedup using up to 4 GPU devices to solve four times faster a polynomial root finding problem. To our knowledge, this is the first paper to present this technology mix to solve such a highly demanding problem in parallel programming.
 
 \end{abstract}
