DagSemProc.10071.11.pdf
- Filesize: 1.05 MB
- 10 pages
Document
Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor Scheduling
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 10071
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2010-05-03
Cite AsGet BibTex
Arvind Easwaran and Björn Andersson. Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor Scheduling. In Scheduling. Dagstuhl Seminar Proceedings, Volume 10071, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/DagSemProc.10071.11
https://doi.org/10.4230/DagSemProc.10071.11
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.
Keywords
- Scheduling
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads