Replace obsolete font changing commands.

[hpcc2014.git] / hpcc.tex

diff --git a/hpcc.tex b/hpcc.tex
index 0072a6ff925ae3a7c9ca6ba2687ce4a4dd921a0c..aa6eb7de38f146964e5abee0896f0dfd98698e91 100644 (file)
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -151,8 +151,8 @@ approach of the simulation of AIAC algorithms using a simulation tool (i.e. the
 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
 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[]{[]?}\LZK[]{\cite{ref1}}.\LZK{Problème traité dans le papier est symétrique ou asymétrique? (Poisson 3D symétrique?)} 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[]{??}.
 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[]{??}.


@@ -331,17 +331,31 @@ Algorithm on Figure~\ref{algo:01} shows the main key points of the multisplittin
 \label{fig:4.1}
 \end{figure}
 
 \label{fig:4.1}
 \end{figure}
 

-The global convergence of the asynchronous multisplitting solver is detected when the clusters of processors have all converged locally. We implemented the global convergence detection process as follows. On each cluster a master processor is designated (for example the processor with rank 1) and masters of all clusters are interconnected by a virtual unidirectional ring network (see Figure~\ref{fig:4.1}). During the resolution, a Boolean token circulates around 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 {\it True} if the local convergence is achieved or to {\it 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 {\it True}. In this case, the master of cluster 1 broadcasts a stop message to masters of other clusters. In this work, the local convergence on each cluster $l$ is detected when the following condition is satisfied
+The global convergence of the asynchronous multisplitting solver is detected
+when the clusters of processors have all converged locally. We implemented the
+global convergence detection process as follows. On each cluster a master
+processor is designated (for example the processor with rank 1) and masters of
+all clusters are interconnected by a virtual unidirectional ring network (see
+Figure~\ref{fig:4.1}). During the resolution, a Boolean token circulates around
+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
+\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,
+the local convergence on each cluster $l$ is detected when the following
+condition is satisfied

 \begin{equation*}
   (k\leq \MI) \text{ or } (\|X_l^k - X_l^{k+1}\|_{\infty}\leq\epsilon)
 \end{equation*}
 \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}$.

 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 We did not encounter major blocking problems when adapting the multisplitting algorithm previously described to a simulation environment like SimGrid unless some code 
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 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 (left,right,front,behind,top,down) in a cubic partitionned submatrix within a cluster or between clusters, \CER{J'ai rajouté quelques précisions mais serait-il nécessaire de décrire a ce niveau la discrétisation 3D ?}
-\LZK{Non ce n'est pas nécessaire. A ce niveau, on décrit l'algorithme général de multisplitting. Donc, je pense qu'il est préférable de ne pas préciser le schéma de communication qui peut changer selon le type de problème. \\ {\bf Par exemple: 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 
+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}
 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}