DL: corrections sur section 4

diff --git a/paper.tex b/paper.tex
index 25bf4d15fef4fe511ebb2e022e2a6d5083f80554..93f215d5bab1aad50151e30a5ad25dab9d926025 100644 (file)
--- a/paper.tex
+++ b/paper.tex
@@ -223,22 +223,22 @@ consult~\cite{myBCCV05c,bahi07,ccl09:ij}.
 \label{sec:04}
 \subsection{Synchronous and asynchronous two-stage methods for sparse linear systems}
 \label{sec:04.01}
 \label{sec:04}
 \subsection{Synchronous and asynchronous two-stage methods for sparse linear systems}
 \label{sec:04.01}

-In this paper we focus on two-stage multisplitting methods in their both versions (synchronous and asynchronous)~\cite{Frommer92,Szyld92,Bru95}. These iterative methods are based on multisplitting methods~\cite{O'leary85,White86,Alefeld97} and use two nested iterations: the outer iteration and the inner iteration. Let us consider the following sparse linear system of $n$ equations in $\mathbb{R}$
+In this paper we focus on two-stage multisplitting methods in their both versions (synchronous and asynchronous)~\cite{Frommer92,Szyld92,Bru95}. These iterative methods are based on multisplitting methods~\cite{O'leary85,White86,Alefeld97} and use two nested iterations: the outer iteration and the inner iteration. Let us consider the following sparse linear system of $n$ equations in $\mathbb{R}$:

 \begin{equation}
 Ax=b,
 \label{eq:01}
 \end{equation}
 \begin{equation}
 Ax=b,
 \label{eq:01}
 \end{equation}

-where $A$ is a sparse square and nonsingular matrix, $b$ is the right-hand side and $x$ is the solution of the system. Our work in this paper is restricted to the block Jacobi splitting method. This approach of multisplitting consists in partitioning the matrix $A$ into $L$ horizontal band matrices of order $\frac{n}{L}\times n$ without overlapping (i.e. sub-vectors $\{x_\ell\}_{1\leq\ell\leq L}$ are disjoint). Two-stage multisplitting methods solve the linear system~(\ref{eq:01}) iteratively as follows
+where $A$ is a sparse square and nonsingular matrix, $b$ is the right-hand side and $x$ is the solution of the system. Our work in this paper is restricted to the block Jacobi splitting method. This approach of multisplitting consists in partitioning the matrix $A$ into $L$ horizontal band matrices of order $\frac{n}{L}\times n$ without overlapping (i.e. sub-vectors $\{x_\ell\}_{1\leq\ell\leq L}$ are disjoint). Two-stage multisplitting methods solve the linear system~(\ref{eq:01}) iteratively as follows:

 \begin{equation}
 x_\ell^{k+1} = A_{\ell\ell}^{-1}(b_\ell - \displaystyle\sum^{L}_{\substack{m=1\\m\neq\ell}}{A_{\ell m}x^k_m}),\mbox{~for~}\ell=1,\ldots,L\mbox{~and~}k=1,2,3,\ldots
 \label{eq:02}
 \end{equation}
 \begin{equation}
 x_\ell^{k+1} = A_{\ell\ell}^{-1}(b_\ell - \displaystyle\sum^{L}_{\substack{m=1\\m\neq\ell}}{A_{\ell m}x^k_m}),\mbox{~for~}\ell=1,\ldots,L\mbox{~and~}k=1,2,3,\ldots
 \label{eq:02}
 \end{equation}

-where $x_\ell$ are sub-vectors of the solution $x$, $b_\ell$ are the sub-vectors of the right-hand side $b$, and $A_{\ell\ell}$ and $A_{\ell m}$ are diagonal and off-diagonal blocks of matrix $A$ respectively. The iterations of these methods can naturally be computed in parallel such that each processor or cluster of processors is responsible for solving one splitting as a linear sub-system
+where $x_\ell$ are sub-vectors of the solution $x$, $b_\ell$ are the sub-vectors of the right-hand side $b$, and $A_{\ell\ell}$ and $A_{\ell m}$ are diagonal and off-diagonal blocks of matrix $A$ respectively. The iterations of these methods can naturally be computed in parallel such that each processor or cluster of processors is responsible for solving one splitting as a linear sub-system:

 \begin{equation}
 A_{\ell\ell} x_\ell = c_\ell,\mbox{~for~}\ell=1,\ldots,L,
 \label{eq:03}
 \end{equation}
 \begin{equation}
 A_{\ell\ell} x_\ell = c_\ell,\mbox{~for~}\ell=1,\ldots,L,
 \label{eq:03}
 \end{equation}

-where right-hand sides $c_\ell=b_\ell-\sum_{m\neq\ell}A_{\ell m}x_m$ are computed using the shared vectors $x_m$. In this paper, we use the well-known iterative method GMRES ({\it Generalized Minimal RESidual})~\cite{saad86} as an inner iteration to approximate the solutions of the different splittings arising from the block Jacobi multisplitting of matrix $A$. The algorithm in Figure~\ref{alg:01} shows the main key points of our block Jacobi two-stage method executed by a cluster of processors. In line~\ref{solve}, the linear sub-system~(\ref{eq:03}) is solved in parallel using GMRES method where $\MIG$ and $\TOLG$ are the maximum number of inner iterations and the tolerance threshold for GMRES respectively. The convergence of the two-stage multisplitting methods, based on synchronous or asynchronous iterations, is studied by many authors for example~\cite{Bru95,bahi07}.
+where right-hand sides $c_\ell=b_\ell-\sum_{m\neq\ell}A_{\ell m}x_m$ are computed using the shared vectors $x_m$. In this paper, we use the well-known iterative method GMRES ({\it Generalized Minimal RESidual})~\cite{saad86} as an inner iteration to approximate the solutions of the different splittings arising from the block Jacobi multisplitting of matrix $A$. The algorithm in Figure~\ref{alg:01} shows the main key points of our block Jacobi two-stage method executed by a cluster of processors. In line~\ref{solve}, the linear sub-system~(\ref{eq:03}) is solved in parallel using GMRES method where $\MIG$ and $\TOLG$ are the maximum number of inner iterations and the tolerance threshold for GMRES respectively. The convergence of the two-stage multisplitting methods, based on synchronous or asynchronous iterations, has been studied by many authors for example~\cite{Bru95,bahi07}.

 
 \begin{figure}[t]
 %\begin{algorithm}[t]
 
 \begin{figure}[t]
 %\begin{algorithm}[t]


@@ -259,19 +259,19 @@ where right-hand sides $c_\ell=b_\ell-\sum_{m\neq\ell}A_{\ell m}x_m$ are compute
 %\end{algorithm}
 \end{figure}
 
 %\end{algorithm}
 \end{figure}
 

-In this paper, we propose two algorithms of two-stage multisplitting methods. The first algorithm is based on the asynchronous model which allows the communications to be overlapped by computations and reduces the idle times resulting from the synchronizations. So in the asynchronous mode, our two-stage algorithm uses asynchronous outer iterations and asynchronous communications between clusters. The communications (i.e. lines~\ref{send} and~\ref{recv} in Figure~\ref{alg:01}) are performed by message passing using MPI non-blocking communication routines. The convergence of the asynchronous iterations is detected when all clusters have locally converged
+In this paper, we propose two algorithms of two-stage multisplitting methods. The first algorithm is based on the asynchronous model which allows communications to be overlapped by computations and reduces the idle times resulting from the synchronizations. So in the asynchronous mode, our two-stage algorithm uses asynchronous outer iterations and asynchronous communications between clusters. The communications (i.e. lines~\ref{send} and~\ref{recv} in Figure~\ref{alg:01}) are performed by message passing using MPI non-blocking communication routines. The convergence of the asynchronous iterations is detected when all clusters have locally converged:

 \begin{equation}
 k\geq\MIM\mbox{~or~}\|x_\ell^{k+1}-x_\ell^k\|_{\infty }\leq\TOLM,
 \label{eq:04}
 \end{equation}
 where $\MIM$ is the maximum number of outer iterations and $\TOLM$ is the tolerance threshold for the two-stage algorithm.
 
 \begin{equation}
 k\geq\MIM\mbox{~or~}\|x_\ell^{k+1}-x_\ell^k\|_{\infty }\leq\TOLM,
 \label{eq:04}
 \end{equation}
 where $\MIM$ is the maximum number of outer iterations and $\TOLM$ is the tolerance threshold for the two-stage algorithm.
 

-The second two-stage algorithm is based on synchronous outer iterations. We propose to use the Krylov iteration based on residual minimization to improve the slow convergence of the multisplitting methods. In this case, a $n\times s$ matrix $S$ is set using solutions issued from the inner iteration
+The second two-stage algorithm is based on synchronous outer iterations. We propose to use the Krylov iteration based on residual minimization to improve the slow convergence of the multisplitting methods. In this case, a $n\times s$ matrix $S$ is set using solutions issued from the inner iteration:

 \begin{equation}
 S=[x^1,x^2,\ldots,x^s],~s\ll n.
 \label{eq:05}
 \end{equation}
 \begin{equation}
 S=[x^1,x^2,\ldots,x^s],~s\ll n.
 \label{eq:05}
 \end{equation}

-At each $s$ outer iterations, the algorithm computes a new approximation $\tilde{x}=S\alpha$ which minimizes the residual
+At each $s$ outer iterations, the algorithm computes a new approximation $\tilde{x}=S\alpha$ which minimizes the residual:

 \begin{equation}
 \min_{\alpha\in\mathbb{R}^s}{\|b-AS\alpha\|_2}.
 \label{eq:06}
 \begin{equation}
 \min_{\alpha\in\mathbb{R}^s}{\|b-AS\alpha\|_2}.
 \label{eq:06}


@@ -304,11 +304,11 @@ The algorithm in Figure~\ref{alg:02} includes the procedure of the residual mini
 %\end{algorithm}
 \end{figure}
 
 %\end{algorithm}
 \end{figure}
 

-\subsection{Simulation of two-stage methods using SimGrid framework}
+\subsection{Simulation of the two-stage methods using SimGrid toolkit}

 \label{sec:04.02}
 
 One of our objectives when simulating the  application in Simgrid is, as in real
 \label{sec:04.02}
 
 One of our objectives when simulating the  application in Simgrid is, as in real

-life, to  get accurate results  (solutions of the  problem) but also  ensure the
+life, to  get accurate results  (solutions of the  problem) but also to ensure the

 test reproducibility  under the same  conditions.  According to  our experience,
 very  few modifications  are required  to adapt  a MPI  program for  the Simgrid
 simulator using SMPI (Simulator MPI). The  first modification is to include SMPI
 test reproducibility  under the same  conditions.  According to  our experience,
 very  few modifications  are required  to adapt  a MPI  program for  the Simgrid
 simulator using SMPI (Simulator MPI). The  first modification is to include SMPI


@@ -316,7 +316,7 @@ libraries  and related  header files  (smpi.h).  The  second modification  is to
 suppress all global variables by replacing  them with local variables or using a
 Simgrid      selector       called      "runtime       automatic      switching"
 (smpi/privatize\_global\_variables). Indeed, global  variables can generate side
 suppress all global variables by replacing  them with local variables or using a
 Simgrid      selector       called      "runtime       automatic      switching"
 (smpi/privatize\_global\_variables). Indeed, global  variables can generate side

-effects on runtime between the threads running in the same process, generated by
+effects on runtime between the threads running in the same process and generated by

 Simgrid  to simulate the  grid environment.
 
 %\RC{On vire cette  phrase ?} \RCE {Si c'est la phrase d'avant sur les threads, je pense qu'on peut la retenir car c'est l'explication du pourquoi Simgrid n'aime pas les variables globales. Si c'est pas bien dit, on peut la reformuler. Si c'est la phrase ci-apres, effectivement, on peut la virer si elle preterais a discussion}The
 Simgrid  to simulate the  grid environment.
 
 %\RC{On vire cette  phrase ?} \RCE {Si c'est la phrase d'avant sur les threads, je pense qu'on peut la retenir car c'est l'explication du pourquoi Simgrid n'aime pas les variables globales. Si c'est pas bien dit, on peut la reformuler. Si c'est la phrase ci-apres, effectivement, on peut la virer si elle preterais a discussion}The


@@ -345,11 +345,11 @@ In addition, the following arguments are given to the programs at runtime:
 \begin{itemize}
        \item maximum number of inner and outer iterations;
        \item inner and outer precisions;
 \begin{itemize}
        \item maximum number of inner and outer iterations;
        \item inner and outer precisions;

-       \item maximum number of the gmres's restarts in the Arnorldi process;
-       \item maximum number of iterations qnd the tolerance threshold in classical GMRES;
+       \item maximum number of the GMRES restarts in the Arnorldi process;
+       \item maximum number of iterations and the tolerance threshold in classical GMRES;

        \item tolerance threshold for outer and inner-iterations;
        \item tolerance threshold for outer and inner-iterations;

-       \item matrix size (N$_{x}$, N$_{y}$ and N$_{z}$) respectively on x, y, z axis;
-       \item matrix diagonal value = 6.0 for synchronous Krylov multisplitting experiments and 6.2 for asynchronous block Jacobi experiments; \RC{CE tu vérifies, je dis ca de tête}
+       \item matrix size (N$_{x}$, N$_{y}$ and N$_{z}$) respectively on $x, y, z$ axis;
+       \item matrix diagonal value is fixed to $6.0$ for synchronous Krylov multisplitting experiments and $6.2$ for asynchronous block Jacobi experiments; \RC{CE tu vérifies, je dis ca de tête}

        \item matrix off-diagonal value;
        \item execution mode: synchronous or asynchronous;
        \RCE {C'est ok la liste des arguments du programme mais si Lilia ou toi pouvez preciser pour les  arguments pour CGLS ci dessous} \RC{Vu que tu n'as pas fait varier ce paramètre, on peut ne pas en parler}
        \item matrix off-diagonal value;
        \item execution mode: synchronous or asynchronous;
        \RCE {C'est ok la liste des arguments du programme mais si Lilia ou toi pouvez preciser pour les  arguments pour CGLS ci dessous} \RC{Vu que tu n'as pas fait varier ce paramètre, on peut ne pas en parler}


@@ -357,7 +357,7 @@ In addition, the following arguments are given to the programs at runtime:
        \item Maximum number of iterations and tolerance threshold for CGLS.
 \end{itemize}
 
        \item Maximum number of iterations and tolerance threshold for CGLS.
 \end{itemize}
 

-It should also be noticed that both solvers have been executed with the Simgrid selector -cfg=smpi/running\_power which determines the computational power (here 19GFlops) of the simulator host machine.
+It should also be noticed that both solvers have been executed with the Simgrid selector \texttt{-cfg=smpi/running\_power} which determines the computational power (here 19GFlops) of the simulator host machine.

 
 %%%%%%%%%%%%%%%%%%%%%%%%%
 %%%%%%%%%%%%%%%%%%%%%%%%%
 
 %%%%%%%%%%%%%%%%%%%%%%%%%
 %%%%%%%%%%%%%%%%%%%%%%%%%