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.
@InProceedings{bini_et_al:DagSemProc.10071.14, author = {Bini, Enrico and Marko, Bertogna and Baruah, Sanjoy K.}, title = {{The Parallel Supply Function Abstraction for a Virtual Multiprocessor}}, booktitle = {Scheduling}, pages = {1--14}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {10071}, editor = {Susanne Albers and Sanjoy K. Baruah and Rolf H. M\"{o}hring and Kirk Pruhs}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10071.14}, URN = {urn:nbn:de:0030-drops-25423}, doi = {10.4230/DagSemProc.10071.14}, annote = {Keywords: Virtual multiprocessor} }
Feedback for Dagstuhl Publishing