X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/these_charles_emile.git/blobdiff_plain/0af348b9f9fa2f0bc44be5f4a129e869fbb7e5d4..c9389c5838efd5d6872ab508eaa000e3a769ed18:/These_RCE.toc?ds=sidebyside

diff --git a/These_RCE.toc b/These_RCE.toc
index 7e75c89..cd65dbe 100644
--- a/These_RCE.toc
+++ b/These_RCE.toc
@@ -6,50 +6,50 @@
 \contentsline {subsection}{\numberline {1.1.2}Modes d'ex\IeC {\'e}cution synchrone et asynchrone}{7}{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}{9}{section.1.2}
 \contentsline {subsection}{\numberline {1.2.1}Algorithme de Jacobi}{9}{subsection.1.2.1}
-\contentsline {subsection}{\numberline {1.2.2}M\IeC {\'e}thode de r\IeC {\'e}solution GMRES}{9}{subsection.1.2.2}
-\contentsline {subsection}{\numberline {1.2.3}Solveur multisplitting}{9}{subsection.1.2.3}
-\contentsline {section}{\numberline {1.3}Simulateurs d'ex\IeC {\'e}cution d'algorithmes parall\IeC {\`e}les MPI dans une grille de calcul}{9}{section.1.3}
-\contentsline {subsection}{\numberline {1.3.1}Calcul sur grille}{9}{subsection.1.3.1}
-\contentsline {subsection}{\numberline {1.3.2}G\IeC {\'e}n\IeC {\'e}ralit\IeC {\'e}s sur la simulation}{11}{subsection.1.3.2}
-\contentsline {subsection}{\numberline {1.3.3}MPI - Message Passing Interface}{13}{subsection.1.3.3}
-\contentsline {subsection}{\numberline {1.3.4}Simulateur SIMGRID - SMPI}{15}{subsection.1.3.4}
-\contentsline {section}{\numberline {1.4}Motivations}{15}{section.1.4}
-\contentsline {section}{\numberline {1.5}Conclusion partielle}{15}{section.1.5}
-\contentsline {chapter}{\numberline {2}Etat de l'art et travaux de recherche associ\IeC {\'e}s}{17}{chapter.2}
-\contentsline {section}{\numberline {2.1}Concepts et d\IeC {\'e}finitions}{17}{section.2.1}
-\contentsline {subsection}{\numberline {2.1.1}Performance de l'application parall\IeC {\`e}le et scalabilit\IeC {\'e}}{17}{subsection.2.1.1}
-\contentsline {subsection}{\numberline {2.1.2}Taux d'erreur lors de la pr\IeC {\'e}diction}{19}{subsection.2.1.2}
-\contentsline {subsection}{\numberline {2.1.3}Weak contre strong scaling}{19}{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}{20}{section.2.2}
-\contentsline {subsection}{\numberline {2.2.1}Facteurs li\IeC {\'e}s \IeC {\`a} l'\IeC {\'e}cosyst\IeC {\`e}me}{21}{subsection.2.2.1}
-\contentsline {subsubsection}{\numberline {2.2.1.1}Facteur architecture des processeurs}{22}{subsubsection.2.2.1.1}
-\contentsline {subsubsection}{\numberline {2.2.1.2}Facteur : M\IeC {\'e}moire et stockage}{24}{subsubsection.2.2.1.2}
-\contentsline {subsubsection}{\numberline {2.2.1.3}Facteur : R\IeC {\'e}seaux de communication}{28}{subsubsection.2.2.1.3}
-\contentsline {subsection}{\numberline {2.2.2}Facteurs li\IeC {\'e}s au code de l'application}{28}{subsection.2.2.2}
-\contentsline {subsubsection}{\numberline {2.2.2.1}Facteur : Taille du probl\IeC {\`e}me}{29}{subsubsection.2.2.2.1}
-\contentsline {subsubsection}{\numberline {2.2.2.2}Performance de la parall\IeC {\'e}lisation}{29}{subsubsection.2.2.2.2}
-\contentsline {section}{\numberline {2.3}Techniques d'analyse de performance des applications parall\IeC {\`e}les}{32}{section.2.3}
-\contentsline {subsection}{\numberline {2.3.1}G\IeC {\'e}n\IeC {\'e}ralit\IeC {\'e}s et objectifs}{32}{subsection.2.3.1}
-\contentsline {subsection}{\numberline {2.3.2}Approches et m\IeC {\'e}thodologie}{32}{subsection.2.3.2}
-\contentsline {subsection}{\numberline {2.3.3}Quelques outils d'analyse de performance}{34}{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}{35}{section.2.4}
-\contentsline {section}{\numberline {2.5}Conclusion partielle}{35}{section.2.5}
-\contentsline {part}{II\hspace {1em}PARTIE II - Travaux de contributions, r\IeC {\'e}sultats et perspectives}{37}{part.2}
-\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}{39}{chapter.3}
-\contentsline {section}{\numberline {3.1}Protocoles et exp\IeC {\'e}rimentations}{39}{section.3.1}
-\contentsline {section}{\numberline {3.2}R\IeC {\'e}sultats}{39}{section.3.2}
-\contentsline {section}{\numberline {3.3}Conclusion partielle}{39}{section.3.3}
-\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}{41}{chapter.4}
-\contentsline {section}{\numberline {4.1}Protocoles et exp\IeC {\'e}rimentations}{41}{section.4.1}
-\contentsline {section}{\numberline {4.2}R\IeC {\'e}sultats}{41}{section.4.2}
-\contentsline {section}{\numberline {4.3}Conclusion partielle}{41}{section.4.3}
-\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}{43}{chapter.5}
-\contentsline {section}{\numberline {5.1}Approche et m\IeC {\'e}thodologie}{43}{section.5.1}
-\contentsline {section}{\numberline {5.2}Exp\IeC {\'e}rimentations et r\IeC {\'e}sultats}{43}{section.5.2}
-\contentsline {section}{\numberline {5.3}Conclusion partielle}{43}{section.5.3}
-\contentsline {chapter}{\numberline {6}Conclusion g\IeC {\'e}n\IeC {\'e}rale et perspectives}{45}{chapter.6}
-\contentsline {section}{\numberline {6.1}Conclusion g\IeC {\'e}n\IeC {\'e}rale}{45}{section.6.1}
-\contentsline {section}{\numberline {6.2}Travaux futurs et perspectives}{45}{section.6.2}
-\contentsline {part}{III\hspace {1em}Annexes}{57}{part.3}
-\contentsline {chapter}{\numberline {A}Premier chapitre des annexes}{59}{appendix.A}
-\contentsline {chapter}{\numberline {B}Second chapitre des annexes}{61}{appendix.B}
+\contentsline {subsection}{\numberline {1.2.2}M\IeC {\'e}thode de r\IeC {\'e}solution GMRES}{10}{subsection.1.2.2}
+\contentsline {subsection}{\numberline {1.2.3}Solveur multisplitting}{11}{subsection.1.2.3}
+\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}
+\contentsline {subsection}{\numberline {1.3.1}Calcul sur grille}{11}{subsection.1.3.1}
+\contentsline {subsection}{\numberline {1.3.2}G\IeC {\'e}n\IeC {\'e}ralit\IeC {\'e}s sur la simulation}{13}{subsection.1.3.2}
+\contentsline {subsection}{\numberline {1.3.3}MPI - Message Passing Interface}{15}{subsection.1.3.3}
+\contentsline {subsection}{\numberline {1.3.4}Simulateur SIMGRID - SMPI}{17}{subsection.1.3.4}
+\contentsline {section}{\numberline {1.4}Conclusion partielle}{19}{section.1.4}
+\contentsline {chapter}{\numberline {2}Etat de l'art et travaux de recherche associ\IeC {\'e}s}{21}{chapter.2}
+\contentsline {section}{\numberline {2.1}Concepts et d\IeC {\'e}finitions}{21}{section.2.1}
+\contentsline {subsection}{\numberline {2.1.1}Performance de l'application parall\IeC {\`e}le et scalabilit\IeC {\'e}}{21}{subsection.2.1.1}
+\contentsline {subsection}{\numberline {2.1.2}Taux d'erreur lors de la pr\IeC {\'e}diction}{23}{subsection.2.1.2}
+\contentsline {subsection}{\numberline {2.1.3}Weak contre strong scaling}{23}{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}{24}{section.2.2}
+\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}
+\contentsline {subsubsection}{\numberline {2.2.1.1}Facteur architecture des processeurs}{26}{subsubsection.2.2.1.1}
+\contentsline {subsubsection}{\numberline {2.2.1.2}Facteur : M\IeC {\'e}moire et stockage}{28}{subsubsection.2.2.1.2}
+\contentsline {subsubsection}{\numberline {2.2.1.3}Facteur : R\IeC {\'e}seaux de communication}{32}{subsubsection.2.2.1.3}
+\contentsline {subsection}{\numberline {2.2.2}Facteurs li\IeC {\'e}s au code de l'application}{32}{subsection.2.2.2}
+\contentsline {subsubsection}{\numberline {2.2.2.1}Facteur : Taille du probl\IeC {\`e}me}{33}{subsubsection.2.2.2.1}
+\contentsline {subsubsection}{\numberline {2.2.2.2}Performance de la parall\IeC {\'e}lisation}{33}{subsubsection.2.2.2.2}
+\contentsline {section}{\numberline {2.3}Techniques d'analyse de performance des applications parall\IeC {\`e}les}{36}{section.2.3}
+\contentsline {subsection}{\numberline {2.3.1}G\IeC {\'e}n\IeC {\'e}ralit\IeC {\'e}s et objectifs}{36}{subsection.2.3.1}
+\contentsline {subsection}{\numberline {2.3.2}Approches et m\IeC {\'e}thodologie}{36}{subsection.2.3.2}
+\contentsline {subsection}{\numberline {2.3.3}Quelques outils d'analyse de performance}{38}{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}{39}{section.2.4}
+\contentsline {section}{\numberline {2.5}Conclusion partielle}{39}{section.2.5}
+\contentsline {chapter}{\numberline {3}Motivations}{41}{chapter.3}
+\contentsline {part}{II\hspace {1em}PARTIE II - Travaux de contributions, r\IeC {\'e}sultats et perspectives}{43}{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}{45}{chapter.4}
+\contentsline {section}{\numberline {4.1}Protocoles et exp\IeC {\'e}rimentations}{45}{section.4.1}
+\contentsline {section}{\numberline {4.2}R\IeC {\'e}sultats}{45}{section.4.2}
+\contentsline {section}{\numberline {4.3}Conclusion partielle}{45}{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}{47}{chapter.5}
+\contentsline {section}{\numberline {5.1}Protocoles et exp\IeC {\'e}rimentations}{47}{section.5.1}
+\contentsline {section}{\numberline {5.2}R\IeC {\'e}sultats}{47}{section.5.2}
+\contentsline {section}{\numberline {5.3}Conclusion partielle}{47}{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}{49}{chapter.6}
+\contentsline {section}{\numberline {6.1}Approche et m\IeC {\'e}thodologie}{49}{section.6.1}
+\contentsline {section}{\numberline {6.2}Exp\IeC {\'e}rimentations et r\IeC {\'e}sultats}{49}{section.6.2}
+\contentsline {section}{\numberline {6.3}Conclusion partielle}{49}{section.6.3}
+\contentsline {chapter}{\numberline {7}Conclusion g\IeC {\'e}n\IeC {\'e}rale et perspectives}{51}{chapter.7}
+\contentsline {section}{\numberline {7.1}Conclusion g\IeC {\'e}n\IeC {\'e}rale}{51}{section.7.1}
+\contentsline {section}{\numberline {7.2}Travaux futurs et perspectives}{51}{section.7.2}
+\contentsline {part}{III\hspace {1em}Annexes}{65}{part.3}
+\contentsline {chapter}{\numberline {A}Premier chapitre des annexes}{67}{appendix.A}
+\contentsline {chapter}{\numberline {B}Second chapitre des annexes}{69}{appendix.B}