License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.10071.11
URN: urn:nbn:de:0030-drops-25385
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2538/
Go to the corresponding Portal

Easwaran, Arvind ; Andersson, Björn

Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor Scheduling

pdf-format:
10071.EaswaranArvind.Paper.2538.pdf (1 MB)

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:DagSemProc.10071.11,
  author =	{Easwaran, Arvind and Andersson, Bj\"{o}rn},
  title =	{{Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor Scheduling}},
  booktitle =	{Scheduling},
  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/opus/volltexte/2010/2538},
  URN =		{urn:nbn:de:0030-drops-25385},
  doi =		{10.4230/DagSemProc.10071.11},
  annote =	{Keywords: Scheduling}
}

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

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI