2026-07-22T10:24:40Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2538 2024-03-06T11:09:10Z ddc:004 open_access

Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor Scheduling Easwaran, Arvind Andersson, Björn Scheduling 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Arvind Easwaran and Björn Andersson 2010 Is Part Of Dagstuhl Seminar Proceedings, Volume 10071, Scheduling (2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.10071.11 urn:nbn:de:0030-drops-25385 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.10071.11 eng https://creativecommons.org/licenses/by/4.0/legalcode