<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of tel-00011516</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-25T02:40:32+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Scheduling algorithms for parallel platforms</title>
            <title xml:lang="fr">Algorithmes d'ordonnancement pour les nouveaux supports d'exécution</title>
            <author role="aut">
              <persName>
                <forename type="first">Pierre-François</forename>
                <surname>Dutot</surname>
              </persName>
              <email type="md5">07241c94e39897011d5300d62fe6cc32</email>
              <email type="domain">univ-grenoble-alpes.fr</email>
              <idno type="idhal" notation="string">pfdutot</idno>
              <idno type="idhal" notation="numeric">1341962</idno>
              <idno type="halauthorid" notation="string">106133-1341962</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-1992-3388</idno>
              <affiliation ref="#struct-2401"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Pierre-François</forename>
                <surname>Dutot</surname>
              </persName>
              <email type="md5">07241c94e39897011d5300d62fe6cc32</email>
              <email type="domain">univ-grenoble-alpes.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2006-02-01 12:15:12</date>
              <date type="whenModified">2025-09-27 20:06:48</date>
              <date type="whenReleased">2006-02-01 12:35:18</date>
              <date type="whenProduced">2004-08-27</date>
              <date type="whenEndEmbargoed">2006-02-01</date>
              <ref type="file" target="https://theses.hal.science/tel-00011516v1/document">
                <date notBefore="2006-02-01"/>
              </ref>
              <ref type="file" n="1" target="https://theses.hal.science/tel-00011516v1/file/these.pdf" id="file-57383-573360">
                <date notBefore="2006-02-01"/>
              </ref>
              <ref type="annex" subtype="other" n="0" target="https://theses.hal.science/tel-00011516v1/file/thesis_slides.pdf" id="file-57383-573359">
                <date notBefore="2006-02-01"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="108824">
                <persName>
                  <forename>Pierre-François</forename>
                  <surname>Dutot</surname>
                </persName>
                <email type="md5">07241c94e39897011d5300d62fe6cc32</email>
                <email type="domain">univ-grenoble-alpes.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">tel-00011516</idno>
            <idno type="halUri">https://theses.hal.science/tel-00011516</idno>
            <idno type="halBibtex">dutot:tel-00011516</idno>
            <idno type="halRefHtml">Réseaux et télécommunications [cs.NI]. Institut National Polytechnique de Grenoble - INPG, 2004. Français. &lt;a target="_blank" href="https://www.theses.fr/"&gt;&amp;#x27E8;NNT : &amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Réseaux et télécommunications [cs.NI]. Institut National Polytechnique de Grenoble - INPG, 2004. Français. &amp;#x27E8;NNT : &amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-57383-573360"/><ref corresp="#file-57383-573359"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UGA">HAL Grenoble Alpes</idno>
            <idno type="stamp" n="IMAG">IMAG</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="UNIV-GRENOBLE1">Université Joseph Fourier - Grenoble I</idno>
            <idno type="stamp" n="INPG">Institut polytechnique de Grenoble</idno>
            <idno type="stamp" n="INRIA-RHA">INRIA Grenoble - Rhône-Alpes</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="INRIA-RENGRE">INRIA-RENGRE</idno>
            <idno type="stamp" n="UGA-EPE">Université Grenoble Alpes [2020-*]</idno>
            <idno type="stamp" n="UGA-SPAO-TEST">Thèses de l'Université Grenoble Alpes</idno>
            <idno type="stamp" n="TEST-UGA">TEST-UGA</idno>
          </seriesStmt>
          <notesStmt/>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Scheduling algorithms for parallel platforms</title>
                <title xml:lang="fr">Algorithmes d'ordonnancement pour les nouveaux supports d'exécution</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Pierre-François</forename>
                    <surname>Dutot</surname>
                  </persName>
                  <email type="md5">07241c94e39897011d5300d62fe6cc32</email>
                  <email type="domain">univ-grenoble-alpes.fr</email>
                  <idno type="idhal" notation="string">pfdutot</idno>
                  <idno type="idhal" notation="numeric">1341962</idno>
                  <idno type="halauthorid" notation="string">106133-1341962</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-1992-3388</idno>
                  <affiliation ref="#struct-2401"/>
                </author>
              </analytic>
              <monogr>
                <imprint>
                  <date type="dateDefended">2004-08-27</date>
                </imprint>
                <authority type="institution">Institut National Polytechnique de Grenoble - INPG</authority>
                <authority type="school">Mathématiques, Sciences et Technologies de l'Information (Informatique)</authority>
                <authority type="supervisor">Denis Trystram(Denis.Trystram@imag.fr)</authority>
                <authority type="jury">M. MICHEL COSNARD (Président)</authority>
                <authority type="jury">M. KLAUS JANSEN (Rapporteur)</authority>
                <authority type="jury">M. YVES ROBERT (Rapporteur)</authority>
                <authority type="jury">M. ARNOLD ROSENBERG (Examinateur)</authority>
                <authority type="jury">M. VAN-DAT CUNG (Examinateur)</authority>
                <authority type="jury">M. DENIS TRYSTRAM (Directeur de thèse)</authority>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="fr">French</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Scheduling</term>
                <term xml:lang="en">Parallelism</term>
                <term xml:lang="en">Algorithm</term>
                <term xml:lang="en">NP-Completeness</term>
                <term xml:lang="fr">Ordonnancement</term>
                <term xml:lang="fr">Parallèlisme</term>
                <term xml:lang="fr">Algorithmes</term>
                <term xml:lang="fr">NP-Complétude</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ni">Computer Science [cs]/Networking and Internet Architecture [cs.NI]</classCode>
              <classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</classCode>
              <classCode scheme="halTypology" n="THESE">Theses</classCode>
              <classCode scheme="halOldTypology" n="THESE">Theses</classCode>
              <classCode scheme="halTreeTypology" n="THESE">Theses</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Grid processing and clusters are today a cost efficient alternative to&lt;br /&gt;stand-alone high performance multi-processors. Large national projects&lt;br /&gt;such as GRID5000 in France are relying on this kind of architectures. This&lt;br /&gt;change in the high performance computing landscape calls for new dedicated algorithms to get the best out of these new machines. To define such algorithms and to prove their efficiency, we have to consider new&lt;br /&gt;computing models, which closely simulates the hardware while staying&lt;br /&gt;simple enough to be understandable and useful. In this thesis, we studied&lt;br /&gt;two models in particular, chosen among the post important for these&lt;br /&gt;architectures. For each model we provided optimal polynomial algorithms&lt;br /&gt;for some problems, or approximation algorithms and NP-hardness proofs if&lt;br /&gt;needed.</p>
            </abstract>
            <abstract xml:lang="fr">
              <p>Les nouveaux supports d'exécution que sont les grilles de processeurs&lt;br /&gt;apparaissent aujourd'hui comme une alternative économiquement viable aux grands systèmes de calcul centralisés. De grands projets nationaux comme GRID5000 sont basés sur ce concept de machines réparties. Ce changement du paysage du calcul parallèle haute performance a créé une nouvelle demande d'algorithmes spécifiques pour tirer le meilleur parti des ressources déployées. Pour concevoir ces algorithmes et démontrer leur efficacité, il faut s'appuyer sur des modèles qui tentent de décrire fidèlement le comportement réel des machines tout en restant suffisamment simples à manipuler. Dans cette thèse, nous avons étudié deux modèles parmi les plus importants pour ces nouveaux supports et nous avons fourni des algorithmes polynomiaux optimaux, des algorithmes d'approximations garantis, ou des preuves de NP-complètudes le cas échéant.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-2401" status="OLD">
          <idno type="RNSR">199521420J</idno>
          <orgName>Parallel algorithms and load sharing</orgName>
          <orgName type="acronym">APACHE</orgName>
          <desc>
            <address>
              <addrLine>Centre de recherche Inria655 avenue de l'Europe38330 Montbonnot Saint-Martin</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/apache</ref>
          </desc>
          <listRelation>
            <relation active="#struct-189" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-300275" type="indirect"/>
            <relation name="UMR5132" active="#struct-441569" type="indirect"/>
            <relation active="#struct-2497" type="direct"/>
            <relation active="#struct-51016" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-189" status="OLD">
          <idno type="IdRef">185271960</idno>
          <orgName>Informatique et Distribution</orgName>
          <orgName type="acronym">ID-IMAG</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2007-01-01</date>
          <desc>
            <address>
              <addrLine>ENSIMAG - antenne de Montbonnot ZIRST - 51, avenue Jean Kuntzmann - 38 330 Montbonnot Saint Martin</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www-id.imag.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-300275" type="direct"/>
            <relation name="UMR5132" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300275" status="OLD">
          <idno type="IdRef">026388804</idno>
          <orgName>Institut National Polytechnique de Grenoble</orgName>
          <orgName type="acronym">INPG</orgName>
          <date type="end">2006-12-31</date>
          <desc>
            <address>
              <addrLine>46 avenue Félix Viallet 38031 Grenoble Cedex 1</addrLine>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-2497" status="VALID">
          <idno type="RNSR">199218244V</idno>
          <idno type="ROR">https://ror.org/00n8d6z93</idno>
          <orgName>Centre Inria de l'Université Grenoble Alpes</orgName>
          <desc>
            <address>
              <addrLine>Inovallée655 avenue de l'Europe38330 Montbonnot</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/grenoble</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-51016" status="OLD">
          <idno type="IdRef">026404796</idno>
          <idno type="ROR">https://ror.org/02aj0kh94</idno>
          <orgName>Université Joseph Fourier - Grenoble 1</orgName>
          <orgName type="acronym">UJF</orgName>
          <date type="end">2015-12-31</date>
          <desc>
            <address>
              <addrLine>BP 53 - 38041 Grenoble Cedex 9</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ujf-grenoble.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>