<?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-01113808</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-11T19:37:04+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Throughput maximization in multiprocessor speed-scaling</title>
            <author role="aut">
              <persName>
                <forename type="first">Eric</forename>
                <surname>Angel</surname>
              </persName>
              <email type="md5">244a11344ef759a87e9672a7ea4e54e2</email>
              <email type="domain">ibisc.univ-evry.fr</email>
              <idno type="idhal" notation="numeric">855946</idno>
              <idno type="halauthorid" notation="string">366083-855946</idno>
              <idno type="IDREF">https://www.idref.fr/154829870</idno>
              <idno type="VIAF">https://viaf.org/viaf/295140318</idno>
              <idno type="ISNI">http://isni.org/isni/0000000399729960</idno>
              <affiliation ref="#struct-143247"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Evripidis</forename>
                <surname>Bampis</surname>
              </persName>
              <email type="md5">86302bba886873f656fe083cf63d42ea</email>
              <email type="domain">ibisc.univ-evry.fr</email>
              <idno type="idhal" notation="numeric">1284586</idno>
              <idno type="halauthorid" notation="string">145111-1284586</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-4498-3040</idno>
              <idno type="IDREF">https://www.idref.fr/095348743</idno>
              <idno type="VIAF">https://viaf.org/viaf/23268861</idno>
              <idno type="ISNI">http://isni.org/isni/0000000043124960</idno>
              <affiliation ref="#struct-406454"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Vincent</forename>
                <surname>Chau</surname>
              </persName>
              <email type="md5">ec1ced85065ee76dbde0bd5820b93d93</email>
              <email type="domain">univ-evry.fr</email>
              <idno type="idhal" notation="string">vincent-chau</idno>
              <idno type="idhal" notation="numeric">1625286</idno>
              <idno type="halauthorid" notation="string">666393-1625286</idno>
              <affiliation ref="#struct-143247"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Kim Thang</forename>
                <surname>Nguyen</surname>
              </persName>
              <email type="md5">a9b80e201669da0fcaedf2d8f3b3ea39</email>
              <email type="domain">ibisc.univ-evry.fr</email>
              <idno type="idhal" notation="string">nguyen-kim-thang</idno>
              <idno type="idhal" notation="numeric">1229140</idno>
              <idno type="halauthorid" notation="string">715841-1229140</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-6085-9453</idno>
              <idno type="IDREF">https://www.idref.fr/135943965</idno>
              <idno type="VIAF">https://viaf.org/viaf/191916480</idno>
              <affiliation ref="#struct-143247"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Frédéric</forename>
                <surname>Davesne</surname>
              </persName>
              <email type="md5">fbe1d4bbaa9c5be84347d1c31a63a07a</email>
              <email type="domain">univ-evry.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2015-06-19 11:17:13</date>
              <date type="whenModified">2025-12-18 03:23:26</date>
              <date type="whenReleased">2015-06-19 11:42:53</date>
              <date type="whenProduced">2014-12-15</date>
              <date type="whenEndEmbargoed">2015-06-19</date>
              <ref type="file" target="https://hal.science/hal-01113808v1/document">
                <date notBefore="2015-06-19"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01113808v1/file/multi_proc_throughput.pdf" id="file-1165490-1250771">
                <date notBefore="2015-06-19"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1402.3782"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="127748">
                <persName>
                  <forename>Frédéric</forename>
                  <surname>Davesne</surname>
                </persName>
                <email type="md5">fbe1d4bbaa9c5be84347d1c31a63a07a</email>
                <email type="domain">univ-evry.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01113808</idno>
            <idno type="halUri">https://hal.science/hal-01113808</idno>
            <idno type="halBibtex">angel:hal-01113808</idno>
            <idno type="halRefHtml">&lt;i&gt;ISAAC 2014 - 25th International Symposium on Algorithms and Computation&lt;/i&gt;, Dec 2014, Jeonju, South Korea. pp.247--258, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-319-13075-0_20"&gt;&amp;#x27E8;10.1007/978-3-319-13075-0_20&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">ISAAC 2014 - 25th International Symposium on Algorithms and Computation, Dec 2014, Jeonju, South Korea. pp.247--258, &amp;#x27E8;10.1007/978-3-319-13075-0_20&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1165490-1250771"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UPMC" corresp="SORBONNE-UNIVERSITE">Université Pierre et Marie Curie</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-EVRY">Université d'Evry-Val d'Essonne</idno>
            <idno type="stamp" n="IBISC" corresp="UNIV-EVRY">Informatique, Biologie Intégrative et Systèmes Complexes</idno>
            <idno type="stamp" n="IBISC-AROBAS" corresp="IBISC">Algorithmique, Recherche Opérationnelle, Bioinformatique et Apprentissage Statistique</idno>
            <idno type="stamp" n="LIP6" corresp="SORBONNE-UNIVERSITE">Laboratoire d'Informatique de Paris 6</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="UPMC_POLE_1" corresp="UPMC">UPMC Pôle 1</idno>
            <idno type="stamp" n="SORBONNE-UNIVERSITE">Sorbonne Université</idno>
            <idno type="stamp" n="SU-SCIENCES" corresp="SORBONNE-UNIVERSITE">Faculté des Sciences de Sorbonne Université</idno>
            <idno type="stamp" n="SU-TI">Sorbonne Université - Texte Intégral</idno>
            <idno type="stamp" n="ALLIANCE-SU"> Alliance Sorbonne Université</idno>
            <idno type="stamp" n="DDRS-TEST-CJ">Test de la collection DD-RS</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Throughput maximization in multiprocessor speed-scaling</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Eric</forename>
                    <surname>Angel</surname>
                  </persName>
                  <email type="md5">244a11344ef759a87e9672a7ea4e54e2</email>
                  <email type="domain">ibisc.univ-evry.fr</email>
                  <idno type="idhal" notation="numeric">855946</idno>
                  <idno type="halauthorid" notation="string">366083-855946</idno>
                  <idno type="IDREF">https://www.idref.fr/154829870</idno>
                  <idno type="VIAF">https://viaf.org/viaf/295140318</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000399729960</idno>
                  <affiliation ref="#struct-143247"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Evripidis</forename>
                    <surname>Bampis</surname>
                  </persName>
                  <email type="md5">86302bba886873f656fe083cf63d42ea</email>
                  <email type="domain">ibisc.univ-evry.fr</email>
                  <idno type="idhal" notation="numeric">1284586</idno>
                  <idno type="halauthorid" notation="string">145111-1284586</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-4498-3040</idno>
                  <idno type="IDREF">https://www.idref.fr/095348743</idno>
                  <idno type="VIAF">https://viaf.org/viaf/23268861</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000043124960</idno>
                  <affiliation ref="#struct-406454"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Vincent</forename>
                    <surname>Chau</surname>
                  </persName>
                  <email type="md5">ec1ced85065ee76dbde0bd5820b93d93</email>
                  <email type="domain">univ-evry.fr</email>
                  <idno type="idhal" notation="string">vincent-chau</idno>
                  <idno type="idhal" notation="numeric">1625286</idno>
                  <idno type="halauthorid" notation="string">666393-1625286</idno>
                  <affiliation ref="#struct-143247"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Kim Thang</forename>
                    <surname>Nguyen</surname>
                  </persName>
                  <email type="md5">a9b80e201669da0fcaedf2d8f3b3ea39</email>
                  <email type="domain">ibisc.univ-evry.fr</email>
                  <idno type="idhal" notation="string">nguyen-kim-thang</idno>
                  <idno type="idhal" notation="numeric">1229140</idno>
                  <idno type="halauthorid" notation="string">715841-1229140</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-6085-9453</idno>
                  <idno type="IDREF">https://www.idref.fr/135943965</idno>
                  <idno type="VIAF">https://viaf.org/viaf/191916480</idno>
                  <affiliation ref="#struct-143247"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Proc. of the 25th International Symposium on Algorithms and Computation (ISAAC 2014)</title>
                <meeting>
                  <title>ISAAC 2014 - 25th International Symposium on Algorithms and Computation</title>
                  <date type="start">2014-12-15</date>
                  <date type="end">2014-12-17</date>
                  <settlement>Jeonju</settlement>
                  <country key="KR">South Korea</country>
                </meeting>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">Lecture Notes in Computer Science</biblScope>
                  <biblScope unit="volume">8889</biblScope>
                  <biblScope unit="pp">247--258</biblScope>
                  <date type="datePub">2014-12-15</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-319-13075-0_20</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-ro">Computer Science [cs]/Operations Research [math.OC]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In the classical energy minimization problem, introduced in [Yao et al., FOCS’95], we are given a set of n jobs each one characterized by its release date, its deadline, its processing volume and we aim to find a feasible schedule of the jobs on a single speed-scalable machine so that the total energy consumption is minimized. Here, we study the throughput maximization version of the problem where we are given a budget of energy E and where every job has also a value. Our goal is to determine a feasible schedule maximizing the (weighted) throughput of the jobs that are executed between their respective release dates and deadlines. We first consider the preemptive non-migratory multiprocessor case in a fully heterogeneous environment in which every job has a machine-dependent release date, deadline and processing volume and every machine obeys to a different speed-to-power function. We present a polynomial time greedy algorithm based on the primal-dual scheme that approximates the optimum solution within a factor depending on the energy functions (the factor is constant for typical energy functions of form P(z) = zα). Then, we focus on the non-preemptive case for which we consider a fixed number of identical parallel machines and two important families of instances: (1) equal processing volume jobs; and (2) agreeable jobs. For both cases we present optimal pseudo-polynomial-time algorithms.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-143247" status="OLD">
          <idno type="IdRef">201055902</idno>
          <idno type="RNSR">201019077X</idno>
          <orgName>Informatique, Biologie Intégrative et Systèmes Complexes</orgName>
          <orgName type="acronym">IBISC</orgName>
          <date type="start">2010-01-01</date>
          <date type="end">2019-01-31</date>
          <desc>
            <address>
              <addrLine>40 rue du Pelvoux, Courcouronnes ; 91020 Evry Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ibisc.univ-evry.fr/</ref>
          </desc>
          <listRelation>
            <relation name="EA 4526" active="#struct-300306" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-406454" status="OLD">
          <orgName>Recherche Opérationnelle</orgName>
          <orgName type="acronym">RO</orgName>
          <date type="start">2004-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-233" type="direct"/>
            <relation active="#struct-93591" type="indirect"/>
            <relation name="UMR7606" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300306" status="VALID">
          <idno type="IdRef">030820529</idno>
          <idno type="ISNI">0000000121805818</idno>
          <idno type="ROR">https://ror.org/00e96v939</idno>
          <idno type="Wikidata">Q1531014</idno>
          <orgName>Université d'Évry-Val-d'Essonne</orgName>
          <orgName type="acronym">UEVE</orgName>
          <date type="start">1991-07-22</date>
          <desc>
            <address>
              <addrLine>Boulevard François Mitterrand 91025 Evry Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-evry.fr</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-233" status="OLD">
          <idno type="RNSR">199712651U</idno>
          <idno type="ROR">https://ror.org/05krcen59</idno>
          <orgName>Laboratoire d'Informatique de Paris 6</orgName>
          <orgName type="acronym">LIP6</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 Place JUSSIEU 75252 PARIS CEDEX 05</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lip6.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-93591" type="direct"/>
            <relation name="UMR7606" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-93591" status="OLD">
          <idno type="ROR">https://ror.org/02en5vm52</idno>
          <orgName>Université Pierre et Marie Curie - Paris 6</orgName>
          <orgName type="acronym">UPMC</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>4 place Jussieu - 75005 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.upmc.fr/</ref>
          </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>
      </listOrg>
    </back>
  </text>
</TEI>