X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/these_charles_emile.git/blobdiff_plain/a84d210b4e8cc45730579629651a610559792413..refs/heads/master:/These_RCE.toc?ds=sidebyside

diff --git a/These_RCE.toc b/These_RCE.toc
index f55548a..1795347 100644
--- a/These_RCE.toc
+++ b/These_RCE.toc
@@ -1,18 +1,55 @@
 \select@language {french}
-\select@language {french}
-\contentsline {subsection}{\numberline {0.0.1}Partitionnement du probl\`eme}{7}
-\contentsline {subsection}{\numberline {0.0.2}Modes d'ex\'ecution synchrone et asynchrone}{8}
-\contentsline {subsection}{\numberline {0.0.3}Algorithme de Jacobi}{9}
-\contentsline {subsection}{\numberline {0.0.4}M\'ethode de r\'esolution GMRES}{9}
-\contentsline {subsection}{\numberline {0.0.5}Solveur multisplitting}{9}
-\contentsline {subsection}{\numberline {0.0.6}MPI - Message Passing Interface}{10}
-\contentsline {subsection}{\numberline {0.0.7}Simulateur SIMGRID}{10}
-\contentsline {subsection}{\numberline {0.0.8}Performance de l'application parall\`ele et scalabilit\'e}{11}
-\contentsline {subsection}{\numberline {0.0.9}Taux d'erreur lors de la pr\'ediction}{13}
-\contentsline {subsection}{\numberline {0.0.10}Weak contre strong scaling}{13}
-\contentsline {subsubsection}{\numberline {0.0.10.1}Facteur architecture des processeurs}{16}
-\contentsline {subsubsection}{\numberline {0.0.10.2}Facteur : M\'emoire et stockage}{18}
-\contentsline {subsubsection}{\numberline {0.0.10.3}Facteur : R\'eseaux de communication}{21}
-\contentsline {subsection}{\numberline {0.0.11}Facteurs li\'es au code de l'application}{22}
-\contentsline {subsubsection}{\numberline {0.0.11.1}Facteur : Taille du probl\`eme}{22}
-\contentsline {subsubsection}{\numberline {0.0.11.2}Performance de la parall\'elisation}{22}
+\contentsline {part}{I\hspace {1em}PARTIE I: Contexte scientifique et revue de l'\IeC {\'e}tat de l'art}{3}{part.1}
+\contentsline {chapter}{\numberline {1}Cadre de travail et contexte scientifique}{7}{chapter.1}
+\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}{7}{section.1.1}
+\contentsline {subsection}{\numberline {1.1.1}Partitionnement du probl\IeC {\`e}me}{8}{subsection.1.1.1}
+\contentsline {subsection}{\numberline {1.1.2}Modes d'ex\IeC {\'e}cution synchrone et asynchrone}{9}{subsection.1.1.2}
+\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}{10}{section.1.2}
+\contentsline {subsection}{\numberline {1.2.1}Algorithme de Jacobi}{10}{subsection.1.2.1}
+\contentsline {subsection}{\numberline {1.2.2}M\IeC {\'e}thode de r\IeC {\'e}solution GMRES}{11}{subsection.1.2.2}
+\contentsline {subsection}{\numberline {1.2.3}Solveur multisplitting}{14}{subsection.1.2.3}
+\contentsline {section}{\numberline {1.3}Simulateurs d'ex\IeC {\'e}cution d'algorithmes parall\IeC {\`e}les dans une grille de calcul}{15}{section.1.3}
+\contentsline {subsection}{\numberline {1.3.1}Calcul sur grille de calcul}{15}{subsection.1.3.1}
+\contentsline {subsection}{\numberline {1.3.2}G\IeC {\'e}n\IeC {\'e}ralit\IeC {\'e}s sur la simulation}{17}{subsection.1.3.2}
+\contentsline {subsection}{\numberline {1.3.3}MPI - Message Passing Interface}{19}{subsection.1.3.3}
+\contentsline {subsection}{\numberline {1.3.4}Simulateur SIMGRID - SMPI}{21}{subsection.1.3.4}
+\contentsline {section}{\numberline {1.4}Conclusion partielle}{23}{section.1.4}
+\contentsline {chapter}{\numberline {2}Etat de l'art et travaux de recherche associ\IeC {\'e}s}{25}{chapter.2}
+\contentsline {section}{\numberline {2.1}Concepts et d\IeC {\'e}finitions}{25}{section.2.1}
+\contentsline {subsection}{\numberline {2.1.1}Performance de l'application parall\IeC {\`e}le et scalabilit\IeC {\'e}}{25}{subsection.2.1.1}
+\contentsline {subsection}{\numberline {2.1.2}Taux d'erreur lors de la pr\IeC {\'e}diction}{27}{subsection.2.1.2}
+\contentsline {subsection}{\numberline {2.1.3}Weak contre strong scaling}{27}{subsection.2.1.3}
+\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}{28}{section.2.2}
+\contentsline {subsection}{\numberline {2.2.1}Facteurs li\IeC {\'e}s \IeC {\`a} l'\IeC {\'e}cosyst\IeC {\`e}me}{29}{subsection.2.2.1}
+\contentsline {subsubsection}{\numberline {2.2.1.1}Facteur architecture des processeurs}{30}{subsubsection.2.2.1.1}
+\contentsline {subsubsection}{\numberline {2.2.1.2}Facteur : M\IeC {\'e}moire et stockage}{32}{subsubsection.2.2.1.2}
+\contentsline {subsubsection}{\numberline {2.2.1.3}Facteur : R\IeC {\'e}seaux de communication}{35}{subsubsection.2.2.1.3}
+\contentsline {subsection}{\numberline {2.2.2}Facteurs li\IeC {\'e}s au code de l'application}{35}{subsection.2.2.2}
+\contentsline {subsubsection}{\numberline {2.2.2.1}Facteur : Taille du probl\IeC {\`e}me}{35}{subsubsection.2.2.2.1}
+\contentsline {subsubsection}{\numberline {2.2.2.2}Performance de la parall\IeC {\'e}lisation}{36}{subsubsection.2.2.2.2}
+\contentsline {section}{\numberline {2.3}Techniques d'analyse de performance des applications parall\IeC {\`e}les}{38}{section.2.3}
+\contentsline {subsection}{\numberline {2.3.1}G\IeC {\'e}n\IeC {\'e}ralit\IeC {\'e}s et objectifs}{38}{subsection.2.3.1}
+\contentsline {subsection}{\numberline {2.3.2}Approches et m\IeC {\'e}thodologie}{39}{subsection.2.3.2}
+\contentsline {subsection}{\numberline {2.3.3}Quelques outils d'analyse de performance}{41}{subsection.2.3.3}
+\contentsline {section}{\numberline {2.4}M\IeC {\'e}thodes de pr\IeC {\'e}diction de la performance des applications parall\IeC {\`e}les}{41}{section.2.4}
+\contentsline {section}{\numberline {2.5}Conclusion partielle}{43}{section.2.5}
+\contentsline {chapter}{\numberline {3}Motivations}{45}{chapter.3}
+\contentsline {part}{II\hspace {1em}PARTIE II - Travaux de contributions, r\IeC {\'e}sultats et perspectives}{47}{part.2}
+\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}{49}{chapter.4}
+\contentsline {section}{\numberline {4.1}Protocoles et exp\IeC {\'e}rimentations}{49}{section.4.1}
+\contentsline {section}{\numberline {4.2}R\IeC {\'e}sultats}{49}{section.4.2}
+\contentsline {section}{\numberline {4.3}Conclusion partielle}{49}{section.4.3}
+\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}{51}{chapter.5}
+\contentsline {section}{\numberline {5.1}Protocoles et exp\IeC {\'e}rimentations}{51}{section.5.1}
+\contentsline {section}{\numberline {5.2}R\IeC {\'e}sultats}{51}{section.5.2}
+\contentsline {section}{\numberline {5.3}Conclusion partielle}{51}{section.5.3}
+\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}{53}{chapter.6}
+\contentsline {section}{\numberline {6.1}Approche et m\IeC {\'e}thodologie}{53}{section.6.1}
+\contentsline {section}{\numberline {6.2}Exp\IeC {\'e}rimentations et r\IeC {\'e}sultats}{53}{section.6.2}
+\contentsline {section}{\numberline {6.3}Conclusion partielle}{53}{section.6.3}
+\contentsline {chapter}{\numberline {7}Conclusion g\IeC {\'e}n\IeC {\'e}rale et perspectives}{55}{chapter.7}
+\contentsline {section}{\numberline {7.1}Conclusion g\IeC {\'e}n\IeC {\'e}rale}{55}{section.7.1}
+\contentsline {section}{\numberline {7.2}Travaux futurs et perspectives}{55}{section.7.2}
+\contentsline {part}{III\hspace {1em}Annexes}{69}{part.3}
+\contentsline {chapter}{\numberline {A}Premier chapitre des annexes}{71}{appendix.A}
+\contentsline {chapter}{\numberline {B}Second chapitre des annexes}{73}{appendix.B}