From: lilia Date: Sun, 2 Feb 2014 01:09:18 +0000 (+0100) Subject: 01-02-2014 X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/GMRES_For_Journal.git/commitdiff_plain/a73f0924e470a013a41e38377e1995ac30542588?ds=inline 01-02-2014 --- diff --git a/GMRES_Journal.tex b/GMRES_Journal.tex index 2b077f1..198f8b5 100644 --- a/GMRES_Journal.tex +++ b/GMRES_Journal.tex @@ -935,6 +935,14 @@ torso3 & 57.469 s & 16.828 s & {\bf 3.415} & 926.588 s \end{center} \end{table} +\begin{figure} +\centering + \includegraphics[width=120mm,keepaspectratio]{weak} +\caption{Weak scaling of the parallel GMRES algorithm on a GPU cluster.} +\label{fig:09} +\end{figure} + +\textcolor{red}{\bf Figure~\ref{fig:09} presents the weak scaling of four versions of the parallel GMRES algorithm on a GPU cluster. We fixed the size of a sub-matrix to 5 million of rows per GPU computing node. We used matrices having five bands generated from the symmetric matrix thermal2. This figure shows that the parallel GMRES algorithm in its naive version or using either the compression format for vectors or the hypergraph partitioning is not scalable on a GPU cluster due to the large amount of communications between GPUs. In contrast, we can see that the algorithm using both optimization techniques is fairly scalable. This means in this version the cost of communications is relatively constant regardless the number of computing nodes in the cluster.} \textcolor{red}{\bf Finally, the parallel solving of a linear system can be easy to optimize when the associated matrix is regular. This is unfortunately not the case of many real-world applications. When the matrix has an irregular structure, the amount of communication between processors is not the same. Another important parameter is the size of the matrix bandwidth which has a huge influence on the amount of communications. In this work, we have generated different kinds of matrices in order to analyze different difficulties. With as a large bandwidth as possible involving communications between all processors, which is the most difficult situation, we proposed to use two heuristics. Unfortunately, there is no fast method that optimizes the communication in any situation. For systems of non linear equations, there are different algorithms but most of them consist in linearizing the system of equations. In this case, a linear system needs to be solved. The big interest is that the matrix is the same at each step of the non linear system solving, so the partitioning method which is a time consuming step is performed once only. } diff --git a/weak.pdf b/weak.pdf new file mode 100644 index 0000000..5be3b00 Binary files /dev/null and b/weak.pdf differ