X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/rce2015.git/blobdiff_plain/8fea9efcf322d39d2866eca25f0bc6b448933e34..5d5e9c4422c136a79466b1956124f7d01b45f5f1:/paper.tex diff --git a/paper.tex b/paper.tex index f0602ca..ca1749c 100644 --- a/paper.tex +++ b/paper.tex @@ -532,15 +532,15 @@ and between distant clusters. This parameter is application dependent. \subsection{Comparison between GMRES and two-stage multisplitting algorithms in synchronous mode} In the scope of this paper, our first objective is to analyze when the synchronous Krylov two-stage method has better performance than the classical GMRES method. With a synchronous iterative method, better performance means a smaller number of iterations and execution time before reaching the convergence. -Table~\ref{tab:01} summarizes the parameters used in the different simulations: the grid architectures, the network of inter-clusters backbone links and the matrix sizes of the 3D Poisson problem. However, for all simulations we fix the network parameters of the intra-clusters links: the bandwidth $bw$=10Gbs and the latency $lat$=8$\times$10$^{-6}$. In what follows, we will present the test conditions, the output results and our comments. +Table~\ref{tab:01} summarizes the parameters used in the different simulations: the grid architectures, the network of inter-clusters backbone links and the matrix sizes of the 3D Poisson problem. However, for all simulations we fix the network parameters of the intra-clusters links: the bandwidth $bw$=10Gbs and the latency $lat=8\mu$s. In what follows, we will present the test conditions, the output results and our comments. \begin{table} [ht!] \begin{center} \begin{tabular}{ll} \hline Grid architecture & 2$\times$16, 4$\times$8, 4$\times$16 and 8$\times$8\\ -\multirow{2}{*}{Network inter-clusters} & $N1$: $bw$=10Gbs, $lat$=8$\times$10$^{-6}$ \\ - & $N2$: $bw$=1Gbs, $lat$=5$\times$10$^{-5}$ \\ +\multirow{2}{*}{Network inter-clusters} & $N1$: $bw$=10Gbs, $lat=8\mu$s \\ + & $N2$: $bw$=1Gbs, $lat=50\mu$s \\ \multirow{2}{*}{Matrix size} & $Mat1$: N$_{x}\times$N$_{y}\times$N$_{z}$=150$\times$150$\times$150\\ & $Mat2$: N$_{x}\times$N$_{y}\times$N$_{z}$=170$\times$170$\times$170 \\ \hline \end{tabular} @@ -592,7 +592,7 @@ efficient for distributed systems with high latency networks. \end{figure} \subsubsection{Network latency impacts on performance\\} -Figure~\ref{fig:03} shows the impact of the network latency on the performances of both algorithms. The simulation is conducted on a computational grid of 2 clusters of 16 processors each (i.e. configuration 2$\times$16) interconnected by a network of bandwidth $bw$=1Gbs to solve a 3D Poison problem of size $150^3$. According to the results, a degradation of the network latency from $8\times 10^{-6}$ to $6\times 10^{-5}$ implies an absolute execution time increase for both algorithms, but not with the same rate of degradation. The GMRES algorithm is more sensitive to the latency degradation than the Krylov two-stage algorithm. +Figure~\ref{fig:03} shows the impact of the network latency on the performances of both algorithms. The simulation is conducted on a computational grid of 2 clusters of 16 processors each (i.e. configuration 2$\times$16) interconnected by a network of bandwidth $bw$=1Gbs to solve a 3D Poisson problem of size $150^3$. According to the results, a degradation of the network latency from $8\mu$s to $60\mu$s implies an absolute execution time increase for both algorithms, but not with the same rate of degradation. The GMRES algorithm is more sensitive to the latency degradation than the Krylov two-stage algorithm. \begin{figure}[t] \centering @@ -601,7 +601,15 @@ Figure~\ref{fig:03} shows the impact of the network latency on the performances \label{fig:03} \end{figure} +\subsubsection{Network bandwidth impacts on performance\\} +Figure~\ref{fig:04} reports the results obtained for the simulation of a grid of 2$\times$16 processors interconnected by a network of latency $lat=50\mu$s to solve a 3D Poisson problem of size $150^3$. The results of increasing the network bandwidth from 1Gbs to 10Gbs show the performances improvement for both algorithms by reducing the execution times. However, the Krylov two-stage algorithm presents a better performance in the considered bandwidth interval with a gain of $40\%$ compared to only about $24\%$ for the classical GMRES algorithm. +\begin{figure}[t] +\centering +\includegraphics[width=100mm]{network_bandwith_impact_on_execution_time.pdf} +\caption{Network bandwith impacts on execution time} +\label{fig:04} +\end{figure} @@ -637,38 +645,9 @@ Figure~\ref{fig:03} shows the impact of the network latency on the performances -\subsubsection{Network bandwidth impacts on performance\\} -\begin{table} [ht!] -\centering -\begin{tabular}{r c } - \hline - Grid Architecture & 2 $\times$ 16\\ %\hline -\multirow{2}{*}{Inter Network N1} & $bw$=From 1Gbs to 10 Gbs \\ %\hline - & $lat$= 5.10$^{-5}$ second \\ - Input matrix size & $N_{x} \times N_{y} \times N_{z} =150 \times 150 \times 150$\\ \hline \\ - \end{tabular} -\caption{Test conditions: Network bandwidth impacts} -% \RC{Qu'est ce qui varie ici? Il n'y a pas de variation dans le tableau} -%\RCE{C est le bw} -\label{tab:04} -\end{table} -\begin{figure} [htbp] -\centering -\includegraphics[width=100mm]{network_bandwith_impact_on_execution_time.pdf} -\caption{Network bandwith impacts on execution time} -%\AG{``Execution time'' avec un 't' minuscule}. Idem autres figures.} -%\RCE{Corrige} -\label{fig:04} -\end{figure} - -The results of increasing the network bandwidth show the improvement of the -performance for both algorithms by reducing the execution time (see -Figure~\ref{fig:04}). However, in this case, the Krylov multisplitting method -presents a better performance in the considered bandwidth interval with a gain -of $40\%$ which is only around $24\%$ for the classical GMRES. \subsubsection{Input matrix size impacts on performance\\}