Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH scholarly article en Bini, Enrico; Marko, Bertogna; Baruah, Sanjoy K. License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-25423

; ;

The Parallel Supply Function Abstraction for a Virtual Multiprocessor



A new abstraction --- the Parallel Supply Function (PSF) --- is proposed for representing the computing capabilities offered by virtual platforms implemented atop identical multiprocessors. It is shown that this abstraction is strictly more powerful than previously-proposed ones, from the perspective of more accurately representing the inherent parallelism of the provided computing capabilities. Sufficient tests are derived for determining whether a given real-time task system, represented as a collection of sporadic tasks, is guaranteed to always meet all deadlines when scheduled upon a specified virtual platform using the global EDF scheduling algorithm.

BibTeX - Entry

  author =	{Enrico Bini and Bertogna Marko and Sanjoy K. Baruah},
  title =	{The Parallel Supply Function Abstraction for a Virtual Multiprocessor},
  booktitle =	{Scheduling},
  year =	{2010},
  editor =	{Susanne Albers and Sanjoy K. Baruah and Rolf H. M{\"o}hring and Kirk Pruhs},
  number =	{10071},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{},
  annote =	{Keywords: Virtual multiprocessor}

Keywords: Virtual multiprocessor
Seminar: 10071 - Scheduling
Related Scholarly Article:
Issue date: 2010
Date of publication: 2010

DROPS-Home | Fulltext Search | Imprint Published by LZI