+
\documentclass[conference]{IEEEtran}
\usepackage[T1]{fontenc}
To our knowledge, there is no existing work on the large-scale simulation of a
real asynchronous iterative application. {\bf The contribution of the present
- paper can be summarised in two main points}. First we give a first approach
+ paper can be summarized in two main points}. First we give a first approach
of the simulation of asynchronous iterative algorithms using a simulation tool
(i.e. the SimGrid toolkit~\cite{SimGrid}). Second, we confirm the
effectiveness of the asynchronous multisplitting algorithm by comparing its
-performance with the synchronous GMRES (Generalized Minimal Residual)
+performance with the synchronous GMRES (Generalized Minimal Residual) method
\cite{ref1}. Both these codes can be used to solve large linear systems. In
this paper, we focus on a 3D Poisson problem. We show, that with minor
modifications of the initial MPI code, the SimGrid toolkit allows us to perform
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\section{Simulation of the multisplitting method}
+
+\subsection{The multisplitting method}
%Décrire le problème (algo) traité ainsi que le processus d'adaptation à SimGrid.
Let $Ax=b$ be a large sparse system of $n$ linear equations in $\mathbb{R}$, where $A$ is a sparse square and nonsingular matrix, $x$ is the solution vector and $b$ is the right-hand side vector. We use a multisplitting method based on the block Jacobi splitting to solve this linear system on a large scale platform composed of $L$ clusters of processors~\cite{o1985multi}. In this case, we apply a row-by-row splitting without overlapping
\begin{equation*}
\right.
\label{eq:02}
\end{equation}
-where $\nabla^2$ is the Laplace operator, $f$ and $u$ are real-valued functions, and $\Omega=[0,1]^3$. The spatial discretization with a finite difference scheme reduces problem~(\ref{eq:02}) to a system of sparse linear equations. The general iteration scheme of our multisplitting method in a 3D domain using a seven point stencil could be written as
+where $\nabla^2$ is the Laplace operator, $f$ and $u$ are real-valued functions, and $\Omega=[0,1]^3$. The spatial discretization with a finite difference scheme reduces problem~(\ref{eq:02}) to a system of sparse linear equations. Our multisplitting method solves the 3D Poisson problem using a seven point stencil whose the general expression could be written as
\begin{equation}
-\begin{array}{ll}
-u^{k+1}(x,y,z)= & u^k(x,y,z) - \frac{1}{6}\times\\
- & (u^k(x-1,y,z) + u^k(x+1,y,z) + \\
- & u^k(x,y-1,z) + u^k(x,y+1,z) + \\
- & u^k(x,y,z-1) + u^k(x,y,z+1)),
+\begin{array}{l}
+u(x-1,y,z) + u(x,y-1,z) + u(x,y,z-1)\\+u(x+1,y,z)+u(x,y+1,z)+u(x,y,z+1) \\ -6u(x,y,z)=h^2f(x,y,z),
+%u(x,y,z)= & \frac{1}{6}\times [u(x-1,y,z) + u(x+1,y,z) + \\
+ % & u(x,y-1,z) + u(x,y+1,z) + \\
+ % & u(x,y,z-1) + u(x,y,z+1) - \\ & h^2f(x,y,z)],
\end{array}
\label{eq:03}
\end{equation}
-where the iteration matrix $A$ of size $N_x\times N_y\times N_z$ of the discretized linear system is sparse, symmetric and positive definite.
+where $h$ is the distance between two adjacent elements in the spatial discretization scheme and the iteration matrix $A$ of size $N_x\times N_y\times N_z$ of the discretized linear system is sparse, symmetric and positive definite.
The parallel solving of the 3D Poisson problem with our multisplitting method requires a data partitioning of the problem between clusters and between processors within a cluster. We have chosen the 3D partitioning instead of the row-by-row partitioning in order to reduce the data exchanges at sub-domain boundaries. Figure~\ref{fig:4.2} shows an example of the data partitioning of the 3D Poisson problem between two clusters of processors, where each sub-problem is assigned to a processor. In this context, a processor has at most six neighbors within a cluster or in distant clusters with which it shares data at sub-domain boundaries.
\end{figure}
+\subsection{Simulation of the multisplitting method using SimGrid and SMPI}
+
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
We did not encounter major blocking problems when adapting the multisplitting algorithm previously described to a simulation environment like SimGrid unless some code
-debugging. Indeed, apart from the review of the program sequence for asynchronous exchanges between processors within a cluster or between clusters, the algorithm was executed successfully with SMPI and provided identical outputs as those obtained with direct execution under MPI. In synchronous
-mode, the execution of the program raised no particular issue but in asynchronous mode, the review of the sequence of MPI\_Isend, MPI\_Irecv and MPI\_Waitall instructions
-and with the addition of the primitive MPI\_Test was needed to avoid a memory fault due to an infinite loop resulting from the non-convergence of the algorithm.
+debugging. Indeed, apart from the review of the program sequence for asynchronous exchanges between processors within a cluster or between clusters, the algorithm was executed successfully with SMPI and provided identical outputs as those obtained with direct execution under MPI. For the synchronous GMRES method, the execution of the program raised no particular issue but in the asynchronous multisplitting method , the review of the sequence of \texttt{MPI\_Isend, MPI\_Irecv} and \texttt{MPI\_Waitall} instructions
+and with the addition of the primitive \texttt{MPI\_Test} was needed to avoid a memory fault due to an infinite loop resulting from the non-convergence of the algorithm.
%\CER{On voulait en fait montrer la simplicité de l'adaptation de l'algo a SimGrid. Les problèmes rencontrés décrits dans ce paragraphe concerne surtout le mode async}\LZK{OK. J'aurais préféré avoir un peu plus de détails sur l'adaptation de la version async}
%\CER{Le problème majeur sur l'adaptation MPI vers SMPI pour la partie asynchrone de l'algorithme a été le plantage en SMPI de Waitall après un Isend et Irecv. J'avais proposé un workaround en utilisant un MPI\_wait séparé pour chaque échange a la place d'un waitall unique pour TOUTES les échanges, une instruction qui semble bien fonctionner en MPI. Ce workaround aussi fonctionne bien. Mais après, tu as modifié le programme avec l'ajout d'un MPI\_Test, au niveau de la routine de détection de la convergence et du coup, l'échange global avec waitall a aussi fonctionné.}
Note here that the use of SMPI functions optimizer for memory footprint and CPU usage is not recommended knowing that one wants to get real results by simulation.
-As mentioned, upon this adaptation, the algorithm is executed as in the real life in the simulated environment after the following minor changes. First, the scope of all declared
+As mentioned, upon this adaptation, the algorithm is executed as in the real life in the simulated environment after the following minor changes. The scope of all declared
global variables have been moved to local to subroutine. Indeed, global variables generate side effects arising from the concurrent access of
shared memory used by threads simulating each computing unit in the SimGrid architecture.
-Second, some compilation errors on MPI\_Waitall and MPI\_Finalize primitives have been fixed with the latest version of SimGrid.
-\AG{compilation or run-time error?}
+%Second, some compilation errors on MPI\_Waitall and MPI\_Finalize primitives have been fixed with the latest version of SimGrid.
+%\AG{compilation or run-time error?}
In total, the initial MPI program running on the simulation environment SMPI gave after a very simple adaptation the same results as those obtained in a real
-environment. We have successfully executed the code in synchronous mode using parallel GMRES algorithm compared with our multisplitting algorithm in asynchronous mode after few modifications.
+environment. We have successfully executed the code for the synchronous GMRES algorithm compared with our asynchronous multisplitting algorithm after few modifications.
\item Finally, when submitting job batches for execution, the arguments values
passed to the program like the maximum number of iterations or the precision are critical. They allow us to ensure not only the convergence of the
algorithm but also to get the main objective in getting an execution time in asynchronous communication less than in
- synchronous mode. The ratio between the execution time of synchronous
- compared to the asynchronous mode ($t_\text{sync} / t_\text{async}$) is defined as the \emph{relative gain}. So,
- our objective running the algorithm in SimGrid is to obtain a relative gain
- greater than 1.
-\end{itemize}
+ synchronous mode (i.e. GMRES).
+ \end{itemize}
+The ratio between the simulated execution time of synchronous GMRES algorithm
+compared to the asynchronous multisplitting algorithm ($t_\text{GMRES} / t_\text{Multisplitting}$) is defined as the \emph{relative gain}. So,
+our objective running the algorithm in SimGrid is to obtain a relative gain greater than 1.
A priori, obtaining a relative gain greater than 1 would be difficult in a local
area network configuration where the synchronous mode will take advantage on the
rapid exchange of information on such high-speed links. Thus, the methodology
simulates the case of distant clusters linked with long distance network as in grid computing context.
-% As a first step,
-The algorithm was run on a two clusters based network with 50 hosts each, totaling 100 hosts. Various combinations of the above
-factors have provided the results shown in Table~\ref{tab.cluster.2x50}. The algorithm convergence with a 3D
-matrix size ranging from $N_x = N_y = N_z = \text{62}$ to 150 elements (that is from
+
+Both codes were simulated on a two clusters based network with 50 hosts each, totaling 100 hosts. Various combinations of the above
+factors have provided the results shown in Table~\ref{tab.cluster.2x50}. The problem size of the 3D Poisson problem ranges from $N_x = N_y = N_z = \text{62}$ to 150 elements (that is from
$\text{62}^\text{3} = \text{\np{238328}}$ to $\text{150}^\text{3} =
-\text{\np{3375000}}$ entries), is obtained in asynchronous in average 2.5 times faster than in the synchronous mode.
-\AG{Expliquer comment lire les tableaux.}
-\CER{J'ai reformulé la phrase par la lecture du tableau. Plus de détails seront lus dans la partie Interprétations et commentaires}
+\text{\np{3375000}}$ entries). With the asynchronous multisplitting algorithm the simulated execution time is in average 2.5 times faster than with the synchronous GMRES one.
+%\AG{Expliquer comment lire les tableaux.}
+%\CER{J'ai reformulé la phrase par la lecture du tableau. Plus de détails seront lus dans la partie Interprétations et commentaires}
% use the same column width for the following three tables
\newlength{\mytablew}\settowidth{\mytablew}{\footnotesize\np{E-11}}
\newenvironment{mytable}[1]{% #1: number of columns for data
\begin{itemize}
\item HOSTFILE: Text file containing the list of the processors units name. Here 100 hosts;
-\item PLATFORM: XML file description of the platform architecture : two clusters (cluster1 and cluster2) with the following characteristics :
+\item PLATFORM: XML file description of the platform architecture whith the following characteristics: %two clusters (cluster1 and cluster2) with the following characteristics :
\begin{itemize}
- \item Processor unit power: \np[GFlops]{1.5};
- \item Intracluster network bandwidth: \np[Gbit/s]{1.25} and latency:
- \np[$\mu$s]{0.05};
- \item Intercluster network bandwidth: \np[Mbit/s]{5} and latency:
- \np[$\mu$s]{5};
+ \item 2 clusters of 50 hosts each;
+ \item Processor unit power: \np[GFlops]{1} or \np[GFlops]{1.5};
+ \item Intra-cluster network bandwidth: \np[Gbit/s]{1.25} and latency: \np[$\mu$s]{0.05};
+ \item Inter-cluster network bandwidth: \np[Mbit/s]{5} or \np[Mbit/s]{50} and latency: \np[$\mu$s]{20};
\end{itemize}
\end{itemize}
\begin{itemize}
\item Description of the cluster architecture matching the format <Number of
- cluster> <Number of hosts in cluster1> <Number of hosts in cluster2>;
+ clusters> <Number of hosts in cluster1> <Number of hosts in cluster2>;
\item Maximum number of iterations;
\item Precisions on the residual error;
\item Matrix size $N_x$, $N_y$ and $N_z$;
-\item Matrix diagonal value: \np{1.0} (See~(\ref{eq:03}));
-\item Matrix off-diagonal value: \np{-1}/\np{6} (See~(\ref{eq:03}));
+\item Matrix diagonal value: $6$ (See Equation~(\ref{eq:03}));
+\item Matrix off-diagonal value: $-1$;
\item Communication mode: asynchronous.
\end{itemize}
