Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor Scheduling
Ref: HURRAY-TR-090908 Publication Date: 1 to 4, Dec, 2009
Resource Sharing in Global Fixed-Priority Preemptive Multiprocessor Scheduling
Ref: HURRAY-TR-090908 Publication Date: 1 to 4, Dec, 2009Abstract:
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 inheritance 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 reasonable priority-assignments.
Arvind Easwaran
Björn AnderssonDocument:
View
Download30th IEEE Real-Time Systems Symposium (RTSS 2009), IEEE, pp 377-386.
Washington, U.S.A..
DOI:10.1109/RTSS.2009.37.
WOS ID: 000277465500035.
Record Date: 4, Dec, 2009
Short links for this page: www.cister.isep.pt/docs/10_1109_rtss_2009_37 www.cister.isep.pt/docs/000277465500035 www.cister.isep.pt/docs/hurray_tr_090908 www.cister.isep.pt/docs/510