X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/these_charles_emile.git/blobdiff_plain/b85aac77ff9f56f7c83108ff7d3c8732d3045889..c9389c5838efd5d6872ab508eaa000e3a769ed18:/These_RCE.aux

diff --git a/These_RCE.aux b/These_RCE.aux
index 97b0fdb..c0a8fff 100644
--- a/These_RCE.aux
+++ b/These_RCE.aux
@@ -24,17 +24,15 @@
 \@writefile{toc}{\select@language{french}}
 \@writefile{lof}{\select@language{french}}
 \@writefile{lot}{\select@language{french}}
-\@writefile{toc}{\contentsline {part}{I\hspace  {1em}Contexte scientifique et revue de l'\IeC {\'e}tat de l'art}{3}{part.1}}
+\@writefile{toc}{\contentsline {part}{I\hspace  {1em}PARTIE I: Contexte scientifique et revue de l'\IeC {\'e}tat de l'art}{3}{part.1}}
 \@writefile{toc}{\contentsline {chapter}{\numberline {1}Cadre de travail et contexte scientifique}{5}{chapter.1}}
 \@writefile{lof}{\addvspace {10\p@ }}
 \@writefile{lot}{\addvspace {10\p@ }}
 \@writefile{toc}{\contentsline {section}{\numberline {1.1}Classe des algorithmes it\IeC {\'e}ratifs parall\IeC {\`e}les \IeC {\`a} large \IeC {\'e}chelle dans une grille de calcul}{5}{section.1.1}}
 \newlabel{eq:1}{{1.1}{5}{Classe des algorithmes itératifs parallèles à large échelle dans une grille de calcul}{equation.1.1.1}{}}
 \@writefile{toc}{\contentsline {subsection}{\numberline {1.1.1}Partitionnement du probl\IeC {\`e}me}{6}{subsection.1.1.1}}
-\@writefile{lof}{\contentsline {figure}{\numberline {1.1}{\ignorespaces Partitionnement : D\IeC {\'e}coupage d'une matrice tridimensionnelle entre deux clusters form\IeC {\'e}s de 18 processeurs chacun}}{6}{figure.1.1}}
-\newlabel{fig:decoupage}{{1.1}{6}{Partitionnement : Découpage d'une matrice tridimensionnelle entre deux clusters formés de 18 processeurs chacun}{figure.1.1}{}}
-\@writefile{lof}{\contentsline {figure}{\numberline {1.2}{\ignorespaces Partitionnement : D\IeC {\'e}composition en domaines 1D, 2D et 3D}}{7}{figure.1.2}}
-\newlabel{fig:Decompo}{{1.2}{7}{Partitionnement : Décomposition en domaines 1D, 2D et 3D}{figure.1.2}{}}
+\@writefile{lof}{\contentsline {figure}{\numberline {1.1}{\ignorespaces D\IeC {\'e}coupage d'une matrice tridimensionnelle entre deux clusters form\IeC {\'e}s de 18 processeurs chacun}}{6}{figure.1.1}}
+\@writefile{lof}{\contentsline {figure}{\numberline {1.2}{\ignorespaces D\IeC {\'e}composition en domaines 1D, 2D et 3D}}{6}{figure.1.2}}
 \@writefile{toc}{\contentsline {subsection}{\numberline {1.1.2}Modes d'ex\IeC {\'e}cution synchrone et asynchrone}{7}{subsection.1.1.2}}
 \@writefile{lof}{\contentsline {figure}{\numberline {1.3}{\ignorespaces Mod\IeC {\`e}le de communication synchrone}}{8}{figure.1.3}}
 \newlabel{fig:sync}{{1.3}{8}{Modèle de communication synchrone}{figure.1.3}{}}
@@ -42,88 +40,112 @@
 \newlabel{fig:async}{{1.4}{9}{Modèle de communication asynchrone}{figure.1.4}{}}
 \@writefile{toc}{\contentsline {section}{\numberline {1.2}M\IeC {\'e}thodes de r\IeC {\'e}solution parall\IeC {\`e}les du probl\IeC {\`e}me de Poisson et de l'algorithme two-stage multisplitting de Krylov}{9}{section.1.2}}
 \@writefile{toc}{\contentsline {subsection}{\numberline {1.2.1}Algorithme de Jacobi}{9}{subsection.1.2.1}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {1.2.2}M\IeC {\'e}thode de r\IeC {\'e}solution GMRES}{9}{subsection.1.2.2}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {1.2.3}Solveur multisplitting}{9}{subsection.1.2.3}}
-\@writefile{toc}{\contentsline {section}{\numberline {1.3}SIMGRID/SMPI : Simulateur d'ex\IeC {\'e}cution d'algorithmes parall\IeC {\`e}les MPI dans une grille de calcul}{10}{section.1.3}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {1.3.1}MPI - Message Passing Interface}{10}{subsection.1.3.1}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {1.3.2}Simulateur SIMGRID}{10}{subsection.1.3.2}}
-\@writefile{toc}{\contentsline {section}{\numberline {1.4}Motivations}{10}{section.1.4}}
-\@writefile{toc}{\contentsline {section}{\numberline {1.5}Conclusion partielle}{10}{section.1.5}}
-\@writefile{toc}{\contentsline {chapter}{\numberline {2}Etat de l'art et travaux de recherche associ\IeC {\'e}s}{11}{chapter.2}}
+\newlabel{eq:2}{{1.8}{9}{Algorithme de Jacobi}{equation.1.2.8}{}}
+\newlabel{eq:3}{{1.9}{10}{Algorithme de Jacobi}{equation.1.2.9}{}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {1.2.2}M\IeC {\'e}thode de r\IeC {\'e}solution GMRES}{10}{subsection.1.2.2}}
+\@writefile{lof}{\contentsline {figure}{\numberline {1.5}{\ignorespaces Algorithme it\IeC {\'e}ratif de Jacobi}}{11}{figure.1.5}}
+\newlabel{algo:01}{{1.5}{11}{Algorithme itératif de Jacobi}{figure.1.5}{}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {1.2.3}Solveur multisplitting}{11}{subsection.1.2.3}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.3}Simulateurs d'ex\IeC {\'e}cution d'algorithmes parall\IeC {\`e}les MPI dans une grille de calcul}{11}{section.1.3}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {1.3.1}Calcul sur grille}{11}{subsection.1.3.1}}
+\@writefile{lof}{\contentsline {figure}{\numberline {1.6}{\ignorespaces Architecture d'une grille de calcul}}{12}{figure.1.6}}
+\newlabel{fig:gridA}{{1.6}{12}{Architecture d'une grille de calcul}{figure.1.6}{}}
+\@writefile{lof}{\contentsline {figure}{\numberline {1.7}{\ignorespaces Grid'5000 : R\IeC {\'e}partition g\IeC {\'e}ographique}}{13}{figure.1.7}}
+\newlabel{fig:grid5000RG}{{1.7}{13}{Grid'5000 : Répartition géographique}{figure.1.7}{}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {1.3.2}G\IeC {\'e}n\IeC {\'e}ralit\IeC {\'e}s sur la simulation}{13}{subsection.1.3.2}}
+\newlabel{eqsim}{{1.11}{14}{Généralités sur la simulation}{equation.1.3.11}{}}
+\@writefile{lot}{\contentsline {table}{\numberline {1.1}{\ignorespaces Quelques outils de simulation pour une grille de calcul}}{15}{table.1.1}}
+\newlabel{table1}{{1.1}{15}{Quelques outils de simulation pour une grille de calcul}{table.1.1}{}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {1.3.3}MPI - Message Passing Interface}{15}{subsection.1.3.3}}
+\@writefile{lof}{\contentsline {figure}{\numberline {1.8}{\ignorespaces Groupes et communicateur (a) - MPI - Op\IeC {\'e}rations collectives (b)}}{16}{figure.1.8}}
+\newlabel{fig:MPI}{{1.8}{16}{Groupes et communicateur (a) - MPI - Opérations collectives (b)}{figure.1.8}{}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {1.3.4}Simulateur SIMGRID - SMPI}{17}{subsection.1.3.4}}
+\@writefile{lof}{\contentsline {figure}{\numberline {1.9}{\ignorespaces SIMGRID : Les \IeC {\'e}l\IeC {\'e}ments de la plateforme de simulation}}{18}{figure.1.9}}
+\newlabel{fig:simgrid1}{{1.9}{18}{SIMGRID : Les éléments de la plateforme de simulation}{figure.1.9}{}}
+\@writefile{toc}{\contentsline {section}{\numberline {1.4}Conclusion partielle}{19}{section.1.4}}
+\@writefile{toc}{\contentsline {chapter}{\numberline {2}Etat de l'art et travaux de recherche associ\IeC {\'e}s}{21}{chapter.2}}
 \@writefile{lof}{\addvspace {10\p@ }}
 \@writefile{lot}{\addvspace {10\p@ }}
-\@writefile{toc}{\contentsline {section}{\numberline {2.1}Concepts et d\IeC {\'e}finitions}{11}{section.2.1}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {2.1.1}Performance de l'application parall\IeC {\`e}le et scalabilit\IeC {\'e}}{11}{subsection.2.1.1}}
-\newlabel{eq:5}{{2.1}{11}{Performance de l'application parallèle et scalabilité}{equation.2.1.1}{}}
-\newlabel{eq:6}{{2.2}{12}{Performance de l'application parallèle et scalabilité}{equation.2.1.2}{}}
-\newlabel{eq:7}{{2.3}{12}{Performance de l'application parallèle et scalabilité}{equation.2.1.3}{}}
-\newlabel{eq:8}{{2.4}{12}{Performance de l'application parallèle et scalabilité}{equation.2.1.4}{}}
-\newlabel{eq:9}{{2.5}{13}{Performance de l'application parallèle et scalabilité}{equation.2.1.5}{}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {2.1.2}Taux d'erreur lors de la pr\IeC {\'e}diction}{13}{subsection.2.1.2}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {2.1.3}Weak contre strong scaling}{13}{subsection.2.1.3}}
-\@writefile{lof}{\contentsline {figure}{\numberline {2.1}{\ignorespaces Weak vs Strong scaling: Temps d'ex\IeC {\'e}cution et Speedup}}{14}{figure.2.1}}
-\newlabel{fig:scaling}{{2.1}{14}{Weak vs Strong scaling: Temps d'exécution et Speedup}{figure.2.1}{}}
-\@writefile{toc}{\contentsline {section}{\numberline {2.2}Probl\IeC {\'e}matique sur la pr\IeC {\'e}diction \IeC {\`a} large \IeC {\'e}chelle de la performance des applications}{14}{section.2.2}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {2.2.1}Facteurs li\IeC {\'e}s \IeC {\`a} l'\IeC {\'e}cosyst\IeC {\`e}me}{15}{subsection.2.2.1}}
-\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.1.1}Facteur architecture des processeurs}{16}{subsubsection.2.2.1.1}}
-\@writefile{lof}{\contentsline {figure}{\numberline {2.2}{\ignorespaces Architecture des CPU multicoeurs}}{17}{figure.2.2}}
-\newlabel{fig:cpumulti}{{2.2}{17}{Architecture des CPU multicoeurs}{figure.2.2}{}}
-\@writefile{lof}{\contentsline {figure}{\numberline {2.3}{\ignorespaces Mod\IeC {\`e}le MIMD Distribu\IeC {\'e}}}{18}{figure.2.3}}
-\newlabel{fig:MIMDDM}{{2.3}{18}{Modèle MIMD Distribué}{figure.2.3}{}}
-\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.1.2}Facteur : M\IeC {\'e}moire et stockage}{18}{subsubsection.2.2.1.2}}
-\@writefile{lof}{\contentsline {figure}{\numberline {2.4}{\ignorespaces Mod\IeC {\`e}le MIMD partag\IeC {\'e}}}{19}{figure.2.4}}
-\newlabel{fig:MIMDSM}{{2.4}{19}{Modèle MIMD partagé}{figure.2.4}{}}
-\@writefile{lof}{\contentsline {figure}{\numberline {2.5}{\ignorespaces Mod\IeC {\`e}le MIMD hybride}}{20}{figure.2.5}}
-\newlabel{fig:MIMDHY}{{2.5}{20}{Modèle MIMD hybride}{figure.2.5}{}}
-\@writefile{lof}{\contentsline {figure}{\numberline {2.6}{\ignorespaces Evolution de la puissance de calcul mondiale}}{21}{figure.2.6}}
-\newlabel{fig:power}{{2.6}{21}{Evolution de la puissance de calcul mondiale}{figure.2.6}{}}
-\@writefile{lof}{\contentsline {figure}{\numberline {2.7}{\ignorespaces M\IeC {\'e}moire MIMD: Architecture UMA}}{22}{figure.2.7}}
-\newlabel{fig:UMA}{{2.7}{22}{Mémoire MIMD: Architecture UMA}{figure.2.7}{}}
-\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.1.3}Facteur : R\IeC {\'e}seaux de communication}{22}{subsubsection.2.2.1.3}}
-\@writefile{toc}{\contentsline {subsection}{\numberline {2.2.2}Facteurs li\IeC {\'e}s au code de l'application}{22}{subsection.2.2.2}}
-\@writefile{lof}{\contentsline {figure}{\numberline {2.8}{\ignorespaces M\IeC {\'e}moire MIMD: Architecture NUMA}}{23}{figure.2.8}}
-\newlabel{fig:NUMA}{{2.8}{23}{Mémoire MIMD: Architecture NUMA}{figure.2.8}{}}
-\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.2.1}Facteur : Taille du probl\IeC {\`e}me}{23}{subsubsection.2.2.2.1}}
-\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.2.2}Performance de la parall\IeC {\'e}lisation}{23}{subsubsection.2.2.2.2}}
-\newlabel{eq:10}{{2.6}{23}{Performance de la parallélisation}{equation.2.2.6}{}}
-\@writefile{lof}{\contentsline {figure}{\numberline {2.9}{\ignorespaces M\IeC {\'e}moire MIMD: Architecture COMA}}{24}{figure.2.9}}
-\newlabel{fig:COMA}{{2.9}{24}{Mémoire MIMD: Architecture COMA}{figure.2.9}{}}
-\newlabel{eq:11}{{2.7}{24}{Performance de la parallélisation}{equation.2.2.7}{}}
-\newlabel{eq:12}{{2.8}{24}{Performance de la parallélisation}{equation.2.2.8}{}}
-\newlabel{eq:12}{{2.9}{25}{Performance de la parallélisation}{equation.2.2.9}{}}
-\@writefile{toc}{\contentsline {section}{\numberline {2.3}Techniques de profiling et instrumentation des applications parall\IeC {\`e}les}{26}{section.2.3}}
-\@writefile{toc}{\contentsline {section}{\numberline {2.4}M\IeC {\'e}thodes de pr\IeC {\'e}diction de la performance de l'application parall\IeC {\`e}le}{26}{section.2.4}}
-\@writefile{toc}{\contentsline {section}{\numberline {2.5}Conclusion partielle}{26}{section.2.5}}
-\@writefile{toc}{\contentsline {part}{II\hspace  {1em}PARTIE II - Travaux de contributions, r\IeC {\'e}sultats et perspectives}{27}{part.2}}
-\@writefile{toc}{\contentsline {chapter}{\numberline {3}Comparaison par simulation \IeC {\`a} large \IeC {\'e}chelle de la performance de deux algorithmes it\IeC {\'e}ratifs parall\IeC {\`e}les en mode asynchrone}{29}{chapter.3}}
+\@writefile{toc}{\contentsline {section}{\numberline {2.1}Concepts et d\IeC {\'e}finitions}{21}{section.2.1}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {2.1.1}Performance de l'application parall\IeC {\`e}le et scalabilit\IeC {\'e}}{21}{subsection.2.1.1}}
+\newlabel{eq:5}{{2.1}{21}{Performance de l'application parallèle et scalabilité}{equation.2.1.1}{}}
+\newlabel{eq:6}{{2.2}{22}{Performance de l'application parallèle et scalabilité}{equation.2.1.2}{}}
+\newlabel{eq:7}{{2.3}{22}{Performance de l'application parallèle et scalabilité}{equation.2.1.3}{}}
+\newlabel{eq:8}{{2.4}{22}{Performance de l'application parallèle et scalabilité}{equation.2.1.4}{}}
+\newlabel{eq:9}{{2.5}{23}{Performance de l'application parallèle et scalabilité}{equation.2.1.5}{}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {2.1.2}Taux d'erreur lors de la pr\IeC {\'e}diction}{23}{subsection.2.1.2}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {2.1.3}Weak contre strong scaling}{23}{subsection.2.1.3}}
+\@writefile{lof}{\contentsline {figure}{\numberline {2.1}{\ignorespaces Weak vs Strong scaling: Temps d'ex\IeC {\'e}cution et Speedup}}{24}{figure.2.1}}
+\newlabel{fig:scaling}{{2.1}{24}{Weak vs Strong scaling: Temps d'exécution et Speedup}{figure.2.1}{}}
+\@writefile{toc}{\contentsline {section}{\numberline {2.2}Probl\IeC {\'e}matique sur la pr\IeC {\'e}diction \IeC {\`a} large \IeC {\'e}chelle de la performance des applications}{24}{section.2.2}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {2.2.1}Facteurs li\IeC {\'e}s \IeC {\`a} l'\IeC {\'e}cosyst\IeC {\`e}me}{25}{subsection.2.2.1}}
+\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.1.1}Facteur architecture des processeurs}{26}{subsubsection.2.2.1.1}}
+\@writefile{lof}{\contentsline {figure}{\numberline {2.2}{\ignorespaces Architecture des CPU multicoeurs}}{27}{figure.2.2}}
+\newlabel{fig:cpumulti}{{2.2}{27}{Architecture des CPU multicoeurs}{figure.2.2}{}}
+\@writefile{lof}{\contentsline {figure}{\numberline {2.3}{\ignorespaces Mod\IeC {\`e}le MIMD Distribu\IeC {\'e}}}{28}{figure.2.3}}
+\newlabel{fig:MIMDDM}{{2.3}{28}{Modèle MIMD Distribué}{figure.2.3}{}}
+\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.1.2}Facteur : M\IeC {\'e}moire et stockage}{28}{subsubsection.2.2.1.2}}
+\@writefile{lof}{\contentsline {figure}{\numberline {2.4}{\ignorespaces Mod\IeC {\`e}le MIMD partag\IeC {\'e}}}{29}{figure.2.4}}
+\newlabel{fig:MIMDSM}{{2.4}{29}{Modèle MIMD partagé}{figure.2.4}{}}
+\@writefile{lof}{\contentsline {figure}{\numberline {2.5}{\ignorespaces Mod\IeC {\`e}le MIMD hybride}}{30}{figure.2.5}}
+\newlabel{fig:MIMDHY}{{2.5}{30}{Modèle MIMD hybride}{figure.2.5}{}}
+\@writefile{lof}{\contentsline {figure}{\numberline {2.6}{\ignorespaces Evolution de la puissance de calcul mondiale}}{31}{figure.2.6}}
+\newlabel{fig:power}{{2.6}{31}{Evolution de la puissance de calcul mondiale}{figure.2.6}{}}
+\@writefile{lof}{\contentsline {figure}{\numberline {2.7}{\ignorespaces M\IeC {\'e}moire MIMD: Architecture UMA}}{32}{figure.2.7}}
+\newlabel{fig:UMA}{{2.7}{32}{Mémoire MIMD: Architecture UMA}{figure.2.7}{}}
+\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.1.3}Facteur : R\IeC {\'e}seaux de communication}{32}{subsubsection.2.2.1.3}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {2.2.2}Facteurs li\IeC {\'e}s au code de l'application}{32}{subsection.2.2.2}}
+\@writefile{lof}{\contentsline {figure}{\numberline {2.8}{\ignorespaces M\IeC {\'e}moire MIMD: Architecture NUMA}}{33}{figure.2.8}}
+\newlabel{fig:NUMA}{{2.8}{33}{Mémoire MIMD: Architecture NUMA}{figure.2.8}{}}
+\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.2.1}Facteur : Taille du probl\IeC {\`e}me}{33}{subsubsection.2.2.2.1}}
+\@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.2.2}Performance de la parall\IeC {\'e}lisation}{33}{subsubsection.2.2.2.2}}
+\newlabel{eq:10}{{2.6}{33}{Performance de la parallélisation}{equation.2.2.6}{}}
+\@writefile{lof}{\contentsline {figure}{\numberline {2.9}{\ignorespaces M\IeC {\'e}moire MIMD: Architecture COMA}}{34}{figure.2.9}}
+\newlabel{fig:COMA}{{2.9}{34}{Mémoire MIMD: Architecture COMA}{figure.2.9}{}}
+\newlabel{eq:11}{{2.7}{34}{Performance de la parallélisation}{equation.2.2.7}{}}
+\newlabel{eq:12}{{2.8}{34}{Performance de la parallélisation}{equation.2.2.8}{}}
+\newlabel{eq:12}{{2.9}{35}{Performance de la parallélisation}{equation.2.2.9}{}}
+\@writefile{toc}{\contentsline {section}{\numberline {2.3}Techniques d'analyse de performance des applications parall\IeC {\`e}les}{36}{section.2.3}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {2.3.1}G\IeC {\'e}n\IeC {\'e}ralit\IeC {\'e}s et objectifs}{36}{subsection.2.3.1}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {2.3.2}Approches et m\IeC {\'e}thodologie}{36}{subsection.2.3.2}}
+\@writefile{lof}{\contentsline {figure}{\numberline {2.10}{\ignorespaces Classification des techniques d'analyse de la performance}}{37}{figure.2.10}}
+\newlabel{fig:anaperf}{{2.10}{37}{Classification des techniques d'analyse de la performance}{figure.2.10}{}}
+\@writefile{toc}{\contentsline {subsection}{\numberline {2.3.3}Quelques outils d'analyse de performance}{38}{subsection.2.3.3}}
+\@writefile{toc}{\contentsline {section}{\numberline {2.4}M\IeC {\'e}thodes de pr\IeC {\'e}diction de la performance des applications parall\IeC {\`e}les}{39}{section.2.4}}
+\@writefile{toc}{\contentsline {section}{\numberline {2.5}Conclusion partielle}{39}{section.2.5}}
+\@writefile{toc}{\contentsline {chapter}{\numberline {3}Motivations}{41}{chapter.3}}
 \@writefile{lof}{\addvspace {10\p@ }}
 \@writefile{lot}{\addvspace {10\p@ }}
-\@writefile{toc}{\contentsline {section}{\numberline {3.1}Protocoles et exp\IeC {\'e}rimentations}{29}{section.3.1}}
-\@writefile{toc}{\contentsline {section}{\numberline {3.2}R\IeC {\'e}sultats}{29}{section.3.2}}
-\@writefile{toc}{\contentsline {section}{\numberline {3.3}Conclusion partielle}{29}{section.3.3}}
-\@writefile{toc}{\contentsline {chapter}{\numberline {4}Simulation avec SIMGRID de l\textquoteright ex\IeC {\'e}cution des solveurs lin\IeC {\'e}aires en mode synchrone et asynchrone sur un environnement multi-coeurs simul\IeC {\'e}s}{31}{chapter.4}}
+\@writefile{toc}{\contentsline {part}{II\hspace  {1em}PARTIE II - Travaux de contributions, r\IeC {\'e}sultats et perspectives}{43}{part.2}}
+\@writefile{toc}{\contentsline {chapter}{\numberline {4}Comparaison par simulation \IeC {\`a} large \IeC {\'e}chelle de la performance de deux algorithmes it\IeC {\'e}ratifs parall\IeC {\`e}les en mode asynchrone}{45}{chapter.4}}
 \@writefile{lof}{\addvspace {10\p@ }}
 \@writefile{lot}{\addvspace {10\p@ }}
-\@writefile{toc}{\contentsline {section}{\numberline {4.1}Protocoles et exp\IeC {\'e}rimentations}{31}{section.4.1}}
-\@writefile{toc}{\contentsline {section}{\numberline {4.2}R\IeC {\'e}sultats}{31}{section.4.2}}
-\@writefile{toc}{\contentsline {section}{\numberline {4.3}Conclusion partielle}{31}{section.4.3}}
-\@writefile{toc}{\contentsline {chapter}{\numberline {5}Mod\IeC {\`e}le de pr\IeC {\'e}diction de la performance \IeC {\`a} large \IeC {\'e}chelle d'un algorithme it\IeC {\'e}ratif parall\IeC {\`e}le}{33}{chapter.5}}
+\@writefile{toc}{\contentsline {section}{\numberline {4.1}Protocoles et exp\IeC {\'e}rimentations}{45}{section.4.1}}
+\@writefile{toc}{\contentsline {section}{\numberline {4.2}R\IeC {\'e}sultats}{45}{section.4.2}}
+\@writefile{toc}{\contentsline {section}{\numberline {4.3}Conclusion partielle}{45}{section.4.3}}
+\@writefile{toc}{\contentsline {chapter}{\numberline {5}Simulation avec SIMGRID de l\textquoteright ex\IeC {\'e}cution des solveurs lin\IeC {\'e}aires en mode synchrone et asynchrone sur un environnement multi-coeurs simul\IeC {\'e}s}{47}{chapter.5}}
 \@writefile{lof}{\addvspace {10\p@ }}
 \@writefile{lot}{\addvspace {10\p@ }}
-\@writefile{toc}{\contentsline {section}{\numberline {5.1}Approche et m\IeC {\'e}thodologie}{33}{section.5.1}}
-\@writefile{toc}{\contentsline {section}{\numberline {5.2}Exp\IeC {\'e}rimentations et r\IeC {\'e}sultats}{33}{section.5.2}}
-\@writefile{toc}{\contentsline {section}{\numberline {5.3}Conclusion partielle}{33}{section.5.3}}
-\@writefile{toc}{\contentsline {chapter}{\numberline {6}Conclusion g\IeC {\'e}n\IeC {\'e}rale et perspectives}{35}{chapter.6}}
+\@writefile{toc}{\contentsline {section}{\numberline {5.1}Protocoles et exp\IeC {\'e}rimentations}{47}{section.5.1}}
+\@writefile{toc}{\contentsline {section}{\numberline {5.2}R\IeC {\'e}sultats}{47}{section.5.2}}
+\@writefile{toc}{\contentsline {section}{\numberline {5.3}Conclusion partielle}{47}{section.5.3}}
+\@writefile{toc}{\contentsline {chapter}{\numberline {6}Mod\IeC {\`e}le de pr\IeC {\'e}diction de la performance \IeC {\`a} large \IeC {\'e}chelle d'un algorithme it\IeC {\'e}ratif parall\IeC {\`e}le}{49}{chapter.6}}
 \@writefile{lof}{\addvspace {10\p@ }}
 \@writefile{lot}{\addvspace {10\p@ }}
-\@writefile{toc}{\contentsline {section}{\numberline {6.1}Conclusion g\IeC {\'e}n\IeC {\'e}rale}{35}{section.6.1}}
-\@writefile{toc}{\contentsline {section}{\numberline {6.2}Travaux futurs et perspectives}{35}{section.6.2}}
+\@writefile{toc}{\contentsline {section}{\numberline {6.1}Approche et m\IeC {\'e}thodologie}{49}{section.6.1}}
+\@writefile{toc}{\contentsline {section}{\numberline {6.2}Exp\IeC {\'e}rimentations et r\IeC {\'e}sultats}{49}{section.6.2}}
+\@writefile{toc}{\contentsline {section}{\numberline {6.3}Conclusion partielle}{49}{section.6.3}}
+\@writefile{toc}{\contentsline {chapter}{\numberline {7}Conclusion g\IeC {\'e}n\IeC {\'e}rale et perspectives}{51}{chapter.7}}
+\@writefile{lof}{\addvspace {10\p@ }}
+\@writefile{lot}{\addvspace {10\p@ }}
+\@writefile{toc}{\contentsline {section}{\numberline {7.1}Conclusion g\IeC {\'e}n\IeC {\'e}rale}{51}{section.7.1}}
+\@writefile{toc}{\contentsline {section}{\numberline {7.2}Travaux futurs et perspectives}{51}{section.7.2}}
 \bibstyle{phdthesisapa}
 \bibdata{biblio.bib}
-\@writefile{toc}{\contentsline {part}{III\hspace  {1em}Annexes}{47}{part.3}}
-\@writefile{toc}{\contentsline {chapter}{\numberline {A}Premier chapitre des annexes}{49}{appendix.A}}
+\@writefile{toc}{\contentsline {part}{III\hspace  {1em}Annexes}{65}{part.3}}
+\@writefile{toc}{\contentsline {chapter}{\numberline {A}Premier chapitre des annexes}{67}{appendix.A}}
 \@writefile{lof}{\addvspace {10\p@ }}
 \@writefile{lot}{\addvspace {10\p@ }}
-\@writefile{toc}{\contentsline {chapter}{\numberline {B}Second chapitre des annexes}{51}{appendix.B}}
+\@writefile{toc}{\contentsline {chapter}{\numberline {B}Second chapitre des annexes}{69}{appendix.B}}
 \@writefile{lof}{\addvspace {10\p@ }}
 \@writefile{lot}{\addvspace {10\p@ }}