\todo[color=blue!10,#1]{\sffamily\textbf{LZK:} #2}\xspace}
\newcommand{\RC}[2][inline]{%
\todo[color=red!10,#1]{\sffamily\textbf{RC:} #2}\xspace}
+\newcommand{\CER}[2][inline]{%
+ \todo[color=pink!10,#1]{\sffamily\textbf{CER:} #2}\xspace}
\algnewcommand\algorithmicinput{\textbf{Input:}}
\algnewcommand\Input{\item[\algorithmicinput]}
\RC{Ordre des auteurs pas définitif.}
\begin{abstract}
+\AG{L'abstract est AMHA incompréhensible et ne donne pas envie de lire la suite.}
In recent years, the scalability of large-scale implementation in a
distributed environment of algorithms becoming more and more complex has
always been hampered by the limits of physical computing resources
SimGrid toolkit~\cite{SimGrid}). Second, we confirm the effectiveness of
asynchronous mode algorithms by comparing their performance with the synchronous
mode. More precisely, we had implemented a program for solving large
-non-symmetric linear system of equations by numerical method GMRES (Generalized
-Minimal Residual) []\AG[]{[]?}. We show, that with minor modifications of the
+linear system of equations by numerical method GMRES (Generalized
+Minimal Residual) \cite{ref1}. We show, that with minor modifications of the
initial MPI code, the SimGrid toolkit allows us to perform a test campaign of a
real AIAC application on different computing architectures. The simulated
-results we obtained are in line with real results exposed in ??\AG[]{??}.
+results we obtained are in line with real results exposed in ??\AG[]{ref?}.
SimGrid had allowed us to launch the application from a modest computing
infrastructure by simulating different distributed architectures composed by
clusters nodes interconnected by variable speed networks. With selected
only the algorithm convergence within a reasonable time compared with the
physical environment performance, but also a time saving of up to \np[\%]{40} in
asynchronous mode.
+\AG{Il faudrait revoir la phrase précédente (couper en deux?). Là, on peut
+ avoir l'impression que le gain de \np[\%]{40} est entre une exécution réelle
+ et une exécution simulée!}
This article is structured as follows: after this introduction, the next section will give a brief description of
iterative asynchronous model. Then, the simulation framework SimGrid is presented with the settings to create various
\textit{Asynchronous Iterations~-- Asynchronous Communications (AIAC)} model. Here, local computations do not need to
wait for required data. Processors can then perform their iterations with the data present at that time. Figure~\ref{fig:aiac}
illustrates this model where the gray blocks represent the computation phases, the white spaces the idle
-times and the arrows the communications. With this algorithmic model, the number of iterations required before the
+times and the arrows the communications.
+\AG{There are no ``white spaces'' on the figure.}
+With this algorithmic model, the number of iterations required before the
convergence is generally greater than for the two former classes. But, and as detailed in~\cite{bcvc06:ij}, AIAC
algorithms can significantly reduce overall execution times by suppressing idle times due to synchronizations especially
in a grid computing context.
latency, and the routing strategy. The simulated running time of the
application is computed according to these properties.
-\AG{Faut-il ajouter quelque-chose ?}
+%%% TODO: add some words+refs about SimGrid's accuracy and scalability.}
+
+\AG{Faut-il ajouter quelque-chose ?}
+\CER{Comme tu as décrit la plateforme d'exécution, on peut ajouter éventuellement le fichier XML contenant des hosts dans les clusters formant la grille
+ \AG{Bof.}}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\section{Simulation of the multisplitting method}
\label{algo:01}
\end{figure}
-Algorithm on Figure~\ref{algo:01} shows the main key points of the
-multisplitting method to solve a large sparse linear system. This algorithm is
-based on an outer-inner iteration method where the parallel synchronous GMRES
-method is used to solve the inner iteration. It is executed in parallel by each
-cluster of processors. For all $l,m\in\{1,\ldots,L\}$, the matrices and vectors
-with the subscript $l$ represent the local data for cluster $l$, while
-$\{A_{lm}\}_{m\neq l}$ are off-diagonal matrices of sparse matrix $A$ and
-$\{X_m\}_{m\neq l}$ contain vector elements of solution $x$ shared with
-neighboring clusters. At every outer iteration $k$, asynchronous communications
-are performed between processors of the local cluster and those of distant
-clusters (lines~\ref{algo:01:send} and~\ref{algo:01:recv} in
-Figure~\ref{algo:01}). The shared vector elements of the solution $x$ are
-exchanged by message passing using MPI non-blocking communication routines.
+Algorithm on Figure~\ref{algo:01} shows the main key points of the multisplitting method to solve a large sparse linear system. This algorithm is based on an outer-inner iteration method where the parallel synchronous GMRES method is used to solve the inner iteration. It is executed in parallel by each cluster of processors. For all $l,m\in\{1,\ldots,L\}$, the matrices and vectors with the subscript $l$ represent the local data for cluster $l$, while $\{A_{lm}\}_{m\neq l}$ are off-diagonal matrices of sparse matrix $A$ and $\{X_m\}_{m\neq l}$ contain vector elements of solution $x$ shared with neighboring clusters. At every outer iteration $k$, asynchronous communications are performed between processors of the local cluster and those of distant clusters (lines~\ref{algo:01:send} and~\ref{algo:01:recv} in Figure~\ref{algo:01}). The shared vector elements of the solution $x$ are exchanged by message passing using MPI non-blocking communication routines.
\begin{figure}[!t]
\centering
the virtual ring from a master processor to another until the global convergence
is achieved. So starting from the cluster with rank 1, each master processor $i$
sets the token to \textit{True} if the local convergence is achieved or to
-\text\it{False} otherwise, and sends it to master processor $i+1$. Finally, the
+\textit{False} otherwise, and sends it to master processor $i+1$. Finally, the
global convergence is detected when the master of cluster 1 receives from the
master of cluster $L$ a token set to \textit{True}. In this case, the master of
cluster 1 broadcasts a stop message to masters of other clusters. In this work,
\begin{equation*}
(k\leq \MI) \text{ or } (\|X_l^k - X_l^{k+1}\|_{\infty}\leq\epsilon)
\end{equation*}
-where $\MI$ is the maximum number of outer iterations and $\epsilon$ is the tolerance threshold of the error computed between two successive local solution $X_l^k$ and $X_l^{k+1}$.
+where $\MI$ is the maximum number of outer iterations and $\epsilon$ is the
+tolerance threshold of the error computed between two successive local solution
+$X_l^k$ and $X_l^{k+1}$.
-\LZK{Description du processus d'adaptation de l'algo multisplitting à SimGrid}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
-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 the six neighbors of each point in a submatrix
-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. 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, all
-declared global variables have been moved to local variables for each
-subroutine. In fact, global variables generate side effects arising from the
-concurrent access of shared memory used by threads simulating each computing
-units in the SimGrid architecture. Second, the alignment of certain types of
-variables such as ``long int'' had also to be reviewed. Finally, some
-compilation errors on MPI\_Waitall and MPI\_Finalize primitives have been fixed
-with the latest version of SimGrid. 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 tested in synchronous
-mode with a simulated platform starting from a modest 2 or 3 clusters grid to a
-larger configuration like simulating Grid5000 with more than 1500 hosts with
-5000 cores~\cite{bolze2006grid}. Once the code debugging and adaptation were
-complete, the next section shows our methodology and experimental results.
+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.
+\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}
+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, all declared
+global variables have been moved to local variables for each subroutine. In fact, 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, the alignment of certain types of variables such as ``long int'' had
+also to be reviewed. Finally, some compilation errors on MPI\_Waitall and MPI\_Finalize primitives have been fixed with the latest version of SimGrid.
+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 tested in synchronous mode with a simulated platform starting from a modest 2 or 3 clusters grid to a larger configuration like simulating
+Grid5000 with more than 1500 hosts with 5000 cores~\cite{bolze2006grid}.
+
\section{Experimental results}
-When the \emph{real} application runs in the simulation environment and produces the expected results, varying the input
+When the \textit{real} application runs in the simulation environment and produces the expected results, varying the input
parameters and the program arguments allows us to compare outputs from the code execution. We have noticed from this
study that the results depend on the following parameters:
\begin{itemize}
\item Hosts power (GFlops) can also influence on the results.
\item Finally, when submitting job batches for execution, the arguments values
passed to the program like the maximum number of iterations or the
- \emph{external} precision are critical. They allow to ensure not only the
+ \textit{external} precision are critical. They allow to ensure not only the
convergence of the algorithm but also to get the main objective of the
experimentation of the simulation in having an execution time in asynchronous
less than in synchronous mode (i.e. speed-up less than 1).
\end{itemize}
+\LZK{Propositions pour remplacer le terme ``speedup'': acceleration ratio ou relative gain}
A priori, obtaining a speedup less 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
adopted was to launch the application on clustered network. In this last
configuration, degrading the inter-cluster network performance will
-\emph{penalize} the synchronous mode allowing to get a speedup lower than 1.
+\textit{penalize} the synchronous mode allowing to get a speedup lower than 1.
This action simulates the case of clusters linked with long distance network
like Internet.
+In this paper, we solve the 3D Poisson problem whose the mathematical model is
+\begin{equation}
+\left\{
+\begin{array}{l}
+\nabla^2 u = f \text{~in~} \Omega \\
+u =0 \text{~on~} \Gamma =\partial\Omega
+\end{array}
+\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
+\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)),
+\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.
+
+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.
+
+\begin{figure}[!t]
+\centering
+ \includegraphics[width=80mm,keepaspectratio]{partition}
+\caption{Example of the 3D data partitioning between two clusters of processors.}
+\label{fig:4.2}
+\end{figure}
+
+
As a first step, the algorithm was run on a network consisting of two clusters
containing 50 hosts each, totaling 100 hosts. Various combinations of the above
factors have providing the results shown in Table~\ref{tab.cluster.2x50} with a
\item Maximum number of internal and external iterations;
\item Internal and external precisions;
\item Matrix size $N_x$, $N_y$ and $N_z$;
+%<<<<<<< HEAD
\item Matrix diagonal value: \np{6.0};
+ \item Matrix Off-diagonal value: \np{-1.0};
+%=======
+%>>>>>>> 5fb6769d88c1720b6480a28521119ef010462fa6
\item Execution Mode: synchronous or asynchronous.
\end{itemize}
obtained with a bandwidth of \np[Mbit/s]{1} as shown in
Table~\ref{tab.cluster.3x67}.
+\LZK{Dans le papier, on compare les deux versions synchrone et asycnhrone du multisplitting. Y a t il des résultats pour comparer gmres parallèle classique avec multisplitting asynchrone? Ca permettra de montrer l'intérêt du multisplitting asynchrone sur des clusters distants}
+
\section{Conclusion}
The experimental results on executing a parallel iterative algorithm in
asynchronous mode on an environment simulating a large scale of virtual
tool to run efficiently an iterative parallel algorithm in asynchronous
mode in a grid architecture.
+\LZK{Perspectives???}
+
\section*{Acknowledgment}
This work is partially funded by the Labex ACTION program (contract ANR-11-LABX-01-01).
\todo[inline]{The authors would like to thank\dots{}}
-
% trigger a \newpage just before the given reference
% number - used to balance the columns on the last page
% adjust value as needed - may need to be readjusted if
\bibliographystyle{IEEEtran}
\bibliography{IEEEabrv,hpccBib}
+
+
\end{document}
%%% Local Variables:
