<?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-07-23T18:08:58Z</responseDate>
  <request identifier="2542" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2542</identifier>
        <datestamp>2024-03-06T11:09:11Z</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>The Parallel Supply Function Abstraction for a Virtual Multiprocessor</dc:title>
          <dc:creator>Bini, Enrico</dc:creator>
          <dc:creator>Marko, Bertogna</dc:creator>
          <dc:creator>Baruah, Sanjoy K.</dc:creator>
          <dc:subject>Virtual multiprocessor</dc:subject>
          <dc:description>A new abstraction --- the Parallel Supply Function (PSF) --- is&#13;
  proposed for representing the computing capabilities offered by&#13;
  virtual platforms implemented atop identical multiprocessors.  It is&#13;
  shown that this abstraction is strictly more powerful than&#13;
  previously-proposed ones, from the perspective of more accurately&#13;
  representing the inherent parallelism of the provided computing&#13;
  capabilities.  Sufficient tests are derived for determining whether&#13;
  a given real-time task system, represented as a collection of&#13;
  sporadic tasks, is guaranteed &#13;
  to always meet all&#13;
  deadlines when scheduled upon a specified virtual platform using the&#13;
  global EDF scheduling algorithm.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Enrico Bini and Bertogna Marko and Sanjoy K. Baruah</dc:contributor>
          <dc:date>2010</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 10071, Scheduling (2010)</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/DagSemProc.10071.14</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-25423</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10071.14</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
