From: zianekhodja <zianekhodja.lilia@gmail.com>
Date: Fri, 1 Jan 2016 16:30:38 +0000 (+0100)
Subject: relecture de l'abstract
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/kahina_paper2.git/commitdiff_plain/06a095275728e8e36650cb0e3dac10727e8cf231

relecture de l'abstract
---

diff --git a/paper.tex b/paper.tex
index f40cdc2..56685d0 100644
--- a/paper.tex
+++ b/paper.tex
@@ -321,6 +321,8 @@
 
 
 
+\usepackage[utf8]{inputenc}
+\usepackage[T1]{fontenc}
 \usepackage[textsize=footnotesize]{todonotes}
 \newcommand{\LZK}[2][inline]{%
   \todo[color=red!10,#1]{\sffamily\textbf{LZK:} #2}\xspace}
@@ -398,8 +400,8 @@ 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. \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.
+\LZK{J'ai un peu modifié l'abstract. Sinon à revoir pour le degré max des polynômes testés après les tests de raph.}
+Finding roots of polynomials is a very important part of solving real-life problems but it is not so easy for polynomials of high degrees. In this paper, we present two different parallel algorithms of the Ehrlich-Aberth method to find roots of sparse and fully defined polynomials of high degrees. Both algorithms are based on CUDA technology to be implemented on multi-GPU computing platforms but each using different parallel paradigms: OpenMP or MPI. The experiments show a quasi-linear speedup by using up-to 4 GPU devices to find roots of polynomials of degree up-to 1.4 billion. To our knowledge, this is the first paper to present this technology mix to solve such a highly demanding problem in parallel programming. \LZK{Je n'ai pas bien saisi la dernière phrase.}
 
 \end{abstract}