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}{7}{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}{7}{section.1.1}}
\r
32 \newlabel{eq:1}{{1.1}{7}{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}{8}{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}}{8}{figure.1.1}}
\r
35 \@writefile{lof}{\contentsline {figure}{\numberline {1.2}{\ignorespaces D\IeC {\'e}composition en domaines 1D, 2D et 3D}}{8}{figure.1.2}}
\r
36 \@writefile{toc}{\contentsline {subsection}{\numberline {1.1.2}Modes d'ex\IeC {\'e}cution synchrone et asynchrone}{9}{subsection.1.1.2}}
\r
37 \@writefile{lof}{\contentsline {figure}{\numberline {1.3}{\ignorespaces Mod\IeC {\`e}le de communication synchrone}}{9}{figure.1.3}}
\r
38 \@writefile{lof}{\contentsline {figure}{\numberline {1.4}{\ignorespaces Mod\IeC {\`e}le de communication asynchrone}}{9}{figure.1.4}}
\r
39 \@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}{10}{section.1.2}}
\r
40 \@writefile{toc}{\contentsline {subsection}{\numberline {1.2.1}Algorithme de Jacobi}{10}{subsection.1.2.1}}
\r
41 \newlabel{eq:2}{{1.8}{10}{Algorithme de Jacobi}{equation.1.2.8}{}}
\r
42 \newlabel{eq:3}{{1.9}{11}{Algorithme de Jacobi}{equation.1.2.9}{}}
\r
43 \@writefile{toc}{\contentsline {subsection}{\numberline {1.2.2}M\IeC {\'e}thode de r\IeC {\'e}solution GMRES}{11}{subsection.1.2.2}}
\r
44 \newlabel{eq:Krylov}{{1.11}{11}{Méthode de résolution GMRES}{equation.1.2.11}{}}
\r
45 \@writefile{lof}{\contentsline {figure}{\numberline {1.5}{\ignorespaces Algorithme it\IeC {\'e}ratif de Jacobi}}{12}{figure.1.5}}
\r
46 \newlabel{algo:01}{{1.5}{12}{Algorithme itératif de Jacobi}{figure.1.5}{}}
\r
47 \newlabel{eq:residu}{{1.12}{12}{Méthode de résolution GMRES}{equation.1.2.12}{}}
\r
48 \newlabel{eq:proj}{{1.13}{12}{Méthode de résolution GMRES}{equation.1.2.13}{}}
\r
49 \newlabel{eq:residu}{{1.14}{12}{Méthode de résolution GMRES}{equation.1.2.14}{}}
\r
50 \newlabel{eq:hessen}{{1.15}{12}{Méthode de résolution GMRES}{equation.1.2.15}{}}
\r
51 \newlabel{eq:hessen1}{{1.16}{13}{Méthode de résolution GMRES}{equation.1.2.16}{}}
\r
52 \newlabel{eq:residu1}{{1.2.2}{13}{Méthode de résolution GMRES}{equation.1.2.16}{}}
\r
53 \newlabel{eq:norme1}{{1.2.2}{13}{Méthode de résolution GMRES}{equation.1.2.16}{}}
\r
54 \newlabel{eq:norme2}{{1.17}{13}{Méthode de résolution GMRES}{equation.1.2.17}{}}
\r
55 \newlabel{eq:q_1}{{1.18}{13}{Méthode de résolution GMRES}{equation.1.2.18}{}}
\r
56 \newlabel{eq:q1}{{1.2.2}{13}{Méthode de résolution GMRES}{equation.1.2.18}{}}
\r
57 \newlabel{eq:q_1j}{{1.2.2}{13}{Méthode de résolution GMRES}{equation.1.2.18}{}}
\r
58 \newlabel{eq:q_f}{{1.19}{13}{Méthode de résolution GMRES}{equation.1.2.19}{}}
\r
59 \newlabel{eq:norme3}{{1.20}{13}{Méthode de résolution GMRES}{equation.1.2.20}{}}
\r
60 \newlabel{eq:proj1}{{1.2.2}{13}{Méthode de résolution GMRES}{equation.1.2.20}{}}
\r
61 \@writefile{lof}{\contentsline {figure}{\numberline {1.6}{\ignorespaces Algorithme it\IeC {\'e}ratif GMRES avec red\IeC {\'e}marrage}}{14}{figure.1.6}}
\r
62 \newlabel{algo:02}{{1.6}{14}{Algorithme itératif GMRES avec redémarrage}{figure.1.6}{}}
\r
63 \@writefile{toc}{\contentsline {subsection}{\numberline {1.2.3}Solveur multisplitting}{14}{subsection.1.2.3}}
\r
64 \newlabel{eq:13bis}{{1.21}{15}{Solveur multisplitting}{equation.1.2.21}{}}
\r
65 \newlabel{eq:13}{{1.22}{15}{Solveur multisplitting}{equation.1.2.22}{}}
\r
66 \newlabel{eq:14}{{1.23}{15}{Solveur multisplitting}{equation.1.2.23}{}}
\r
67 \@writefile{toc}{\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}}
\r
68 \@writefile{toc}{\contentsline {subsection}{\numberline {1.3.1}Calcul sur grille de calcul}{15}{subsection.1.3.1}}
\r
69 \newlabel{algo:03:send}{{6}{16}{Solveur multisplitting}{equation.1.2.23}{}}
\r
70 \newlabel{algo:03:recv}{{7}{16}{Solveur multisplitting}{equation.1.2.23}{}}
\r
71 \@writefile{lof}{\contentsline {figure}{\numberline {1.7}{\ignorespaces Solveur Multisplitting utilisant la m\IeC {\'e}thode GMRES en local (version parall\IeC {\`e}le)}}{16}{figure.1.7}}
\r
72 \newlabel{algo:03}{{1.7}{16}{Solveur Multisplitting utilisant la méthode GMRES en local (version parallèle)}{figure.1.7}{}}
\r
73 \@writefile{lof}{\contentsline {figure}{\numberline {1.8}{\ignorespaces Architecture d'une grille de calcul}}{17}{figure.1.8}}
\r
74 \newlabel{fig:gridA}{{1.8}{17}{Architecture d'une grille de calcul}{figure.1.8}{}}
\r
75 \@writefile{toc}{\contentsline {subsection}{\numberline {1.3.2}G\IeC {\'e}n\IeC {\'e}ralit\IeC {\'e}s sur la simulation}{17}{subsection.1.3.2}}
\r
76 \@writefile{lof}{\contentsline {figure}{\numberline {1.9}{\ignorespaces Grid'5000 : R\IeC {\'e}partition g\IeC {\'e}ographique}}{18}{figure.1.9}}
\r
77 \newlabel{fig:grid5000RG}{{1.9}{18}{Grid'5000 : Répartition géographique}{figure.1.9}{}}
\r
78 \newlabel{eqsim}{{1.24}{18}{Généralités sur la simulation}{equation.1.3.24}{}}
\r
79 \@writefile{lot}{\contentsline {table}{\numberline {1.1}{\ignorespaces Quelques outils de simulation pour une grille de calcul}}{19}{table.1.1}}
\r
80 \newlabel{table1}{{1.1}{19}{Quelques outils de simulation pour une grille de calcul}{table.1.1}{}}
\r
81 \@writefile{toc}{\contentsline {subsection}{\numberline {1.3.3}MPI - Message Passing Interface}{19}{subsection.1.3.3}}
\r
82 \@writefile{lof}{\contentsline {figure}{\numberline {1.10}{\ignorespaces Groupes et communicateur (a) - MPI - Op\IeC {\'e}rations collectives (b)}}{20}{figure.1.10}}
\r
83 \newlabel{fig:MPI}{{1.10}{20}{Groupes et communicateur (a) - MPI - Opérations collectives (b)}{figure.1.10}{}}
\r
84 \@writefile{toc}{\contentsline {subsection}{\numberline {1.3.4}Simulateur SIMGRID - SMPI}{21}{subsection.1.3.4}}
\r
85 \@writefile{lof}{\contentsline {figure}{\numberline {1.11}{\ignorespaces SIMGRID : Les \IeC {\'e}l\IeC {\'e}ments de la plateforme de simulation}}{22}{figure.1.11}}
\r
86 \newlabel{fig:simgrid1}{{1.11}{22}{SIMGRID : Les éléments de la plateforme de simulation}{figure.1.11}{}}
\r
87 \@writefile{toc}{\contentsline {section}{\numberline {1.4}Conclusion partielle}{23}{section.1.4}}
\r
88 \@writefile{toc}{\contentsline {chapter}{\numberline {2}Etat de l'art et travaux de recherche associ\IeC {\'e}s}{25}{chapter.2}}
\r
89 \@writefile{lof}{\addvspace {10\p@ }}
\r
90 \@writefile{lot}{\addvspace {10\p@ }}
\r
91 \@writefile{toc}{\contentsline {section}{\numberline {2.1}Concepts et d\IeC {\'e}finitions}{25}{section.2.1}}
\r
92 \@writefile{toc}{\contentsline {subsection}{\numberline {2.1.1}Performance de l'application parall\IeC {\`e}le et scalabilit\IeC {\'e}}{25}{subsection.2.1.1}}
\r
93 \newlabel{eq:5}{{2.1}{25}{Performance de l'application parallèle et scalabilité}{equation.2.1.1}{}}
\r
94 \newlabel{eq:6}{{2.2}{26}{Performance de l'application parallèle et scalabilité}{equation.2.1.2}{}}
\r
95 \newlabel{eq:7}{{2.3}{26}{Performance de l'application parallèle et scalabilité}{equation.2.1.3}{}}
\r
96 \newlabel{eq:8}{{2.4}{26}{Performance de l'application parallèle et scalabilité}{equation.2.1.4}{}}
\r
97 \newlabel{eq:9}{{2.5}{27}{Performance de l'application parallèle et scalabilité}{equation.2.1.5}{}}
\r
98 \@writefile{toc}{\contentsline {subsection}{\numberline {2.1.2}Taux d'erreur lors de la pr\IeC {\'e}diction}{27}{subsection.2.1.2}}
\r
99 \@writefile{toc}{\contentsline {subsection}{\numberline {2.1.3}Weak contre strong scaling}{27}{subsection.2.1.3}}
\r
100 \@writefile{lof}{\contentsline {figure}{\numberline {2.1}{\ignorespaces Weak vs Strong scaling: Temps d'ex\IeC {\'e}cution et Speedup}}{27}{figure.2.1}}
\r
101 \newlabel{fig:scaling}{{2.1}{27}{Weak vs Strong scaling: Temps d'exécution et Speedup}{figure.2.1}{}}
\r
102 \@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}{28}{section.2.2}}
\r
103 \@writefile{toc}{\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}}
\r
104 \@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.1.1}Facteur architecture des processeurs}{30}{subsubsection.2.2.1.1}}
\r
105 \@writefile{lof}{\contentsline {figure}{\numberline {2.2}{\ignorespaces Architecture des CPU multicoeurs}}{31}{figure.2.2}}
\r
106 \newlabel{fig:cpumulti}{{2.2}{31}{Architecture des CPU multicoeurs}{figure.2.2}{}}
\r
107 \@writefile{lof}{\contentsline {figure}{\numberline {2.3}{\ignorespaces Mod\IeC {\`e}le MIMD M\IeC {\'e}moire Distribu\IeC {\'e}}}{32}{figure.2.3}}
\r
108 \newlabel{fig:MIMDDM}{{2.3}{32}{Modèle MIMD Mémoire Distribué}{figure.2.3}{}}
\r
109 \@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.1.2}Facteur : M\IeC {\'e}moire et stockage}{32}{subsubsection.2.2.1.2}}
\r
110 \@writefile{lof}{\contentsline {figure}{\numberline {2.4}{\ignorespaces Mod\IeC {\`e}le MIMD M\IeC {\'e}moire partag\IeC {\'e}}}{33}{figure.2.4}}
\r
111 \newlabel{fig:MIMDSM}{{2.4}{33}{Modèle MIMD Mémoire partagé}{figure.2.4}{}}
\r
112 \@writefile{lof}{\contentsline {figure}{\numberline {2.5}{\ignorespaces Mod\IeC {\`e}le MIMD hybride}}{34}{figure.2.5}}
\r
113 \newlabel{fig:MIMDHY}{{2.5}{34}{Modèle MIMD hybride}{figure.2.5}{}}
\r
114 \@writefile{lof}{\contentsline {figure}{\numberline {2.6}{\ignorespaces Evolution de la puissance de calcul mondiale}}{35}{figure.2.6}}
\r
115 \newlabel{fig:power}{{2.6}{35}{Evolution de la puissance de calcul mondiale}{figure.2.6}{}}
\r
116 \@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.1.3}Facteur : R\IeC {\'e}seaux de communication}{35}{subsubsection.2.2.1.3}}
\r
117 \@writefile{toc}{\contentsline {subsection}{\numberline {2.2.2}Facteurs li\IeC {\'e}s au code de l'application}{35}{subsection.2.2.2}}
\r
118 \@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.2.1}Facteur : Taille du probl\IeC {\`e}me}{35}{subsubsection.2.2.2.1}}
\r
119 \@writefile{lof}{\contentsline {figure}{\numberline {2.7}{\ignorespaces M\IeC {\'e}moire MIMD: Architecture UMA}}{36}{figure.2.7}}
\r
120 \newlabel{fig:UMA}{{2.7}{36}{Mémoire MIMD: Architecture UMA}{figure.2.7}{}}
\r
121 \@writefile{lof}{\contentsline {figure}{\numberline {2.8}{\ignorespaces M\IeC {\'e}moire MIMD: Architecture NUMA}}{36}{figure.2.8}}
\r
122 \newlabel{fig:NUMA}{{2.8}{36}{Mémoire MIMD: Architecture NUMA}{figure.2.8}{}}
\r
123 \@writefile{toc}{\contentsline {subsubsection}{\numberline {2.2.2.2}Performance de la parall\IeC {\'e}lisation}{36}{subsubsection.2.2.2.2}}
\r
124 \newlabel{eq:10}{{2.6}{36}{Performance de la parallélisation}{equation.2.2.6}{}}
\r
125 \newlabel{eq:11}{{2.7}{36}{Performance de la parallélisation}{equation.2.2.7}{}}
\r
126 \@writefile{lof}{\contentsline {figure}{\numberline {2.9}{\ignorespaces M\IeC {\'e}moire MIMD: Architecture COMA}}{37}{figure.2.9}}
\r
127 \newlabel{fig:COMA}{{2.9}{37}{Mémoire MIMD: Architecture COMA}{figure.2.9}{}}
\r
128 \newlabel{eq:12}{{2.8}{37}{Performance de la parallélisation}{equation.2.2.8}{}}
\r
129 \newlabel{eq:12}{{2.9}{37}{Performance de la parallélisation}{equation.2.2.9}{}}
\r
130 \@writefile{toc}{\contentsline {section}{\numberline {2.3}Techniques d'analyse de performance des applications parall\IeC {\`e}les}{38}{section.2.3}}
\r
131 \@writefile{toc}{\contentsline {subsection}{\numberline {2.3.1}G\IeC {\'e}n\IeC {\'e}ralit\IeC {\'e}s et objectifs}{38}{subsection.2.3.1}}
\r
132 \@writefile{toc}{\contentsline {subsection}{\numberline {2.3.2}Approches et m\IeC {\'e}thodologie}{39}{subsection.2.3.2}}
\r
133 \@writefile{lof}{\contentsline {figure}{\numberline {2.10}{\ignorespaces Classification des techniques d'analyse de la performance}}{39}{figure.2.10}}
\r
134 \newlabel{fig:anaperf}{{2.10}{39}{Classification des techniques d'analyse de la performance}{figure.2.10}{}}
\r
135 \@writefile{toc}{\contentsline {subsection}{\numberline {2.3.3}Quelques outils d'analyse de performance}{41}{subsection.2.3.3}}
\r
136 \@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}{41}{section.2.4}}
\r
137 \@writefile{toc}{\contentsline {section}{\numberline {2.5}Conclusion partielle}{43}{section.2.5}}
\r
138 \@writefile{toc}{\contentsline {chapter}{\numberline {3}Motivations}{45}{chapter.3}}
\r
139 \@writefile{lof}{\addvspace {10\p@ }}
\r
140 \@writefile{lot}{\addvspace {10\p@ }}
\r
141 \@writefile{toc}{\contentsline {part}{II\hspace {1em}PARTIE II - Travaux de contributions, r\IeC {\'e}sultats et perspectives}{47}{part.2}}
\r
142 \@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}{49}{chapter.4}}
\r
143 \@writefile{lof}{\addvspace {10\p@ }}
\r
144 \@writefile{lot}{\addvspace {10\p@ }}
\r
145 \@writefile{toc}{\contentsline {section}{\numberline {4.1}Protocoles et exp\IeC {\'e}rimentations}{49}{section.4.1}}
\r
146 \@writefile{toc}{\contentsline {section}{\numberline {4.2}R\IeC {\'e}sultats}{49}{section.4.2}}
\r
147 \@writefile{toc}{\contentsline {section}{\numberline {4.3}Conclusion partielle}{49}{section.4.3}}
\r
148 \@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}{51}{chapter.5}}
\r
149 \@writefile{lof}{\addvspace {10\p@ }}
\r
150 \@writefile{lot}{\addvspace {10\p@ }}
\r
151 \@writefile{toc}{\contentsline {section}{\numberline {5.1}Protocoles et exp\IeC {\'e}rimentations}{51}{section.5.1}}
\r
152 \@writefile{toc}{\contentsline {section}{\numberline {5.2}R\IeC {\'e}sultats}{51}{section.5.2}}
\r
153 \@writefile{toc}{\contentsline {section}{\numberline {5.3}Conclusion partielle}{51}{section.5.3}}
\r
154 \@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}{53}{chapter.6}}
\r
155 \@writefile{lof}{\addvspace {10\p@ }}
\r
156 \@writefile{lot}{\addvspace {10\p@ }}
\r
157 \@writefile{toc}{\contentsline {section}{\numberline {6.1}Approche et m\IeC {\'e}thodologie}{53}{section.6.1}}
\r
158 \@writefile{toc}{\contentsline {section}{\numberline {6.2}Exp\IeC {\'e}rimentations et r\IeC {\'e}sultats}{53}{section.6.2}}
\r
159 \@writefile{toc}{\contentsline {section}{\numberline {6.3}Conclusion partielle}{53}{section.6.3}}
\r
160 \@writefile{toc}{\contentsline {chapter}{\numberline {7}Conclusion g\IeC {\'e}n\IeC {\'e}rale et perspectives}{55}{chapter.7}}
\r
161 \@writefile{lof}{\addvspace {10\p@ }}
\r
162 \@writefile{lot}{\addvspace {10\p@ }}
\r
163 \@writefile{toc}{\contentsline {section}{\numberline {7.1}Conclusion g\IeC {\'e}n\IeC {\'e}rale}{55}{section.7.1}}
\r
164 \@writefile{toc}{\contentsline {section}{\numberline {7.2}Travaux futurs et perspectives}{55}{section.7.2}}
\r
165 \bibstyle{phdthesisapa}
\r
166 \bibdata{biblio.bib}
\r
167 \@writefile{toc}{\contentsline {part}{III\hspace {1em}Annexes}{69}{part.3}}
\r
168 \@writefile{toc}{\contentsline {chapter}{\numberline {A}Premier chapitre des annexes}{71}{appendix.A}}
\r
169 \@writefile{lof}{\addvspace {10\p@ }}
\r
170 \@writefile{lot}{\addvspace {10\p@ }}
\r
171 \@writefile{toc}{\contentsline {chapter}{\numberline {B}Second chapitre des annexes}{73}{appendix.B}}
\r
172 \@writefile{lof}{\addvspace {10\p@ }}
\r
173 \@writefile{lot}{\addvspace {10\p@ }}
\r
