2010/01/01 by Arvind Easwaran, Björn Andersson, Easwaran, Arvind +1
Computer Science · Engineering · #Distributed and Parallel Computing Systems #Real-Time Systems Scheduling #Scheduling #Scheduling and Optimization Algorithms
paper · doi:10.4230/dagsemproc.10071.11
openalex publication_date 2010/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 emphreasonable priority-assignments.