Resource sharing in global fixed-priority preemptive multiprocessor scheduling

Easwaran, Arvind; Andersson, Björn

http://hdl.handle.net/10400.22/3838

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
ART_ArvindEaswaran_2009_CISTER.pdf		3.05 MB	Adobe PDF	Download

Send Feedback

Authors

Easwaran, Arvind

Andersson, Björn

Abstract(s)

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.