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

diff --git a/paper.tex b/paper.tex
index 178bf3b..6fdcf3a 100644
--- a/paper.tex
+++ b/paper.tex
@@ -324,8 +324,8 @@
 % not capitalized unless they are the first or last word of the title.
 % Linebreaks \\ can be used within to get better formatting as desired.
 % Do not put math or special symbols in the title.
-\title{A parallel implementation of Ehrlich-Aberth algorithm  for root finding of polynomials
-on Multi-GPU with OpenMP/MPI}
+\title{Two parallel implementations of Ehrlich-Aberth algorithm for root finding of polynomials
+on  multiple GPUs with OpenMP and MPI}
 
 
 % author names and affiliations
@@ -385,7 +385,9 @@ Fax: (888) 555--1212}}
 % As a general rule, do not put math, special symbols or citations
 % in the abstract
 \begin{abstract}
-The abstract goes here.
+Finding roots of polynomials is a well-known important but not so very easy problem to solve especially for 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}
 
 % no keywords
