From: laiymani <laiymani@MacBook-Pro-de-laiymani.local>
Date: Mon, 28 Apr 2014 12:46:20 +0000 (+0200)
Subject: corrections
X-Git-Tag: hpcc2014_submission~43
X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/hpcc2014.git/commitdiff_plain/7509f7bc4a76338951fc145f7c10a932fe8144cc?ds=sidebyside;hp=--cc

corrections
---

7509f7bc4a76338951fc145f7c10a932fe8144cc
diff --git a/hpcc.tex b/hpcc.tex
index 81062de..98a55ff 100644
--- 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}
+
+\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*}
@@ -442,6 +444,8 @@ The parallel solving of the 3D Poisson problem with our multisplitting method re
 \end{figure}
 
 
+\subsection{Simulation of the multisplitting method using SimGrid and SMPI}
+
 
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%