{"id":2235,"date":"2025-02-13T10:59:09","date_gmt":"2025-02-13T09:59:09","guid":{"rendered":"https:\/\/numpex.org\/job-offers\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\/"},"modified":"2025-07-15T09:50:04","modified_gmt":"2025-07-15T07:50:04","slug":"stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs","status":"publish","type":"portfolio","link":"https:\/\/numpex.org\/fr\/job-offers\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\/","title":{"rendered":"Stage sur les strat\u00e9gies d&rsquo;ordonnancement tol\u00e9rantes aux fautes pour les algorithmes it\u00e9ratifs"},"content":{"rendered":"<div class=\"wpb-content-wrapper\"><p>[vc_row row_height_percent=\u00a0\u00bb60&Prime; override_padding=\u00a0\u00bbyes\u00a0\u00bb h_padding=\u00a0\u00bb2&Prime; top_padding=\u00a0\u00bb5&Prime; bottom_padding=\u00a0\u00bb5&Prime; back_color=\u00a0\u00bbaccent\u00a0\u00bb back_image=\u00a0\u00bb153&Prime; overlay_color=\u00a0\u00bbcolor-prif\u00a0\u00bb overlay_alpha=\u00a0\u00bb80&Prime; gutter_size=\u00a0\u00bb100&Prime; column_width_percent=\u00a0\u00bb100&Prime; shift_y=\u00a0\u00bb0&Prime; z_index=\u00a0\u00bb0&Prime; bottom_divider=\u00a0\u00bbstep\u00a0\u00bb style=\u00a0\u00bbinherited\u00a0\u00bb css=\u00a0\u00bb.vc_custom_1686752211509{border-top-width: 0px !important;}\u00a0\u00bb el_class=\u00a0\u00bbhomepage-search\u00a0\u00bb uncode_shortcode_id=\u00a0\u00bb690866&Prime; back_color_type=\u00a0\u00bbuncode-palette\u00a0\u00bb overlay_color_type=\u00a0\u00bbuncode-palette\u00a0\u00bb][vc_column column_width_use_pixel=\u00a0\u00bbyes\u00a0\u00bb position_vertical=\u00a0\u00bbmiddle\u00a0\u00bb align_horizontal=\u00a0\u00bbalign_center\u00a0\u00bb gutter_size=\u00a0\u00bb2&Prime; style=\u00a0\u00bbdark\u00a0\u00bb overlay_alpha=\u00a0\u00bb100&Prime; shift_x=\u00a0\u00bb0&Prime; shift_y=\u00a0\u00bb0&Prime; shift_y_down=\u00a0\u00bb0&Prime; z_index=\u00a0\u00bb0&Prime; medium_width=\u00a0\u00bb0&Prime; mobile_width=\u00a0\u00bb0&Prime; zoom_width=\u00a0\u00bb0&Prime; zoom_height=\u00a0\u00bb0&Prime; width=\u00a0\u00bb1\/1&Prime; column_width_pixel=\u00a0\u00bb900&Prime;][vc_custom_heading heading_semantic=\u00a0\u00bbh1&Prime; text_size=\u00a0\u00bbh1&Prime; sub_lead=\u00a0\u00bbyes\u00a0\u00bb sub_reduced=\u00a0\u00bbyes\u00a0\u00bb text_align=\u00a0\u00bbtext-center\u00a0\u00bb uncode_shortcode_id=\u00a0\u00bb384995&Prime;]<\/p>\n<h1 class=\"entry-title\">Stage sur les strat\u00e9gies d&rsquo;ordonnancement tol\u00e9rantes aux fautes pour les algorithmes it\u00e9ratifs<\/h1>\n<p>[\/vc_custom_heading][vc_column_text text_lead=\u00a0\u00bbyes\u00a0\u00bb uncode_shortcode_id=\u00a0\u00bb107879&Prime;]Anne Benoit et Yves Robert sont \u00e0 la recherche de leur prochain \u00e9tudiant de M2.[\/vc_column_text][vc_empty_space empty_h=\u00a0\u00bb3&Prime;][\/vc_column][\/vc_row][vc_row row_height_percent=\u00a0\u00bb0&Prime; override_padding=\u00a0\u00bbyes\u00a0\u00bb h_padding=\u00a0\u00bb2&Prime; top_padding=\u00a0\u00bb0&Prime; bottom_padding=\u00a0\u00bb2&Prime; back_color=\u00a0\u00bbcolor-xsdn\u00a0\u00bb overlay_alpha=\u00a0\u00bb50&Prime; gutter_size=\u00a0\u00bb3&Prime; column_width_percent=\u00a0\u00bb100&Prime; shift_y=\u00a0\u00bb0&Prime; z_index=\u00a0\u00bb0&Prime; top_divider=\u00a0\u00bbgradient\u00a0\u00bb bottom_divider=\u00a0\u00bbgradient\u00a0\u00bb uncode_shortcode_id=\u00a0\u00bb187840&Prime; back_color_type=\u00a0\u00bbuncode-palette\u00a0\u00bb][vc_column column_width_percent=\u00a0\u00bb100&Prime; gutter_size=\u00a0\u00bb3&Prime; overlay_alpha=\u00a0\u00bb50&Prime; shift_x=\u00a0\u00bb0&Prime; shift_y=\u00a0\u00bb-4&Prime; shift_y_fixed=\u00a0\u00bbyes\u00a0\u00bb shift_y_down=\u00a0\u00bb0&Prime; z_index=\u00a0\u00bb0&Prime; medium_width=\u00a0\u00bb0&Prime; mobile_width=\u00a0\u00bb0&Prime; width=\u00a0\u00bb1\/1&Prime;][vc_row_inner][vc_column_inner column_width_percent=\u00a0\u00bb100&Prime; align_horizontal=\u00a0\u00bbalign_center\u00a0\u00bb gutter_size=\u00a0\u00bb3&Prime; override_padding=\u00a0\u00bbyes\u00a0\u00bb column_padding=\u00a0\u00bb3&Prime; back_color=\u00a0\u00bbcolor-xsdn\u00a0\u00bb overlay_alpha=\u00a0\u00bb50&Prime; radius=\u00a0\u00bbxs\u00a0\u00bb shadow=\u00a0\u00bbsm\u00a0\u00bb shift_x=\u00a0\u00bb0&Prime; shift_y=\u00a0\u00bb0&Prime; shift_y_down=\u00a0\u00bb0&Prime; z_index=\u00a0\u00bb0&Prime; medium_width=\u00a0\u00bb3&Prime; mobile_width=\u00a0\u00bb0&Prime; shadow_hover=\u00a0\u00bbyes\u00a0\u00bb shadow_hover_weight=\u00a0\u00bbstd\u00a0\u00bb width=\u00a0\u00bb1\/1&Prime;][vc_icon icon=\u00a0\u00bbfa fa-profile-male\u00a0\u00bb icon_color=\u00a0\u00bbaccent\u00a0\u00bb size=\u00a0\u00bbfa-3x\u00a0\u00bb text_size=\u00a0\u00bbh4&Prime; text_reduced=\u00a0\u00bbyes\u00a0\u00bb title=\u00a0\u00bbStage\u00a0\u00bb link=\u00a0\u00bb|||\u00a0\u00bb uncode_shortcode_id=\u00a0\u00bb819916&Prime; icon_color_type=\u00a0\u00bbuncode-palette\u00a0\u00bb]Les candidatures doivent \u00eatre envoy\u00e9es \u00e0 Anne Benoit<a href=\"mailto:Anne.Benoit@ens-lyon.fr\">(Anne.Benoit@ens-lyon.fr)<\/a>.<\/p>\n<p>&nbsp;<\/p>\n<p>[\/vc_icon][\/vc_column_inner][\/vc_row_inner][\/vc_column][\/vc_row][vc_row unlock_row_content=\u00a0\u00bbyes\u00a0\u00bb row_height_percent=\u00a0\u00bb0&Prime; override_padding=\u00a0\u00bbyes\u00a0\u00bb h_padding=\u00a0\u00bb5&Prime; top_padding=\u00a0\u00bb5&Prime; bottom_padding=\u00a0\u00bb5&Prime; back_color=\u00a0\u00bbcolor-xsdn\u00a0\u00bb overlay_alpha=\u00a0\u00bb50&Prime; gutter_size=\u00a0\u00bb4&Prime; column_width_percent=\u00a0\u00bb100&Prime; shift_y=\u00a0\u00bb0&Prime; z_index=\u00a0\u00bb0&Prime; top_divider=\u00a0\u00bbgradient\u00a0\u00bb bottom_divider=\u00a0\u00bbgradient\u00a0\u00bb inverted_device_order=\u00a0\u00bbyes\u00a0\u00bb uncode_shortcode_id=\u00a0\u00bb371393&Prime; back_color_type=\u00a0\u00bbuncode-palette\u00a0\u00bb][vc_column column_width_percent=\u00a0\u00bb100&Prime; gutter_size=\u00a0\u00bb3&Prime; overlay_alpha=\u00a0\u00bb50&Prime; shift_x=\u00a0\u00bb0&Prime; shift_y=\u00a0\u00bb0&Prime; shift_y_down=\u00a0\u00bb0&Prime; z_index=\u00a0\u00bb0&Prime; medium_width=\u00a0\u00bb0&Prime; mobile_width=\u00a0\u00bb0&Prime; css_animation=\u00a0\u00bbalpha-anim\u00a0\u00bb animation_speed=\u00a0\u00bb1000&Prime; sticky=\u00a0\u00bbyes\u00a0\u00bb width=\u00a0\u00bb5\/12&Prime; uncode_shortcode_id=\u00a0\u00bb140681&Prime;][vc_row_inner row_inner_height_percent=\u00a0\u00bb0&Prime; overlay_alpha=\u00a0\u00bb50&Prime; gutter_size=\u00a0\u00bb4&Prime; shift_y=\u00a0\u00bb0&Prime; z_index=\u00a0\u00bb0&Prime; limit_content=\u00a0\u00bb\u00a0\u00bb][vc_column_inner column_width_percent=\u00a0\u00bb100&Prime; gutter_size=\u00a0\u00bb3&Prime; font_family=\u00a0\u00bbfont-613363&Prime; overlay_alpha=\u00a0\u00bb50&Prime; shift_x=\u00a0\u00bb0&Prime; shift_y=\u00a0\u00bb0&Prime; shift_y_down=\u00a0\u00bb0&Prime; z_index=\u00a0\u00bb0&Prime; medium_width=\u00a0\u00bb4&Prime; mobile_width=\u00a0\u00bb0&Prime; width=\u00a0\u00bb1\/1&Prime; uncode_shortcode_id=\u00a0\u00bb184495&Prime;][vc_custom_heading text_size=\u00a0\u00bbh3&Prime; uncode_shortcode_id=\u00a0\u00bb155234&Prime;]Informations g\u00e9n\u00e9rales[\/vc_custom_heading][vc_column_text uncode_shortcode_id=\u00a0\u00bb198462&Prime;]<\/p>\n<div class=\"uncode_text_column\">\n<p>Ce stage devrait se poursuivre par une th\u00e8se de doctorat, pour laquelle un financement du programme NumPEx PEPR est d\u00e9j\u00e0 assur\u00e9.<\/p>\n<p>Le candidat retenu rejoindra l&rsquo;\u00e9quipe <a href=\"https:\/\/www.ens-lyon.fr\/LIP\/ROMA\/\" target=\"_blank\" rel=\"noopener\">ROMA<\/a>, \u00e0 l&rsquo;ENS Lyon dans le laboratoire LIP.<\/p>\n<p><span dir=\"ltr\" role=\"presentation\"><a href=\"https:\/\/www.ens-lyon.fr\/LIP\/\" target=\"_blank\" rel=\"noopener\">Laboratoire de l&rsquo;Informatique du Parall\u00e9lisme<\/a><br \/>\nENS de Lyon<br \/>\n46, all\u00e9e d&rsquo;Italie<br \/>\n69364 LYON CEDEX 07<\/span><\/p>\n<p>Dur\u00e9e : 6 mois<\/p>\n<\/div>\n<div class=\"uncode_text_column\">\n<p>Date de d\u00e9but : printemps 2025 (avec une th\u00e8se de doctorat d\u00e9butant \u00e0 l&rsquo;automne 2025).<\/p>\n<p>Le stage (et la th\u00e8se de doctorat) sera supervis\u00e9 par Anne Benoit et Yves Robert. <a href=\"mailto:Emmanuel.Agullo@inria.fr\">Emmanuel Agullo<\/a> sera \u00e9galement co-encadrant. <\/p>\n<\/div>\n<p>[\/vc_column_text][vc_custom_heading text_size=\u00a0\u00bbh3&Prime; uncode_shortcode_id=\u00a0\u00bb189947&Prime;]Pour candidater[\/vc_custom_heading][vc_column_text uncode_shortcode_id=\u00a0\u00bb112512&Prime;]Les candidatures doivent \u00eatre envoy\u00e9es \u00e0 Anne Benoit<a href=\"mailto:Anne.Benoit@ens-lyon.fr\" target=\"_blank\" rel=\"noopener\">(Anne.Benoit@ens-lyon.fr).<\/a> Elles doivent contenir un seul fichier PDF : <\/p>\n<ul>\n<li>Une lettre de motivation<\/li>\n<li>Un CV d\u00e9taill\u00e9<\/li>\n<li>Un relev\u00e9 de notes (licence\/master)<\/li>\n<li>R\u00e9sum\u00e9 d&rsquo;une page des travaux de recherche men\u00e9s jusqu&rsquo;\u00e0 pr\u00e9sent et liste des publications (le cas \u00e9ch\u00e9ant)<\/li>\n<li>Au moins deux lettres de recommandation.<\/li>\n<\/ul>\n<p>[\/vc_column_text][\/vc_column_inner][\/vc_row_inner][\/vc_column][vc_column column_width_percent=\u00a0\u00bb100&Prime; position_vertical=\u00a0\u00bbmiddle\u00a0\u00bb gutter_size=\u00a0\u00bb3&Prime; font_family=\u00a0\u00bbfont-613363&Prime; overlay_alpha=\u00a0\u00bb50&Prime; shift_x=\u00a0\u00bb0&Prime; shift_y=\u00a0\u00bb0&Prime; shift_y_down=\u00a0\u00bb0&Prime; z_index=\u00a0\u00bb0&Prime; medium_width=\u00a0\u00bb0&Prime; mobile_width=\u00a0\u00bb0&Prime; css_animation=\u00a0\u00bbalpha-anim\u00a0\u00bb animation_speed=\u00a0\u00bb1000&Prime; width=\u00a0\u00bb7\/12&Prime; uncode_shortcode_id=\u00a0\u00bb484410&Prime;][vc_custom_heading text_size=\u00a0\u00bbh3&Prime; uncode_shortcode_id=\u00a0\u00bb918626&Prime;]Contexte[\/vc_custom_heading][vc_column_text text_lead=\u00a0\u00bbyes\u00a0\u00bb uncode_shortcode_id=\u00a0\u00bb188343&Prime;]Lanc\u00e9 en 2023 pour une dur\u00e9e de 6 ans, The NumPEx PEPR a pour objectif de contribuer \u00e0 la conception et au d\u00e9veloppement de m\u00e9thodes num\u00e9riques et de composants logiciels qui \u00e9quiperont les futures machines europ\u00e9ennes Exascale et post-Exascale. NumPEx vise \u00e9galement \u00e0 aider les applications scientifiques et industrielles \u00e0 exploiter pleinement leur potentiel.<\/p>\n<p>Plusieurs sources d&rsquo;erreur peuvent avoir un impact sur l&rsquo;ex\u00e9cution d&rsquo;algorithmes it\u00e9ratifs sur des plates-formes \u00e0 grande \u00e9chelle. Elles<br \/>\ncomprennent les erreurs d&rsquo;arr\u00eat, qui sont imm\u00e9diatement d\u00e9tect\u00e9es, et les erreurs silencieuses (corruptions silencieuses de donn\u00e9es), qui peuvent \u00eatre d\u00e9tect\u00e9es par le biais d&rsquo;un m\u00e9canisme de v\u00e9rification. Les erreurs d&rsquo;arr\u00eat correspondent \u00e0 des d\u00e9faillances permanentes, par exemple des pannes de processeur. Les erreurs silencieuses sont des perturbations qui frappent et restent ind\u00e9tect\u00e9es jusqu&rsquo;\u00e0 ce qu&rsquo;elles se manifestent \u00e9ventuellement par un comportement \u00e9trange de l&rsquo;application. Les erreurs silencieuses proviennent de deux sources principales : les erreurs de calcul et les inversions de bits dans la m\u00e9moire.<br \/>\nLa protection des algorithmes et des biblioth\u00e8ques logicielles contre toutes ces erreurs est une pr\u00e9occupation majeure au sein de la communaut\u00e9 HPC.<br \/>\nLa mani\u00e8re standard de traiter les erreurs d&rsquo;arr\u00eat est le checkpoint-restart, et la p\u00e9riode optimale de checkpoint est bien connue, au moins pour les temps d&rsquo;inter-arriv\u00e9e des erreurs IID sans m\u00e9moire. Cependant, l&rsquo;att\u00e9nuation de l&rsquo;impact des erreurs silencieuses reste un d\u00e9fi ouvert. D&rsquo;une part, la r\u00e9plication (ou m\u00eame la triplication pour \u00e9viter une r\u00e9ex\u00e9cution s\u00e9quentielle) fait parfaitement l&rsquo;affaire, mais \u00e0 un co\u00fbt prohibitif. D&rsquo;autre part, de nombreux d\u00e9tecteurs sp\u00e9cifiques aux applications ont \u00e9t\u00e9 introduits, tels que les sommes de contr\u00f4le ABFT (Algorithm-Based Fault Tolerance), le recalcul d&rsquo;un r\u00e9sidu, la v\u00e9rification de l&rsquo;orthogonalit\u00e9<br \/>\nde certains vecteurs, l&rsquo;application de filtres spatiaux et temporels sur un voisinage, etc. Ces d\u00e9tecteurs sont g\u00e9n\u00e9ralement limit\u00e9s \u00e0 un type d&rsquo;erreur particulier. Ces d\u00e9tecteurs sont g\u00e9n\u00e9ralement limit\u00e9s \u00e0 un type d&rsquo;erreur particulier. Un probl\u00e8me majeur est qu&rsquo;ils peuvent soit ne pas d\u00e9tecter certaines erreurs, soit d\u00e9clencher de nombreuses fausses alertes. En d&rsquo;autres termes, ces d\u00e9tecteurs ne sont pas parfaits : leur rappel et leur pr\u00e9cision ne sont pas de 100 %. La plupart des travaux publi\u00e9s, sinon tous, partent du principe que les d\u00e9tecteurs sont parfaits, ce qui n&rsquo;est pas r\u00e9aliste.[\/vc_column_text][vc_custom_heading text_size=\u00a0\u00bbh3&Prime; uncode_shortcode_id=\u00a0\u00bb620054&Prime;]La mission[\/vc_custom_heading][vc_column_text text_lead=\u00a0\u00bbyes\u00a0\u00bb uncode_shortcode_id=\u00a0\u00bb111959&Prime;]Le premier (et principal) objectif de ce stage est de concevoir et d&rsquo;\u00e9valuer des strat\u00e9gies d&rsquo;ordonnancement bas\u00e9es<br \/>\nsur une combinaison de points de contr\u00f4le et de d\u00e9tecteurs imparfaits afin de garantir une protection contre une source unique d&rsquo;erreurs silencieuses avec une probabilit\u00e9 \u00e9lev\u00e9e. Cela n\u00e9cessite d&rsquo;introduire certaines hypoth\u00e8ses, telles que la limite sup\u00e9rieure de la latence de la d\u00e9tection, ou d&rsquo;introduire des tests al\u00e9atoires sur les donn\u00e9es.<br \/>\nLa deuxi\u00e8me \u00e9tape (qui pourrait intervenir plus tard au cours d&rsquo;un doctorat) est de fournir une m\u00e9thodologie holistique r\u00e9siliente pour prot\u00e9ger les algorithmes it\u00e9ratifs<br \/>\nde tous les types d&rsquo;erreurs, \u00e0 savoir les erreurs de type fail-stop et toutes les sources d&rsquo;erreurs silencieuses.<br \/>\nCe stage devrait se poursuivre par une th\u00e8se de doctorat, pour laquelle un financement du programme NumPEx PEPR est d\u00e9j\u00e0 assur\u00e9.[\/vc_column_text][vc_custom_heading uncode_shortcode_id=\u00a0\u00bb157455&Prime;]Comp\u00e9tences requises[\/vc_custom_heading][vc_column_text text_lead=\u00a0\u00bbyes\u00a0\u00bb uncode_shortcode_id=\u00a0\u00bb551232&Prime;]Quelques connaissances en conception d&rsquo;algorithmes, en complexit\u00e9 et en probabilit\u00e9s.<br \/>\nLe travail porte sur l&rsquo;aspect algorithmique du probl\u00e8me, avec des simulations potentielles pour valider les r\u00e9sultats.[\/vc_column_text][vc_custom_heading uncode_shortcode_id=\u00a0\u00bb146686&Prime;]<\/p>\n<h2 class=\"h2\">Plus d&rsquo;informations et r\u00e9f\u00e9rences<\/h2>\n<p>[\/vc_custom_heading][vc_column_text text_lead=\u00a0\u00bbyes\u00a0\u00bb uncode_shortcode_id=\u00a0\u00bb177853&Prime;]Pour plus d&rsquo;informations, veuillez contacter Anne Benoit<a href=\"mailto:Anne.Benoit@ens-lyon.fr\">(Anne.Benoit@ens-lyon.fr)<\/a>, Yves Robert<a href=\"mailto:Yves.Robert@ens-lyon.fr\">(Yves.Robert@ens-lyon.fr)<\/a> ou Emmanuel Agullo<a href=\"mailto:Emmanuel.Agullo@inria.fr\">(Emmanuel.Agullo@inria.fr)<\/a>.[\/vc_column_text][vc_single_image media=\u00a0\u00bb163&Prime; media_width_percent=\u00a0\u00bb12&Prime; alignment=\u00a0\u00bbcenter\u00a0\u00bb uncode_shortcode_id=\u00a0\u00bb185459&Prime; media_link=\u00a0\u00bburl:https%3A%2F%2Fnumpex.org%2Fwp-content%2Fuploads%2Fsites%2F6%2F2025%2F02%2FOffreStageThese-FTalgo.pdf|target:_blank\u00a0\u00bb][\/vc_column][\/vc_row]<\/p>\n<\/div>","protected":false},"excerpt":{"rendered":"<p>[vc_row row_height_percent=\u00a0\u00bb60&Prime; override_padding=\u00a0\u00bbyes\u00a0\u00bb h_padding=\u00a0\u00bb2&Prime; top_padding=\u00a0\u00bb5&Prime; bottom_padding=\u00a0\u00bb5&Prime; back_color=\u00a0\u00bbaccent\u00a0\u00bb back_image=\u00a0\u00bb153&Prime; overlay_color=\u00a0\u00bbcolor-prif\u00a0\u00bb overlay_alpha=\u00a0\u00bb80&Prime; gutter_size=\u00a0\u00bb100&Prime; column_width_percent=\u00a0\u00bb100&Prime; shift_y=\u00a0\u00bb0&Prime; z_index=\u00a0\u00bb0&Prime; bottom_divider=\u00a0\u00bbstep\u00a0\u00bb style=\u00a0\u00bbinherited\u00a0\u00bb css=\u00a0\u00bb.vc_custom_1686752211509{border-top-width: 0px !important;}\u00a0\u00bb el_class=\u00a0\u00bbhomepage-search\u00a0\u00bb [&hellip;]<\/p>\n","protected":false},"author":14,"featured_media":204,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"iawp_total_views":12,"footnotes":"","_members_access_role":[],"_members_access_error":""},"portfolio_category":[],"class_list":["post-2235","portfolio","type-portfolio","status-publish","has-post-thumbnail","hentry"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v28.1 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Stage sur les strat\u00e9gies d&#039;ordonnancement tol\u00e9rantes aux fautes pour les algorithmes it\u00e9ratifs - NumPEx<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/numpex.org\/fr\/job-offers\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\/\" \/>\n<meta property=\"og:locale\" content=\"fr_FR\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Stage sur les strat\u00e9gies d&#039;ordonnancement tol\u00e9rantes aux fautes pour les algorithmes it\u00e9ratifs - NumPEx\" \/>\n<meta property=\"og:description\" content=\"[vc_row row_height_percent=\u00a0\u00bb60&Prime; override_padding=\u00a0\u00bbyes\u00a0\u00bb h_padding=\u00a0\u00bb2&Prime; top_padding=\u00a0\u00bb5&Prime; bottom_padding=\u00a0\u00bb5&Prime; back_color=\u00a0\u00bbaccent\u00a0\u00bb back_image=\u00a0\u00bb153&Prime; overlay_color=\u00a0\u00bbcolor-prif\u00a0\u00bb overlay_alpha=\u00a0\u00bb80&Prime; gutter_size=\u00a0\u00bb100&Prime; column_width_percent=\u00a0\u00bb100&Prime; shift_y=\u00a0\u00bb0&Prime; z_index=\u00a0\u00bb0&Prime; bottom_divider=\u00a0\u00bbstep\u00a0\u00bb style=\u00a0\u00bbinherited\u00a0\u00bb css=\u00a0\u00bb.vc_custom_1686752211509{border-top-width: 0px !important;}\u00a0\u00bb el_class=\u00a0\u00bbhomepage-search\u00a0\u00bb [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/numpex.org\/fr\/job-offers\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\/\" \/>\n<meta property=\"og:site_name\" content=\"NumPEx\" \/>\n<meta property=\"article:modified_time\" content=\"2025-07-15T07:50:04+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/numpex.org\/wp-content\/uploads\/sites\/6\/2023\/06\/Illustration_for_hiring_scientist_on_the_exascale-01-1920px-low.jpg\" \/>\n\t<meta property=\"og:image:width\" content=\"1920\" \/>\n\t<meta property=\"og:image:height\" content=\"1076\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/jpeg\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Dur\u00e9e de lecture estim\u00e9e\" \/>\n\t<meta name=\"twitter:data1\" content=\"7 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/numpex.org\\\/fr\\\/job-offers\\\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\\\/\",\"url\":\"https:\\\/\\\/numpex.org\\\/fr\\\/job-offers\\\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\\\/\",\"name\":\"Stage sur les strat\u00e9gies d'ordonnancement tol\u00e9rantes aux fautes pour les algorithmes it\u00e9ratifs - NumPEx\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/numpex.org\\\/fr\\\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/numpex.org\\\/fr\\\/job-offers\\\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\\\/#primaryimage\"},\"image\":{\"@id\":\"https:\\\/\\\/numpex.org\\\/fr\\\/job-offers\\\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/numpex.org\\\/wp-content\\\/uploads\\\/sites\\\/6\\\/2023\\\/06\\\/Illustration_for_hiring_scientist_on_the_exascale-01-1920px-low.jpg\",\"datePublished\":\"2025-02-13T09:59:09+00:00\",\"dateModified\":\"2025-07-15T07:50:04+00:00\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/numpex.org\\\/fr\\\/job-offers\\\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\\\/#breadcrumb\"},\"inLanguage\":\"fr-FR\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/numpex.org\\\/fr\\\/job-offers\\\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\\\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"fr-FR\",\"@id\":\"https:\\\/\\\/numpex.org\\\/fr\\\/job-offers\\\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\\\/#primaryimage\",\"url\":\"https:\\\/\\\/numpex.org\\\/wp-content\\\/uploads\\\/sites\\\/6\\\/2023\\\/06\\\/Illustration_for_hiring_scientist_on_the_exascale-01-1920px-low.jpg\",\"contentUrl\":\"https:\\\/\\\/numpex.org\\\/wp-content\\\/uploads\\\/sites\\\/6\\\/2023\\\/06\\\/Illustration_for_hiring_scientist_on_the_exascale-01-1920px-low.jpg\",\"width\":1920,\"height\":1076},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/numpex.org\\\/fr\\\/job-offers\\\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/numpex.org\\\/fr\\\/accueil\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Job offers\",\"item\":\"https:\\\/\\\/numpex.org\\\/fr\\\/job-offers\\\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Stage sur les strat\u00e9gies d&rsquo;ordonnancement tol\u00e9rantes aux fautes pour les algorithmes it\u00e9ratifs\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/numpex.org\\\/fr\\\/#website\",\"url\":\"https:\\\/\\\/numpex.org\\\/fr\\\/\",\"name\":\"NumPEx\",\"description\":\"Digital for Exascale\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/numpex.org\\\/fr\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"fr-FR\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Stage sur les strat\u00e9gies d'ordonnancement tol\u00e9rantes aux fautes pour les algorithmes it\u00e9ratifs - NumPEx","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/numpex.org\/fr\/job-offers\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\/","og_locale":"fr_FR","og_type":"article","og_title":"Stage sur les strat\u00e9gies d'ordonnancement tol\u00e9rantes aux fautes pour les algorithmes it\u00e9ratifs - NumPEx","og_description":"[vc_row row_height_percent=\u00a0\u00bb60&Prime; override_padding=\u00a0\u00bbyes\u00a0\u00bb h_padding=\u00a0\u00bb2&Prime; top_padding=\u00a0\u00bb5&Prime; bottom_padding=\u00a0\u00bb5&Prime; back_color=\u00a0\u00bbaccent\u00a0\u00bb back_image=\u00a0\u00bb153&Prime; overlay_color=\u00a0\u00bbcolor-prif\u00a0\u00bb overlay_alpha=\u00a0\u00bb80&Prime; gutter_size=\u00a0\u00bb100&Prime; column_width_percent=\u00a0\u00bb100&Prime; shift_y=\u00a0\u00bb0&Prime; z_index=\u00a0\u00bb0&Prime; bottom_divider=\u00a0\u00bbstep\u00a0\u00bb style=\u00a0\u00bbinherited\u00a0\u00bb css=\u00a0\u00bb.vc_custom_1686752211509{border-top-width: 0px !important;}\u00a0\u00bb el_class=\u00a0\u00bbhomepage-search\u00a0\u00bb [&hellip;]","og_url":"https:\/\/numpex.org\/fr\/job-offers\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\/","og_site_name":"NumPEx","article_modified_time":"2025-07-15T07:50:04+00:00","og_image":[{"width":1920,"height":1076,"url":"https:\/\/numpex.org\/wp-content\/uploads\/sites\/6\/2023\/06\/Illustration_for_hiring_scientist_on_the_exascale-01-1920px-low.jpg","type":"image\/jpeg"}],"twitter_card":"summary_large_image","twitter_misc":{"Dur\u00e9e de lecture estim\u00e9e":"7 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/numpex.org\/fr\/job-offers\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\/","url":"https:\/\/numpex.org\/fr\/job-offers\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\/","name":"Stage sur les strat\u00e9gies d'ordonnancement tol\u00e9rantes aux fautes pour les algorithmes it\u00e9ratifs - NumPEx","isPartOf":{"@id":"https:\/\/numpex.org\/fr\/#website"},"primaryImageOfPage":{"@id":"https:\/\/numpex.org\/fr\/job-offers\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\/#primaryimage"},"image":{"@id":"https:\/\/numpex.org\/fr\/job-offers\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\/#primaryimage"},"thumbnailUrl":"https:\/\/numpex.org\/wp-content\/uploads\/sites\/6\/2023\/06\/Illustration_for_hiring_scientist_on_the_exascale-01-1920px-low.jpg","datePublished":"2025-02-13T09:59:09+00:00","dateModified":"2025-07-15T07:50:04+00:00","breadcrumb":{"@id":"https:\/\/numpex.org\/fr\/job-offers\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\/#breadcrumb"},"inLanguage":"fr-FR","potentialAction":[{"@type":"ReadAction","target":["https:\/\/numpex.org\/fr\/job-offers\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\/"]}]},{"@type":"ImageObject","inLanguage":"fr-FR","@id":"https:\/\/numpex.org\/fr\/job-offers\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\/#primaryimage","url":"https:\/\/numpex.org\/wp-content\/uploads\/sites\/6\/2023\/06\/Illustration_for_hiring_scientist_on_the_exascale-01-1920px-low.jpg","contentUrl":"https:\/\/numpex.org\/wp-content\/uploads\/sites\/6\/2023\/06\/Illustration_for_hiring_scientist_on_the_exascale-01-1920px-low.jpg","width":1920,"height":1076},{"@type":"BreadcrumbList","@id":"https:\/\/numpex.org\/fr\/job-offers\/stage-sur-les-strategies-dordonnancement-tolerantes-aux-fautes-pour-les-algorithmes-iteratifs\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/numpex.org\/fr\/accueil\/"},{"@type":"ListItem","position":2,"name":"Job offers","item":"https:\/\/numpex.org\/fr\/job-offers\/"},{"@type":"ListItem","position":3,"name":"Stage sur les strat\u00e9gies d&rsquo;ordonnancement tol\u00e9rantes aux fautes pour les algorithmes it\u00e9ratifs"}]},{"@type":"WebSite","@id":"https:\/\/numpex.org\/fr\/#website","url":"https:\/\/numpex.org\/fr\/","name":"NumPEx","description":"Digital for Exascale","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/numpex.org\/fr\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"fr-FR"}]}},"_links":{"self":[{"href":"https:\/\/numpex.org\/fr\/wp-json\/wp\/v2\/portfolio\/2235","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/numpex.org\/fr\/wp-json\/wp\/v2\/portfolio"}],"about":[{"href":"https:\/\/numpex.org\/fr\/wp-json\/wp\/v2\/types\/portfolio"}],"author":[{"embeddable":true,"href":"https:\/\/numpex.org\/fr\/wp-json\/wp\/v2\/users\/14"}],"replies":[{"embeddable":true,"href":"https:\/\/numpex.org\/fr\/wp-json\/wp\/v2\/comments?post=2235"}],"version-history":[{"count":0,"href":"https:\/\/numpex.org\/fr\/wp-json\/wp\/v2\/portfolio\/2235\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/numpex.org\/fr\/wp-json\/wp\/v2\/media\/204"}],"wp:attachment":[{"href":"https:\/\/numpex.org\/fr\/wp-json\/wp\/v2\/media?parent=2235"}],"wp:term":[{"taxonomy":"portfolio_category","embeddable":true,"href":"https:\/\/numpex.org\/fr\/wp-json\/wp\/v2\/portfolio_category?post=2235"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}