<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-08-17T16:20:41Z</responseDate>
  <request identifier="4447" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:4447</identifier>
        <datestamp>2024-03-06T10:35:02Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules</dc:title>
          <dc:creator>Antoniadis, Antonios</dc:creator>
          <dc:creator>Barcelo, Neal</dc:creator>
          <dc:creator>Consuegra, Mario</dc:creator>
          <dc:creator>Kling, Peter</dc:creator>
          <dc:creator>Nugent, Michael</dc:creator>
          <dc:creator>Pruhs, Kirk</dc:creator>
          <dc:creator>Scquizzato, Michele</dc:creator>
          <dc:subject>scheduling</dc:subject>
          <dc:subject>flow time</dc:subject>
          <dc:subject>energy efficiency</dc:subject>
          <dc:subject>speed scaling</dc:subject>
          <dc:subject>primal-dual</dc:subject>
          <dc:description>We give a polynomial time algorithm to compute an optimal energy and fractional weighted flow trade-off schedule for a speed-scalable processor with discrete speeds. Our algorithm uses a geometric approach that is based on structural properties obtained from a primal-dual formulation of the problem.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Antonios Antoniadis and Neal Barcelo and Mario Consuegra and Peter Kling and Michael Nugent and Kirk Pruhs and Michele Scquizzato</dc:contributor>
          <dc:date>2014</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 25, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.STACS.2014.63</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-44474</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2014.63</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
