2 \providecommand\hyper@newdestlabel[2]{}
\r
7 \providecommand\HyperFirstAtBeginDocument{\AtBeginDocument}
\r
8 \HyperFirstAtBeginDocument{\ifx\hyper@anchor\@undefined
\r
9 \global\let\oldcontentsline\contentsline
\r
10 \gdef\contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
\r
11 \global\let\oldnewlabel\newlabel
\r
12 \gdef\newlabel#1#2{\newlabelxx{#1}#2}
\r
13 \gdef\newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
\r
14 \AtEndDocument{\ifx\hyper@anchor\@undefined
\r
15 \let\contentsline\oldcontentsline
\r
16 \let\newlabel\oldnewlabel
\r
19 \global\let\hyper@last\relax
\r
20 \gdef\HyperFirstAtBeginDocument#1{#1}
\r
21 \providecommand\HyField@AuxAddToFields[1]{}
\r
22 \providecommand\HyField@AuxAddToCoFields[2]{}
\r
23 \select@language{french}
\r
24 \@writefile{toc}{\select@language{french}}
\r
25 \@writefile{lof}{\select@language{french}}
\r
26 \@writefile{lot}{\select@language{french}}
\r
27 \@writefile{toc}{\contentsline {part}{I\hspace {1em}PARTIE I: Contexte scientifique et revue de l'\IeC {\'e}tat de l'art}{3}{part.1}}
\r
28 \@writefile{toc}{\contentsline {chapter}{\numberline {1}Cadre de travail et contexte scientifique}{5}{chapter.1}}
\r
29 \@writefile{lof}{\addvspace {10\p@ }}
\r
30 \@writefile{lot}{\addvspace {10\p@ }}
\r
31 \@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}}
\r
32 \newlabel{eq:1}{{1.1}{5}{Classe des algorithmes itératifs parallèles à large échelle dans une grille de calcul}{equation.1.1.1}{}}
\r
33 \@writefile{toc}{\contentsline {subsection}{\numberline {1.1.1}Partitionnement du probl\IeC {\`e}me}{6}{subsection.1.1.1}}
\r
34 \@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}}
\r
35 \@writefile{lof}{\contentsline {figure}{\numberline {1.2}{\ignorespaces D\IeC {\'e}composition en domaines 1D, 2D et 3D}}{6}{figure.1.2}}
\r
36 \@writefile{toc}{\contentsline {subsection}{\numberline {1.1.2}Modes d'ex\IeC {\'e}cution synchrone et asynchrone}{7}{subsection.1.1.2}}
\r
37 \@writefile{lof}{\contentsline {figure}{\numberline {1.3}{\ignorespaces Mod\IeC {\`e}le de communication synchrone}}{8}{figure.1.3}}
\r
38 \newlabel{fig:sync}{{1.3}{8}{Modèle de communication synchrone}{figure.1.3}{}}
\r
39 \@writefile{lof}{\contentsline {figure}{\numberline {1.4}{\ignorespaces Mod\IeC {\`e}le de communication asynchrone}}{9}{figure.1.4}}
\r
40 \newlabel{fig:async}{{1.4}{9}{Modèle de communication asynchrone}{figure.1.4}{}}
\r
41 \@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}}
\r
42 \@writefile{toc}{\contentsline {subsection}{\numberline {1.2.1}Algorithme de Jacobi}{9}{subsection.1.2.1}}
\r
43 \@writefile{toc}{\contentsline {subsection}{\numberline {1.2.2}M\IeC {\'e}thode de r\IeC {\'e}solution GMRES}{9}{subsection.1.2.2}}
\r
44 \@writefile{toc}{\contentsline {subsection}{\numberline {1.2.3}Solveur multisplitting}{9}{subsection.1.2.3}}
\r
45 \@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}{9}{section.1.3}}
\r
46 \@writefile{toc}{\contentsline {subsection}{\numberline {1.3.1}Calcul sur grille}{9}{subsection.1.3.1}}
\r
47 \@writefile{lof}{\contentsline {figure}{\numberline {1.5}{\ignorespaces Architecture d'une grille de calcul}}{10}{figure.1.5}}
\r
48 \newlabel{fig:gridA}{{1.5}{10}{Architecture d'une grille de calcul}{figure.1.5}{}}
\r
49 \@writefile{lof}{\contentsline {figure}{\numberline {1.6}{\ignorespaces Grid'5000 : R\IeC {\'e}partition g\IeC {\'e}ographique}}{11}{figure.1.6}}
\r
50 \newlabel{fig:grid5000RG}{{1.6}{11}{Grid'5000 : Répartition géographique}{figure.1.6}{}}
\r
51 \@writefile{toc}{\contentsline {subsection}{\numberline {1.3.2}G\IeC {\'e}n\IeC {\'e}ralit\IeC {\'e}s sur la simulation}{11}{subsection.1.3.2}}
\r
52 \newlabel{eqsim}{{1.8}{12}{Généralités sur la simulation}{equation.1.3.8}{}}
\r
53 \@writefile{lot}{\contentsline {table}{\numberline {1.1}{\ignorespaces Quelques outils de simulation pour une grille de calcul}}{13}{table.1.1}}
\r
54 \newlabel{table1}{{1.1}{13}{Quelques outils de simulation pour une grille de calcul}{table.1.1}{}}
\r
55 \@writefile{toc}{\contentsline {subsection}{\numberline {1.3.3}MPI - Message Passing Interface}{13}{subsection.1.3.3}}
\r
56 \@writefile{lof}{\contentsline {figure}{\numberline {1.7}{\ignorespaces Groupes et communicateur (a) - MPI - Op\IeC {\'e}rations collectives (b)}}{14}{figure.1.7}}
\r
57 \newlabel{fig:MPI}{{1.7}{14}{Groupes et communicateur (a) - MPI - Opérations collectives (b)}{figure.1.7}{}}
\r
58 \@writefile{toc}{\contentsline {subsection}{\numberline {1.3.4}Simulateur SIMGRID - SMPI}{15}{subsection.1.3.4}}
\r
59 \@writefile{toc}{\contentsline {section}{\numberline {1.4}Motivations}{15}{section.1.4}}
\r
60 \@writefile{toc}{\contentsline {section}{\numberline {1.5}Conclusion partielle}{15}{section.1.5}}
\r
61 \@writefile{toc}{\contentsline {chapter}{\numberline {2}Etat de l'art et travaux de recherche associ\IeC {\'e}s}{17}{chapter.2}}
\r
62 \@writefile{lof}{\addvspace {10\p@ }}
\r
63 \@writefile{lot}{\addvspace {10\p@ }}
\r
64 \@writefile{toc}{\contentsline {section}{\numberline {2.1}Concepts et d\IeC {\'e}finitions}{17}{section.2.1}}
\r
65 \@writefile{toc}{\contentsline {subsection}{\numberline {2.1.1}Performance de l'application parall\IeC {\`e}le et scalabilit\IeC {\'e}}{17}{subsection.2.1.1}}
\r
66 \newlabel{eq:5}{{2.1}{17}{Performance de l'application parallèle et scalabilité}{equation.2.1.1}{}}
\r
67 \newlabel{eq:6}{{2.2}{18}{Performance de l'application parallèle et scalabilité}{equation.2.1.2}{}}
\r
68 \newlabel{eq:7}{{2.3}{18}{Performance de l'application parallèle et scalabilité}{equation.2.1.3}{}}
\r
69 \newlabel{eq:8}{{2.4}{18}{Performance de l'application parallèle et scalabilité}{equation.2.1.4}{}}
\r
70 \newlabel{eq:9}{{2.5}{19}{Performance de l'application parallèle et scalabilité}{equation.2.1.5}{}}
\r
71 \@writefile{toc}{\contentsline {subsection}{\numberline {2.1.2}Taux d'erreur lors de la pr\IeC {\'e}diction}{19}{subsection.2.1.2}}
\r
72 \@writefile{toc}{\contentsline {subsection}{\numberline {2.1.3}Weak contre strong scaling}{19}{subsection.2.1.3}}
\r
73 \@writefile{lof}{\contentsline {figure}{\numberline {2.1}{\ignorespaces Weak vs Strong scaling: Temps d'ex\IeC {\'e}cution et Speedup}}{20}{figure.2.1}}
\r
74 \newlabel{fig:scaling}{{2.1}{20}{Weak vs Strong scaling: Temps d'exécution et Speedup}{figure.2.1}{}}
\r
75 \@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}{20}{section.2.2}}
\r
76 \@writefile{toc}{\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}}
\r
77 \@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.1.1}Facteur architecture des processeurs}{22}{subsubsection.2.2.1.1}}
\r
78 \@writefile{lof}{\contentsline {figure}{\numberline {2.2}{\ignorespaces Architecture des CPU multicoeurs}}{23}{figure.2.2}}
\r
79 \newlabel{fig:cpumulti}{{2.2}{23}{Architecture des CPU multicoeurs}{figure.2.2}{}}
\r
80 \@writefile{lof}{\contentsline {figure}{\numberline {2.3}{\ignorespaces Mod\IeC {\`e}le MIMD Distribu\IeC {\'e}}}{24}{figure.2.3}}
\r
81 \newlabel{fig:MIMDDM}{{2.3}{24}{Modèle MIMD Distribué}{figure.2.3}{}}
\r
82 \@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.1.2}Facteur : M\IeC {\'e}moire et stockage}{24}{subsubsection.2.2.1.2}}
\r
83 \@writefile{lof}{\contentsline {figure}{\numberline {2.4}{\ignorespaces Mod\IeC {\`e}le MIMD partag\IeC {\'e}}}{25}{figure.2.4}}
\r
84 \newlabel{fig:MIMDSM}{{2.4}{25}{Modèle MIMD partagé}{figure.2.4}{}}
\r
85 \@writefile{lof}{\contentsline {figure}{\numberline {2.5}{\ignorespaces Mod\IeC {\`e}le MIMD hybride}}{26}{figure.2.5}}
\r
86 \newlabel{fig:MIMDHY}{{2.5}{26}{Modèle MIMD hybride}{figure.2.5}{}}
\r
87 \@writefile{lof}{\contentsline {figure}{\numberline {2.6}{\ignorespaces Evolution de la puissance de calcul mondiale}}{27}{figure.2.6}}
\r
88 \newlabel{fig:power}{{2.6}{27}{Evolution de la puissance de calcul mondiale}{figure.2.6}{}}
\r
89 \@writefile{lof}{\contentsline {figure}{\numberline {2.7}{\ignorespaces M\IeC {\'e}moire MIMD: Architecture UMA}}{28}{figure.2.7}}
\r
90 \newlabel{fig:UMA}{{2.7}{28}{Mémoire MIMD: Architecture UMA}{figure.2.7}{}}
\r
91 \@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.1.3}Facteur : R\IeC {\'e}seaux de communication}{28}{subsubsection.2.2.1.3}}
\r
92 \@writefile{toc}{\contentsline {subsection}{\numberline {2.2.2}Facteurs li\IeC {\'e}s au code de l'application}{28}{subsection.2.2.2}}
\r
93 \@writefile{lof}{\contentsline {figure}{\numberline {2.8}{\ignorespaces M\IeC {\'e}moire MIMD: Architecture NUMA}}{29}{figure.2.8}}
\r
94 \newlabel{fig:NUMA}{{2.8}{29}{Mémoire MIMD: Architecture NUMA}{figure.2.8}{}}
\r
95 \@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.2.1}Facteur : Taille du probl\IeC {\`e}me}{29}{subsubsection.2.2.2.1}}
\r
96 \@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.2.2}Performance de la parall\IeC {\'e}lisation}{29}{subsubsection.2.2.2.2}}
\r
97 \newlabel{eq:10}{{2.6}{29}{Performance de la parallélisation}{equation.2.2.6}{}}
\r
98 \@writefile{lof}{\contentsline {figure}{\numberline {2.9}{\ignorespaces M\IeC {\'e}moire MIMD: Architecture COMA}}{30}{figure.2.9}}
\r
99 \newlabel{fig:COMA}{{2.9}{30}{Mémoire MIMD: Architecture COMA}{figure.2.9}{}}
\r
100 \newlabel{eq:11}{{2.7}{30}{Performance de la parallélisation}{equation.2.2.7}{}}
\r
101 \newlabel{eq:12}{{2.8}{30}{Performance de la parallélisation}{equation.2.2.8}{}}
\r
102 \newlabel{eq:12}{{2.9}{31}{Performance de la parallélisation}{equation.2.2.9}{}}
\r
103 \@writefile{toc}{\contentsline {section}{\numberline {2.3}Techniques d'analyse de performance des applications parall\IeC {\`e}les}{32}{section.2.3}}
\r
104 \@writefile{toc}{\contentsline {subsection}{\numberline {2.3.1}G\IeC {\'e}n\IeC {\'e}ralit\IeC {\'e}s et objectifs}{32}{subsection.2.3.1}}
\r
105 \@writefile{toc}{\contentsline {subsection}{\numberline {2.3.2}Approches et m\IeC {\'e}thodologie}{32}{subsection.2.3.2}}
\r
106 \@writefile{lof}{\contentsline {figure}{\numberline {2.10}{\ignorespaces Classification des techniques d'analyse de la performance}}{33}{figure.2.10}}
\r
107 \newlabel{fig:anaperf}{{2.10}{33}{Classification des techniques d'analyse de la performance}{figure.2.10}{}}
\r
108 \@writefile{toc}{\contentsline {subsection}{\numberline {2.3.3}Quelques outils d'analyse de performance}{34}{subsection.2.3.3}}
\r
109 \@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}{35}{section.2.4}}
\r
110 \@writefile{toc}{\contentsline {section}{\numberline {2.5}Conclusion partielle}{35}{section.2.5}}
\r
111 \@writefile{toc}{\contentsline {part}{II\hspace {1em}PARTIE II - Travaux de contributions, r\IeC {\'e}sultats et perspectives}{37}{part.2}}
\r
112 \@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}{39}{chapter.3}}
\r
113 \@writefile{lof}{\addvspace {10\p@ }}
\r
114 \@writefile{lot}{\addvspace {10\p@ }}
\r
115 \@writefile{toc}{\contentsline {section}{\numberline {3.1}Protocoles et exp\IeC {\'e}rimentations}{39}{section.3.1}}
\r
116 \@writefile{toc}{\contentsline {section}{\numberline {3.2}R\IeC {\'e}sultats}{39}{section.3.2}}
\r
117 \@writefile{toc}{\contentsline {section}{\numberline {3.3}Conclusion partielle}{39}{section.3.3}}
\r
118 \@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}{41}{chapter.4}}
\r
119 \@writefile{lof}{\addvspace {10\p@ }}
\r
120 \@writefile{lot}{\addvspace {10\p@ }}
\r
121 \@writefile{toc}{\contentsline {section}{\numberline {4.1}Protocoles et exp\IeC {\'e}rimentations}{41}{section.4.1}}
\r
122 \@writefile{toc}{\contentsline {section}{\numberline {4.2}R\IeC {\'e}sultats}{41}{section.4.2}}
\r
123 \@writefile{toc}{\contentsline {section}{\numberline {4.3}Conclusion partielle}{41}{section.4.3}}
\r
124 \@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}{43}{chapter.5}}
\r
125 \@writefile{lof}{\addvspace {10\p@ }}
\r
126 \@writefile{lot}{\addvspace {10\p@ }}
\r
127 \@writefile{toc}{\contentsline {section}{\numberline {5.1}Approche et m\IeC {\'e}thodologie}{43}{section.5.1}}
\r
128 \@writefile{toc}{\contentsline {section}{\numberline {5.2}Exp\IeC {\'e}rimentations et r\IeC {\'e}sultats}{43}{section.5.2}}
\r
129 \@writefile{toc}{\contentsline {section}{\numberline {5.3}Conclusion partielle}{43}{section.5.3}}
\r
130 \@writefile{toc}{\contentsline {chapter}{\numberline {6}Conclusion g\IeC {\'e}n\IeC {\'e}rale et perspectives}{45}{chapter.6}}
\r
131 \@writefile{lof}{\addvspace {10\p@ }}
\r
132 \@writefile{lot}{\addvspace {10\p@ }}
\r
133 \@writefile{toc}{\contentsline {section}{\numberline {6.1}Conclusion g\IeC {\'e}n\IeC {\'e}rale}{45}{section.6.1}}
\r
134 \@writefile{toc}{\contentsline {section}{\numberline {6.2}Travaux futurs et perspectives}{45}{section.6.2}}
\r
135 \bibstyle{phdthesisapa}
\r
136 \bibdata{biblio.bib}
\r
137 \@writefile{toc}{\contentsline {part}{III\hspace {1em}Annexes}{57}{part.3}}
\r
138 \@writefile{toc}{\contentsline {chapter}{\numberline {A}Premier chapitre des annexes}{59}{appendix.A}}
\r
139 \@writefile{lof}{\addvspace {10\p@ }}
\r
140 \@writefile{lot}{\addvspace {10\p@ }}
\r
141 \@writefile{toc}{\contentsline {chapter}{\numberline {B}Second chapitre des annexes}{61}{appendix.B}}
\r
142 \@writefile{lof}{\addvspace {10\p@ }}
\r
143 \@writefile{lot}{\addvspace {10\p@ }}
\r
