la biblio

[kahina_paper1.git] / paper.tex

diff --git a/paper.tex b/paper.tex
index 788db9ac129fd34557039e46f743d4b9f398221c..e8ec4e35a89844e7a140cd4d12cb021d41c5bce5 100644 (file)
--- a/paper.tex
+++ b/paper.tex
@@ -385,7 +385,7 @@ Authors usually adopt one of the two following approaches to parallelize root
 finding algorithms. The first approach aims at reducing the total number of
 iterations as by Miranker
 ~\cite{Mirankar68,Mirankar71}, Schedler~\cite{Schedler72} and
 finding algorithms. The first approach aims at reducing the total number of
 iterations as by Miranker
 ~\cite{Mirankar68,Mirankar71}, Schedler~\cite{Schedler72} and

-Winogard~\cite{Winogard72}. The second approach aims at reducing the
+Winograd~\cite{Winogard72}. The second approach aims at reducing the

 computation time per iteration, as reported
 in~\cite{Benall68,Jana06,Janall99,Riceall06}. 
 
 computation time per iteration, as reported
 in~\cite{Benall68,Jana06,Janall99,Riceall06}. 
 


@@ -843,7 +843,8 @@ numerical applications on GPU.
 
 In future works, we plan to investigate the possibility of using
 several multiple GPUs simultaneously, either with multi-GPU machine or
 
 In future works, we plan to investigate the possibility of using
 several multiple GPUs simultaneously, either with multi-GPU machine or

-with cluster of GPUs.
+with cluster of GPUs. It may also be interesting to study the
+implementation of other root finding polynomial methods on GPU.