corrections

diff --git a/hpcc.tex b/hpcc.tex
index 81062dea9d00385f4d765456f1fc4dfb33f5f44b..98a55ffbb349a02cd782250470521d87143b6d0f 100644 (file)
--- a/hpcc.tex
+++ b/hpcc.tex
@@ -288,6 +288,8 @@ These two techniques can help to run simulations at a very large scale.
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \section{Simulation of the multisplitting method}
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
 \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*}
 %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*}


@@ -442,6 +444,8 @@ The parallel solving of the 3D Poisson problem with our multisplitting method re
 \end{figure}
 
 
 \end{figure}
 
 

+\subsection{Simulation of the multisplitting method using SimGrid and SMPI}
+

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