1 \documentclass[conference]{IEEEtran}
2 \usepackage[ruled,vlined]{algorithm2e}
3 \hyphenation{op-tical net-works semi-conduc-tor}
4 \bibliographystyle{IEEEtran}
7 \usepackage[utf8]{inputenc}
8 \usepackage[T1]{fontenc}
9 \usepackage[textsize=footnotesize]{todonotes}
10 \newcommand{\LZK}[2][inline]{%
11 \todo[color=red!10,#1]{\sffamily\textbf{LZK:} #2}\xspace}
12 \newcommand{\RC}[2][inline]{%
13 \todo[color=blue!10,#1]{\sffamily\textbf{RC:} #2}\xspace}
14 \newcommand{\KG}[2][inline]{%
15 \todo[color=green!10,#1]{\sffamily\textbf{KG:} #2}\xspace}
16 \newcommand{\AS}[2][inline]{%
17 \todo[color=orange!10,#1]{\sffamily\textbf{AS:} #2}\xspace}
22 \title{Two parallel implementations of Ehrlich-Aberth algorithm for root-finding of polynomials on multiple GPUs with OpenMP and MPI}
24 \author{\IEEEauthorblockN{Kahina Guidouche, Abderrahmane Sider }
25 \IEEEauthorblockA{Laboratoire LIMED\\
26 Faculté des sciences exactes\\
27 Université de Bejaia, 06000, Algeria\\
28 Email: \{kahina.ghidouche,ar.sider\}@univ-bejaia.dz}
30 \IEEEauthorblockN{Lilia Ziane Khodja, Raphaël Couturier}
31 \IEEEauthorblockA{FEMTO-ST Institute\\
32 University of Bourgogne Franche-Comte, France\\
33 Email: zianekhodja.lilia@gmail.com\\ raphael.couturier@univ-fcomte.fr}}
39 Finding roots of polynomials is a very important part of solving
40 real-life problems but it is not so easy for polynomials of high
41 degrees. In this paper, we present two different parallel algorithms
42 of the Ehrlich-Aberth method to find roots of sparse and fully defined
43 polynomials of high degrees. Both algorithms are based on CUDA
44 technology to be implemented on multi-GPU computing platforms but each
45 using different parallel paradigms: OpenMP or MPI. The experiments
46 show a quasi-linear speedup by using up-to 4 GPU devices compared to 1
47 GPU to find roots of polynomials of degree up-to 1.4
48 million. Moreover, other experiments show it is possible to find roots
49 of polynomials of degree up-to 5 millions.
53 \LZK{Faut pas mettre des keywords?}
56 \IEEEpeerreviewmaketitle
59 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
60 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
61 \section{Introduction}
64 Finding roots of polynomials of very high degrees arises in many complex problems in various domains such as algebra, biology or physics. A polynomial $p(x)$ in $\mathbb{C}$ in one variable $x$ is an algebraic expression in $x$ of the form:
66 p(x) = \displaystyle\sum^n_{i=0}{a_ix^i},a_n\neq 0,
68 where $\{a_i\}_{0\leq i\leq n}$ are complex coefficients and $n$ is a high integer number. If $a_n\neq0$ then $n$ is called the degree of the polynomial. The root-finding problem consists in finding the $n$ different values of the unknown variable $x$ for which $p(x)=0$. Such values are called roots of $p(x)$. Let $\{z_i\}_{1\leq i\leq n}$ be the roots of polynomial $p(x)$, then $p(x)$ can be written as :
70 p(x)=a_n\displaystyle\prod_{i=1}^n(x-z_i), a_n\neq 0.
73 Most of the numerical methods that deal with the polynomial root-finding problem are simultaneous methods, \textit{i.e.} the iterative methods to find simultaneous approximations of the $n$ polynomial roots. These methods start from the initial approximations of all $n$ polynomial roots and give a sequence of approximations that converge to the roots of the polynomial. Two examples of well-known simultaneous methods for root-finding problem of polynomials are Durand-Kerner method~\cite{Durand60,Kerner66} and Ehrlich-Aberth method~\cite{Ehrlich67,Aberth73}.
75 The main problem of the simultaneous methods is that the necessary
76 time needed for the convergence increases with the increasing of the
77 polynomial's degree. Many authors have treated the problem of
78 implementing simultaneous methods in
79 parallel. Freeman~\cite{Freeman89} implemented and compared
80 Durand-Kerner method, Ehrlich-Aberth method and another method of the
81 fourth order of convergence proposed by Farmer and
82 Loizou~\cite{Loizou83} on a 8-processor linear chain, for polynomials
83 of degree up-to 8. The method of Farmer and Loizou~\cite{Loizou83}
84 often diverges, but the first two methods (Durand-Kerner and
85 Ehrlich-Aberth methods) have a speed-up equals to 5.5. Later, Freeman
86 and Bane~\cite{Freemanall90} considered asynchronous algorithms in
87 which each processor continues to update its approximations even
88 though the latest values of other approximations $z^{k}_{i}$ have not
89 been received from the other processors, in contrast with synchronous
90 algorithms where it would wait those values before making a new
91 iteration. Couturier et al.~\cite{Raphaelall01} proposed two methods
92 of parallelization for a shared memory architecture with OpenMP and
93 for a distributed memory one with MPI. They are able to compute the
94 roots of sparse polynomials of degree 10,000 in 116 seconds with
95 OpenMP and 135 seconds with MPI only by using 8 personal computers and
96 2 communications per iteration. The authors showed an interesting
97 speedup comparing to the sequential implementation which takes up-to
98 3,300 seconds to obtain same results.
99 \RC{si on donne des temps faut donner le proc, comme c'est vieux à mon avis faut supprimer ca, votre avis?}
100 \LZK{Supprimons ces détails et mettons une référence s'il y en a une}
102 Very few work had been performed since then until the appearing of the Compute Unified Device Architecture (CUDA)~\cite{CUDA15}, a parallel computing platform and a programming model invented by NVIDIA. The computing power of GPUs (Graphics Processing Units) has exceeded that of traditional processors CPUs. However, CUDA adopts a totally new computing architecture to use the hardware resources provided by the GPU in order to offer a stronger computing ability to the massive data computing. Ghidouche et al.~\cite{Kahinall14} proposed an implementation of the Durand-Kerner method on a single GPU. Their main results showed that a parallel CUDA implementation is about 10 times faster than the sequential implementation on a single CPU for sparse polynomials of degree 48,000.
104 In this paper we propose the parallelization of Ehrlich-Aberth method which has a good convergence and it is suitable to be implemented in parallel computers. We use two parallel programming paradigms OpenMP and MPI on CUDA multi-GPU platforms. Our CUDA-MPI and CUDA-OpenMP codes are the first implementations of Ehrlich-Aberth method with multiple GPUs for finding roots of polynomials. Our major contributions include:
105 \LZK{J'ai ajouté une phrase pour justifier notre choix de la méthode Ehrlich-Aberth. A revérifier.}
108 \item The parallel implementation of Ehrlich-Aberth algorithm on a multi-GPU platform with a shared memory using OpenMP API. It is based on threads created from the same system process, such that each thread is attached to one GPU. In this case the communications between GPUs are done by OpenMP threads through shared memory.
109 \item The parallel implementation of Ehrlich-Aberth algorithm on a multi-GPU platform with a distributed memory using MPI API, such that each GPU is attached and managed by a MPI process. The GPUs exchange their data by message-passing communications.
111 This latter approach is more used on clusters to solve very complex problems that are too large for traditional supercomputers, which are very expensive to build and run.
112 \LZK{Pas d'autres contributions possibles? J'ai supprimé les deux premiers points proposés précédemment.
113 \AS{La résolution du problème pour des polynomes pleins de degré 6M est une contribution aussi à mon avis}}
115 The paper is organized as follows. In Section~\ref{sec2} we present three different parallel programming models OpenMP, MPI and CUDA. In Section~\ref{sec3} we present the implementation of the Ehrlich-Aberth algorithm on a single GPU. In Section~\ref{sec4} we present the parallel implementations of the Ehrlich-Aberth algorithm on multiple GPUs using the OpenMP and MPI approaches. In section~\ref{sec5} we present our experiments and discuss them. Finally, Section~\ref{sec6} concludes this paper and gives some hints for future research directions in this topic.
118 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
119 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
121 \section{Parallel programming models}
123 Our objective consists in implementing a root-finding algorithm of polynomials on multiple GPUs. To this end, it is primordial to know how to manage CUDA contexts of different GPUs. A direct method for controlling the various GPUs is to use as many threads or processes as GPU devices. We investigate two parallel paradigms: OpenMP and MPI. In this case, the GPU indices are defined according to the identifiers of the OpenMP threads or the ranks of the MPI processes. In this section we present the parallel programming models: OpenMP, MPI and CUDA.
128 OpenMP (Open Multi-processing) is an application programming interface for parallel programming~\cite{openmp13}. It is a portable approach based on the multithreading designed for shared memory computers, where a master thread forks a number of slave threads which execute blocks of code in parallel. An OpenMP program alternates sequential regions and parallel regions of code, where the sequential regions are executed by the master thread and the parallel ones may be executed by multiple threads. During the execution of an OpenMP program the threads communicate their data (read and modified) in the shared memory. One advantage of OpenMP is the global view of the memory address space of an application. This allows relatively a fast development of parallel applications with easier maintenance. However, it is often difficult to get high rates of performances in large scale-applications.
133 MPI (Message Passing Interface) is a portable message passing style of the parallel programming designed especially for the distributed memory architectures~\cite{Peter96}. In most MPI implementations, a computation contains a fixed set of processes created at the initialization of the program in such way one process is created per processor. The processes synchronize their computations and communicate by sending/receiving messages to/from other processes. In this case, the data are explicitly exchanged by message passing while the data exchanges are implicit in a multithread programming model like OpenMP and Pthreads. However in the MPI programming model, the processes may either execute different programs referred to as multiple program multiple data (MPMD) or every process executes the same program (SPMD). The MPI approach is one of most used HPC programming model to solve large scale and complex applications.
138 CUDA (Compute Unified Device Architecture) is a parallel computing architecture developed by NVIDIA~\cite{CUDA15} for GPUs. It provides a high level GPGPU-based programming model to program GPUs for general purpose computations and non-graphic applications. The GPU is viewed as an accelerator such that data-parallel operations of a CUDA program running on a CPU are off-loaded onto GPU and executed by this later. The data-parallel operations executed by GPUs are called kernels. The same kernel is executed in parallel by a large number of threads organized in grids of thread blocks, such that each GPU multiprocessor executes one or more thread blocks in SIMD fashion (Single Instruction, Multiple Data) and in turn each core of the multiprocessor executes one or more threads within a block. Threads within a block can cooperate by sharing data through a fast shared memory and coordinate their execution through synchronization points. In contrast, within a grid of thread blocks, there is no synchronization at all between blocks. The GPU only works on data filled in the global memory and the final results of the kernel executions must be transferred out of the GPU. In the GPU, the global memory has lower bandwidth than the shared memory associated to each multiprocessor. Thus in the CUDA programming, it is necessary to design carefully the arrangement of the thread blocks in order to ensure low latency and a proper usage of the shared memory, and the global memory accesses should be minimized.
141 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
142 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
144 \section{The Ehrlich-Aberth algorithm on a GPU}
147 \subsection{The Ehrlich-Aberth method}
149 The Ehrlich-Aberth method is a simultaneous method~\cite{Aberth73} using the following iteration
152 z^{k+1}_{i}=z_{i}^{k}-\frac{\frac{p(z_{i}^{k})}{p'(z_{i}^{k})}}
153 {1-\frac{p(z_{i}^{k})}{p'(z_{i}^{k})}\sum_{j=1,j\neq i}^{j=n}{\frac{1}{(z_{i}^{k}-z_{j}^{k})}}}, i=1,\ldots,n
156 This method contains 4 steps. The first step consists in the initializing the polynomial. The second step initializes the solution vector $Z$ using the Guggenheimer method~\cite{Gugg86} to ensure that initial roots are all distinct from each other. In step 3, the iterative function based on the Newton's method~\cite{newt70} and Weiestrass operator~\cite{Weierstrass03} is applied. In our case, the Ehrlich-Aberth is applied as in~(\ref{Eq:EA1}). Iterations of the Ehrlich-Aberth method will converge to the roots of the considered polynomial. In order to stop the iterative function, a stop condition is applied, this is the 4th step. This condition checks that all the root modules are lower than a fixed value $\epsilon$.
159 \label{eq:Aberth-Conv-Cond}
160 \forall i\in[1,n],~\vert\frac{z_i^k-z_i^{k-1}}{z_i^k}\vert<\epsilon
163 \subsection{Improving Ehrlich-Aberth method}
164 With high degree polynomials, the Ehrlich-Aberth method suffers from floating point overflows due to the mantissa of floating points representations. This induces errors in the computation of $p(z)$ when $z$ is large.
167 In order to solve this problem, we propose to modify the iterative
168 function by using the logarithm and the exponential of a complex and
169 we propose a new version of the Ehrlich-Aberth method. This method
170 allows us to exceed the computation of the polynomials of degree
171 100,000 and to reach a degree up to more than 1,000,000. The reformulation of the iteration~(\ref{Eq:EA1}) of the Ehrlich-Aberth method with exponential and logarithm is defined as follows, for $i=1,\dots,n$:
175 z^{k+1}_i = z_i^k - \exp(\ln(p(z_i^k)) - \ln(p'(z^k_i)) - \ln(1-Q(z^k_i))),
182 Q(z^k_i) = \exp(\ln(p(z^k_i)) - \ln(p'(z^k_i)) + \ln(\sum_{i\neq j}^n\frac{1}{z^k_i-z^k_j})).
187 Using the logarithm and the exponential operators, we can replace any multiplications and divisions with additions and subtractions. Consequently, computations manipulate lower values in absolute values~\cite{Karimall98}.
190 \subsection{The Ehrlich-Aberth parallel implementation on CUDA}
192 Our objective consists in implementing a root finding polynomial
193 algorithm on multiple GPUs. To this end, it is primordial to know how
194 to manage CUDA contexts of different GPUs. A direct method for
195 controlling the various GPUs is to use as many threads or processes as
196 GPU devices. We can choose the GPU index based on the identifier of
197 OpenMP thread or the rank of the MPI process. Both approaches will be
198 investigated. \LZK{Répétition! Le même texte est déjà écrit comme
199 intro dans la section II. Sinon ici on parle seulement de
200 l'implémentation cuda sans mpi et openmp! \RC{Je suis d'accord à
201 revoir après, quand les 2 parties suivantes seront plus stables}}
206 Like any parallel code, a GPU parallel implementation first requires to determine the sequential code and the data-parallel operations of a algorithm. In fact, all the operations that are easy to execute in parallel must be made by the GPU to accelerate the execution, like the steps 3 and 4. On the other hand, all the sequential operations and the operations that have data dependencies between CUDA threads or recursive computations must be executed by only one CUDA thread or a CPU thread (the steps 1 and 2).\LZK{La méthode est déjà mal présentée, dans ce cas c'est encore plus difficile de comprendre que représentent ces différentes étapes!} Initially, we specify the organization of parallel threads by specifying the dimension of the grid \verb+Dimgrid+, the number of blocks per grid \verb+DimBlock+ and the number of threads per block.
208 The code is organized as kernels which are parts of code that are run on GPU devices. For step 3, there are two kernels, the first is named \textit{save} is used to save vector $Z^{K-1}$ and the second one is
209 named \textit{update} and is used to update the $Z^{K}$ vector. For
210 step 4, a kernel tests the convergence of the method. In order to
211 compute the function H, we have two possibilities: either to use the
212 Jacobi mode, or the Gauss-Seidel mode of iterating which uses the most
213 recent computed roots. It is well known that the Gauss-Seidel mode
214 converges more quickly. So, we use Gauss-Seidel iterations. To
215 parallelize the code, we create kernels and many functions to be
216 executed on the GPU for all the operations dealing with the
217 computation on complex numbers and the evaluation of the
218 polynomials. As said previously, we manage both functions of
219 evaluation: the normal method, based on the method of
220 Horner and the method based on the logarithm of the polynomial. All
221 these methods were rather long to implement, as the development of
222 corresponding kernels with CUDA is longer than on a CPU host. This
223 comes in particular from the fact that it is very difficult to debug
224 CUDA running threads like threads on a CPU host. In the following
225 paragraph Algorithm~\ref{alg1-cuda} shows the GPU parallel
226 implementation of Ehrlich-Aberth method.
227 \LZK{Vaut mieux expliquer l'implémentation en faisant référence à l'algo séquentiel que de parler des différentes steps.}
231 \begin{algorithm}[htpb]
234 \caption{Finding roots of polynomials with the Ehrlich-Aberth method on a GPU}
235 \KwIn{$n$ (polynomial's degree), $\epsilon$ (tolerance threshold)}
236 \KwOut{$Z$ (solution vector of roots)}
237 Initialize the polynomial $P$ and its derivative $P'$\;
238 Set the initial values of vector $Z$\;
239 Copy $P$, $P'$ and $Z$ from CPU to GPU\;
240 \While{$\Delta Z_{max} > \epsilon$}{
241 $Z^{prev}$ = KernelSave($Z,n$)\;
242 $Z$ = KernelUpdate($P,P',Z,n$)\;
243 $\Delta Z_{max}$ = KernelComputeError($Z,Z^{prev},n$)\;
245 Copy $Z$ from GPU to CPU\;
247 \RC{La ligne avec TestConvergence ca fait une ligne de plus.\LZK{Oui j'ai hésité à l'ajouter. On peut faire le test dans la condition de while mais quelle est la valeur initiale de $\Delta Z_{max}$?! Ou bien on s'en fiche?}}
251 \section{The EA algorithm on Multiple GPUs}
253 \subsection{an OpenMP-CUDA approach}
254 Our OpenMP-CUDA implementation of EA algorithm is based on the hybrid
255 OpenMP and CUDA programming model. All the data are shared with
256 OpenMP amoung all the OpenMP threads. The shared data are the solution
257 vector $Z$, the polynomial to solve $P$, and the error vector $\Delta
258 z$. The number of OpenMP threads is equal to the number of GPUs, each
259 OpenMP thread binds to one GPU, and it controls a part of the shared
260 memory. More precisely each OpenMP thread will be responsible to
261 update its owns part of the vector Z. This part is call $Z_{loc}$ in
262 the following. Then all GPUs will have a grid of computation organized
263 according to the device performance and the size of data on which it
264 runs the computation kernels.
266 To compute one iteration of the EA method each GPU performs the
267 followings steps. First roots are shared with OpenMP and the
268 computation of the local size for each GPU is performed (lines 5-7 in
269 Algo\ref{alg2-cuda-openmp}). Each thread starts by copying all the
270 previous roots inside its GPU (line 9). Then each GPU will copy the
271 previous roots (line 10) and it will compute an iteration of the EA
272 method on its own roots (line 11). For that all the other roots are
273 used. The convergence is checked on the new roots (line 12). At the end
274 of an iteration, the updated roots are copied from the GPU to the
275 CPU (line 14) by direcly updating its own roots in the shared memory
276 arrays containing all the roots.
280 \begin{algorithm}[htpb]
283 \caption{Finding roots of polynomials with the Ehrlich-Aberth method on multiple GPUs using OpenMP}
284 \KwIn{$n$ (polynomial's degree), $\epsilon$ (tolerance threshold), $ngpu$ (number of GPUs)}
285 \KwOut{$Z$ (solution vector of roots)}
286 Initialize the polynomial $P$ and its derivative $P'$\;
287 Set the initial values of vector $Z$\;
288 Start of a parallel part with OpenMP ($Z$, $\Delta Z_{max}$, $P$, $P'$ are shared variables)\;
289 $id_{gpu}$ = cudaGetDevice()\;
290 $n_{loc}$ = $n/ngpu$ (local size)\;
291 $offset$ = $id_{gpu}\times n_{loc}$ (local offset)\;
292 Copy $P$, $P'$ from CPU to GPU\;
293 \While{$max > \epsilon$}{
294 Copy $Z$ from CPU to GPU\;
295 $Z^{prev}$ = KernelSave($Z,n$)\;
296 $Z[offset]$ = KernelUpdate($P,P',Z,n_{loc}$)\;
297 $\Delta Z_{max}[id_{gpu}]$ = KernelComputeError($Z[offset],Z^{prev}[offset],n_{loc}$)\;
298 Copy $Z[offset]$ from GPU to $Z$ in CPU\;
299 $max$ = MaxFunction($\Delta Z_{max},ngpu$)\;
301 \label{alg2-cuda-openmp}
302 \RC{Je l'ai rajouté. Bon sinon le n\_loc ne remplace pas
303 vraiment un offset et une taille mais bon... et là il y a 4 lignes
304 pour la convergence, c'est bcp ... Zloc, Zmax, max et
305 testconvergence. On pourrait faire mieux\LZK{Modifié, c'est bon!}}
312 \subsection{a MPI-CUDA approach}
314 Our parallel implementation of EA to find root of polynomials using a
315 CUDA-MPI approach follows a similar computing approach to the one used
316 in CUDA-OpenMP. Each process is responsible to compute its own part of
317 roots using all the roots computed by other processors at the previous
318 iteration. The difference between both approaches lies in the way
319 processes communicate and exchange data. With MPI processors need to
320 send and receive data explicitely. So in
321 Algorithm~\ref{alg2-cuda-mpi}, after the initialization all the
322 processors have the same $Z$ vector. Then they need to compute the
323 parameters used by the $MPI\_AlltoAll$ routines (line 4). In practise,
324 each processor needs to compute its offset and its local size. Then
325 processors need to allocate memory on their GPU (line 5). At the
326 beginning of each iteration, a processor starts by transfering the
327 whole vector Z from the CPU to the GPU (line 7). Then only the local
328 part of $Z^{prev}$ is saved (line 8). After that, a processor is able
329 to compute its own roots (line 9). Next, the local error can be
330 computed (ligne 10) and the global error (line 11). Then the local
331 roots are transfered from the GPU memory to the CPU memory (line 12)
332 before being exchanged between all processors (linge 13) in order to
333 give to all processors the last version of the roots. If the
334 convergence is not statisfied, an new iteration is executed.
338 \begin{algorithm}[htpb]
339 \label{alg2-cuda-mpi}
341 \caption{CUDA-MPI Algorithm to find roots with the Ehrlich-Aberth method}
343 \KwIn{$Z^{0}$ (Initial root's vector), $\varepsilon$ (Error tolerance
344 threshold), P (Polynomial to solve), P' (Derivative of P), $n$ (Polynomial degrees), $\Delta z$ ( error of stop condition)}
346 \KwOut {$Z$ (Solution root's vector)}
349 Initialization of P\;
350 Initialization of Pu\;
351 Initialization of the solution vector $Z^{0}$\;
352 Computation of the parameters for the $MPI\_AlltoAll$\;
353 Allocate memory to GPU\;
354 \While {$error > \epsilon$}{
355 copy Z from CPU to GPU\;
356 $Z^{Prev}_{loc}=kernel\_save(Z_{loc})$\;
357 $Z_{loc}=kernel\_update(Z,P,P')$\;
358 $\Delta z=kernel\_testConv(Z_{loc},Z^{prev}_{loc})$\;
359 $error=MPI\_Reduce(\Delta z)$\;
360 Copy $Z_{loc}$ from GPU to CPU\;
361 $Z=MPI\_AlltoAll(Z_{loc})$\;
363 \RC{A uniformiser avec les autres algos, mais les grandes lignes sont là}
367 \section{Experiments}
369 We study two categories of polynomials: sparse polynomials and full polynomials.\\
370 {\it A sparse polynomial} is a polynomial for which only some coefficients are not null. In this paper, we consider sparse polynomials for which the roots are distributed on 2 distinct circles:
372 \forall \alpha_{1} \alpha_{2} \in C,\forall n_{1},n_{2} \in N^{*}; P(z)= (z^{n_{1}}-\alpha_{1})(z^{n_{2}}-\alpha_{2})
373 \end{equation}\noindent
374 {\it A full polynomial} is, in contrast, a polynomial for which all the coefficients are not null. A full polynomial is defined by:
376 %%\forall \alpha_{i} \in C,\forall n_{i}\in N^{*}; P(z)= \sum^{n}_{i=1}(z^{n^{i}}.a_{i})
380 {\Large \forall a_{i} \in C, i\in N; p(x)=\sum^{n}_{i=0} a_{i}.x^{i}}
383 For our test, 4 cards GPU tesla Kepler K40 are used. In order to
384 evaluate both the GPU and Multi-GPU approaches, we performed a set of
385 experiments on a single GPU and multiple GPUs using OpenMP or MPI with
386 the EA algorithm, for both sparse and full polynomials of different
387 sizes. All experimental results obtained are perfomed with double
388 precision float data and the convergence threshold of the EA method is
389 set to $10^{-7}$. The initialization values of the vector solution of
390 the methods are given by Guggenheimer method~\cite{Gugg86}.
393 \subsection{Evaluation of the CUDA-OpenMP approach}
395 Here we report some experiments witt full and sparse polynomials of
396 different degrees with multiple GPUs.
397 \subsubsection{Execution times of the EA method to solve sparse polynomials on multiple GPUs}
399 In this experiments we report the execution time of the EA algorithm, on single GPU and multi-GPUs with (2,3,4) GPUs, for different sparse polynomial degrees ranging from 100,000 to 1,400,000.
403 \includegraphics[angle=-90,width=0.5\textwidth]{Sparse_omp}
404 \caption{Execution time in seconds of the Ehrlich-Aberth method to
405 solve sparse polynomials on multiple GPUs with CUDA-OpenMP.}
409 Figure~\ref{fig:01} shows that the CUDA-OpenMP approach scales well
410 with multiple GPUs. This version allows us to solve sparse polynomials
411 of very high degrees.
413 \subsubsection{Execution times of the EA method to solve full polynomials on multiple GPUs}
415 These experiments show the execution times of the EA algorithm, on a single GPU and on multiple GPUs using the CUDA OpenMP approach for full polynomials of degrees ranging from 100,000 to 1,400,000.
419 \includegraphics[angle=-90,width=0.5\textwidth]{Full_omp}
420 \caption{Execution time in seconds of the Ehrlich-Aberth method to
421 solve full polynomials on multiple GPUs with CUDA-OpenMP.}
425 In Figure~\ref{fig:02}, we can observe that with full polynomials the EA version with
426 CUDA-OpenMP scales also well. Using 4 GPUs allows us to achieve a
427 quasi-linear speedup.
429 \subsection{Evaluation of the CUDA-MPI approach}
430 In this part we perform some experiments to evaluate the CUDA-MPI
431 approach to solve full and sparse polynomials of degrees ranging from
432 100,000 to 1,400,000.
434 \subsubsection{Execution times of the EA method to solve sparse polynomials on multiple GPUs}
438 \includegraphics[angle=-90,width=0.5\textwidth]{Sparse_mpi}
439 \caption{Execution time in seconds of the Ehrlich-Aberth method to
440 solve sparse polynomials on multiple GPUs with CUDA-MPI.}
443 Figure~\ref{fig:03} shows the execution times of te EA algorithm,
444 for a single GPU, and multiple GPUs (2, 3, 4) with the CUDA-MPI approach.
446 \subsubsection{Execution time of the Ehrlich-Aberth method for solving full polynomials on multiple GPUs using the Multi-GPU appraoch}
450 \includegraphics[angle=-90,width=0.5\textwidth]{Full_mpi}
451 \caption{Execution times in seconds of the Ehrlich-Aberth method for
452 full polynomials on multiple GPUs with CUDA-MPI.}
456 In Figure~\ref{fig:04}, we can also observe that the CUDA-MPI approach
457 is also efficient to solve full polynimails on multiple GPUs.
459 \subsection{Comparison of the CUDA-OpenMP and the CUDA-MPI approaches}
461 In the previuos section we saw that both approches are very effecient
462 to reduce the execution times the sparse and full polynomials. In
463 this section we try to compare these two approaches.
465 \subsubsection{Solving sparse polynomials}
466 In this experiment three sparse polynomials of size 200K, 800K and 1,4M are investigated.
469 \includegraphics[angle=-90,width=0.5\textwidth]{Sparse}
470 \caption{Execution times to solvs sparse polynomials of three
471 distinct sizes on multiple GPUs using MPI and OpenMP with the
472 Ehrlich-Aberth method}
475 In Figure~\ref{fig:05} there is one curve for CUDA-MPI and another one
476 for CUDA-OpenMP. We can see that the results are quite similar between
477 OpenMP and MPI for the polynomials size of 200K. For the size of 800K,
478 the MPI version is a little bit slower than the OpenMP approach but for
479 the 1,4 millions size, there is a slight advantage for the MPI
482 \subsubsection{Solving full polynomials}
485 \includegraphics[angle=-90,width=0.5\textwidth]{Full}
486 \caption{Execution time for solving full polynomials of three distinct sizes on multiple GPUs using MPI and OpenMP approaches using Ehrlich-Aberth}
489 In Figure~\ref{fig:06}, we can see that when it comes to full polynomials, both approaches are almost equivalent.
491 \subsubsection{Solving sparse and full polynomials of the same size with CUDA-MPI}
493 In this experiment we compare the execution time of the EA algorithm
494 according to the number of GPUs to solve sparse and full
495 polynomials on multiples GPUs using MPI. We chose three sparse and full
496 polynomials of size 200K, 800K and 1,4M.
499 \includegraphics[angle=-90,width=0.5\textwidth]{MPI}
500 \caption{Execution times to solve sparse and full polynomials of three distinct sizes on multiple GPUs using MPI.}
503 In Figure~\ref{fig:07} we can see that CUDA-MPI can solve sparse and
504 full polynomials of high degrees, the execution times with sparse
505 polynomial are very low compared to full polynomials. With sparse
506 polynomials the number of monomials is reduced, consequently the number
507 of operations is reduced and the execution time decreases.
509 \subsubsection{Solving sparse and full polynomials of the same size with CUDA-OpenMP}
513 \includegraphics[angle=-90,width=0.5\textwidth]{OMP}
514 \caption{Execution time for solving sparse and full polynomials of three distinct sizes on multiple GPUs using OpenMP}
518 Figure ~\ref{fig:08} shows the impact of sparsity on the effectiveness of the CUDA-OpenMP approach. We can see that the impact follows the same pattern, a difference in execution time in favor of the sparse polynomials.
520 \subsection{Scalability of the EA method on multiple GPUs to solve very high degree polynomials}
521 These experiments report the execution times of the EA method for
522 sparse and full polynomials ranging from 1,000,000 to 5,000,000.
525 \includegraphics[angle=-90,width=0.5\textwidth]{big}
526 \caption{Execution times in seconds of the Ehrlich-Aberth method for solving full polynomials of high degree on 4 GPUs for sizes ranging from 1M to 5M}
529 In Figure~\ref{fig:09} we can see that both approaches are scalable
530 and can solve very high degree polynomials. In addition, with full polynomial as well as sparse ones, both
531 approaches give very similar results.
533 %SIDER JE viens de virer \c ca For sparse polynomials here are a noticeable difference in favour of MPI when the degree is
534 %above 4 millions. Between 1 and 3 millions, OpenMP is more effecient.
535 %Under 1 million, OpenMPI and MPI are almost equivalent.
537 %SIDER : il faut une explication sur les différences ici aussi.
542 In this paper, we have presented a parallel implementation of
543 Ehrlich-Aberth algorithm to solve full and sparse polynomials, on
544 single GPU with CUDA and on multiple GPUs using two parallel
545 paradigms: shared memory with OpenMP and distributed memory with
546 MPI. These architectures were addressed by a CUDA-OpenMP approach and
547 CUDA-MPI approach, respectively. Experiments show that, using
548 parallel programming model like (OpenMP, MPI). We can efficiently
549 manage multiple graphics cards to solve the same
550 problem and accelerate the parallel execution with 4 GPUs and solve a
551 polynomial of degree up to 5,000,000, four times faster than on single
555 Our next objective is to extend the model presented here with clusters
556 of GPU nodes, with a three-level scheme: inter-node communication via
557 MPI processes (distributed memory), management of multi-GPU node by
558 OpenMP threads (shared memory).
561 \section*{Acknowledgment}
563 Computations have been performed on the supercomputer facilities of
564 the Mésocentre de calcul de Franche-Comté. We also would like to thank
565 Nvidia for hardware donation under CUDA Research Center 2014.
569 \bibliography{mybibfile}
