<?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 hal-02431897</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-24T10:30:15+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Independent tasks on 2 resources with co-scheduling effects</title>
            <author role="aut">
              <persName>
                <forename type="first">Lionel</forename>
                <surname>Eyraud-Dubois</surname>
              </persName>
              <email type="md5">1d9bc1a760022cc8b2ae654a2b20c873</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">lioneleyraud-dubois</idno>
              <idno type="idhal" notation="numeric">174911</idno>
              <idno type="halauthorid" notation="string">285-174911</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-2475-3309</idno>
              <idno type="IDREF">https://www.idref.fr/172645301</idno>
              <affiliation ref="#struct-3102"/>
              <affiliation ref="#struct-90029"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Cristiana</forename>
                <surname>Bentes</surname>
              </persName>
              <idno type="halauthorid">1763730-0</idno>
              <affiliation ref="#struct-4627"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Lionel</forename>
                <surname>Eyraud-Dubois</surname>
              </persName>
              <email type="md5">1d9bc1a760022cc8b2ae654a2b20c873</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2020-01-08 11:21:23</date>
              <date type="whenModified">2025-05-26 14:36:02</date>
              <date type="whenReleased">2020-01-10 09:18:06</date>
              <date type="whenProduced">2020-01-08</date>
              <date type="whenEndEmbargoed">2020-01-08</date>
              <ref type="file" target="https://inria.hal.science/hal-02431897v1/document">
                <date notBefore="2020-01-08"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-02431897v1/file/ProblemStatement.pdf" id="file-2431897-2321120">
                <date notBefore="2020-01-08"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="134387">
                <persName>
                  <forename>Lionel</forename>
                  <surname>Eyraud-Dubois</surname>
                </persName>
                <email type="md5">1d9bc1a760022cc8b2ae654a2b20c873</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02431897</idno>
            <idno type="halUri">https://inria.hal.science/hal-02431897</idno>
            <idno type="halBibtex">eyrauddubois:hal-02431897</idno>
            <idno type="halRefHtml">2020</idno>
            <idno type="halRef">2020</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-2431897-2321120"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <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="ENSEIRB">Ecole Nationale Supérieure d'Electronique, Informatique et Radiocommunications de Bordeaux</idno>
            <idno type="stamp" n="INRIA-BORDEAUX">INRIA Bordeaux - Sud-Ouest</idno>
            <idno type="stamp" n="UNIV-BORDEAUX">Université de Bordeaux</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="TEST-HALCNRS">Collection test HAL CNRS</idno>
            <idno type="stamp" n="INRIA-BRASIL">Inria-Brasil</idno>
            <idno type="stamp" n="UNIVERSITE-BORDEAUX">Université de Bordeaux</idno>
          </seriesStmt>
          <notesStmt/>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Independent tasks on 2 resources with co-scheduling effects</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Lionel</forename>
                    <surname>Eyraud-Dubois</surname>
                  </persName>
                  <email type="md5">1d9bc1a760022cc8b2ae654a2b20c873</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">lioneleyraud-dubois</idno>
                  <idno type="idhal" notation="numeric">174911</idno>
                  <idno type="halauthorid" notation="string">285-174911</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-2475-3309</idno>
                  <idno type="IDREF">https://www.idref.fr/172645301</idno>
                  <affiliation ref="#struct-3102"/>
                  <affiliation ref="#struct-90029"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Cristiana</forename>
                    <surname>Bentes</surname>
                  </persName>
                  <idno type="halauthorid">1763730-0</idno>
                  <affiliation ref="#struct-4627"/>
                </author>
              </analytic>
              <monogr>
                <imprint/>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">GPU Concurrency</term>
                <term xml:lang="en">Scheduling</term>
                <term xml:lang="en">Preemption</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-dc">Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]</classCode>
              <classCode scheme="halTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
              <classCode scheme="halOldTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
              <classCode scheme="halTreeTypology" n="UNDEFINED">Preprints, Working Papers, ...</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Concurrent kernel execution is a relatively new feature in modern GPUs, which was designed to improve hardware utilization and the overall system throughput. However, the decision on the simultaneous execution of tasks is performed by the hardware with a leftover policy, that assigns as many resources as possible for one task and then assigns the remaining resources to the next task. This can lead to unreasonable use of resources. In this work, we tackle the problem of co-scheduling for GPUs with and without preemption, with the focus on determining the kernels submission order to reduce the number of preemptions and the kernels makespan, respectively. We propose a graph-based theoretical model to build preemptive and non-preemptive schedules. We show that the optimal preemptive makespan can be computed by solving a Linear Program in polynomial time, and we propose an algorithm based on this solution which minimizes the number of preemptions. We also propose an algorithm that transforms a preemptive solution of optimal makespan into a non-preemptive solution with the smallest possible preemption overhead. We show, however, that finding the minimal amount of preemptions among all preemptive solutions of optimal makespan is a NP-hard problem, and computing the optimal non-preemptive schedule is also NP-hard. In addition, we study the non-preemptive problem, without searching first for a good preemptive solution, and present a Mixed Integer Linear Program solution to this problem. We performed experiments on real-world GPU applications and our approach can achieve optimal makespan by preempting 6 to 9% of the tasks. Our non-preemptive approach, on the other side, obtains makespan within 2.5% of the optimal preemptive schedules, while previous approaches exceed the preemptive makespan by 5 to 12%.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-3102" status="VALID">
          <idno type="IdRef">155054465</idno>
          <idno type="ISNI">0000000122898198</idno>
          <idno type="RNSR">199511665F</idno>
          <idno type="ROR">https://ror.org/03adqg323</idno>
          <idno type="Wikidata">Q3214395</idno>
          <orgName>Laboratoire Bordelais de Recherche en Informatique</orgName>
          <orgName type="acronym">LaBRI</orgName>
          <date type="start">1988-01-01</date>
          <desc>
            <address>
              <addrLine>Domaine Universitaire 351, cours de la Libération 33405 Talence Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.labri.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-259761" type="direct"/>
            <relation active="#struct-300366" type="direct"/>
            <relation name="UMR5800 / URA1304" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-90029" status="OLD">
          <idno type="RNSR">201019619L</idno>
          <orgName>High-End Parallel Algorithms for Challenging Numerical Simulations</orgName>
          <orgName type="acronym">HiePACS</orgName>
          <date type="end">2023-02-28</date>
          <desc>
            <address>
              <addrLine>200, avenue de la Vieille Tour 33405 Talence cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/hiepacs</ref>
          </desc>
          <listRelation>
            <relation active="#struct-3102" type="direct"/>
            <relation active="#struct-259761" type="indirect"/>
            <relation active="#struct-300366" type="indirect"/>
            <relation name="UMR5800 / URA1304" active="#struct-441569" type="indirect"/>
            <relation active="#struct-104751" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-4627" status="VALID">
          <idno type="IdRef">031259766</idno>
          <idno type="ISNI">0000000109416510</idno>
          <idno type="ROR">https://ror.org/0198v2949</idno>
          <idno type="Wikidata">Q2840233</idno>
          <orgName>Universidade do Estado do Rio de Janeiro [Brasil] = Rio de Janeiro State University [Brazil] = Université d'État de Rio de Janeiro [Brésil]</orgName>
          <orgName type="acronym">UERJ</orgName>
          <desc>
            <address>
              <addrLine>UERJ, Av. Sao Francisco Xavier, 524, Maracana, 20550-900, Rio de Janeiro</addrLine>
              <country key="BR"/>
            </address>
            <ref type="url">http://www.uerj.br</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-259761" status="VALID">
          <idno type="IdRef">175206562</idno>
          <idno type="ROR">https://ror.org/057qpr032</idno>
          <orgName>Université de Bordeaux</orgName>
          <orgName type="acronym">UB</orgName>
          <desc>
            <address>
              <addrLine>35, place Pey Berland - 33076 Bordeaux</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-bordeaux.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300366" status="VALID">
          <orgName>École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)</orgName>
          <desc>
            <address>
              <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-104751" status="VALID">
          <idno type="RNSR">200818243Z</idno>
          <idno type="ROR">https://ror.org/03tjcj052</idno>
          <orgName>Centre Inria de l'Université de Bordeaux</orgName>
          <desc>
            <address>
              <addrLine>200, avenue de la Vieille Tour, 33405 Talence</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/bordeaux/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" 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>
      </listOrg>
    </back>
  </text>
</TEI>