License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-25385
URL: http://drops.dagstuhl.de/opus/volltexte/2010/2538/
Go to the corresponding Portal


Easwaran, Arvind ; Andersson, Björn

Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor Scheduling

pdf-format:
Document 1.pdf (1,078 KB)


Abstract

In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner. We develop a novel resource-sharing protocol and a corresponding schedulability test for this system. We also develop the first schedulability analysis of priority inheritence protocol for the aforementioned system. Finally, we show that these protocols are efficient (based on the developed schedulability tests) for a class of priority-assignments called emph{reasonable} priority-assignments.

BibTeX - Entry

@InProceedings{easwaran_et_al:DSP:2010:2538,
  author =	{Arvind Easwaran and Bj{\"o}rn Andersson},
  title =	{Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor Scheduling},
  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 =		{http://drops.dagstuhl.de/opus/volltexte/2010/2538},
  annote =	{Keywords: Scheduling}
}

Keywords: Scheduling
Seminar: 10071 - Scheduling
Issue Date: 2010
Date of publication: 03.05.2010


DROPS-Home | Fulltext Search | Imprint Published by LZI