Hybrid-priority Scheduling of Resource-Sharing Sporadic Task Systems

A hybrid scheduling algorithm is proposed, which integrates features of the Fixed Priority (FP) and Earliest Deadline First (EDF) scheduling policies. It is shown that this hybrid scheduling algorithm is a generalization of both FP and EDF, and tends to retain most of the desirable properties and features of both individual policies. An exact (i.e., necessary and sufficient) test is derived for the preemptive uniprocessor scheduling of resourcesharing sporadic task systems using this hybrid scheduling algorithm, with access to shared resources arbitrated using the Stack Resource Policy (SRP).

• Type: Conference
• Year: 2008
• Where: RTAS
• Authors: Sanjoy K. Baruah, Nathan Fisher
• Keywords: Hybrid Scheduling Algorithm, Preemptive Uniprocessor Scheduling, Real-Time Technology, RTAS 2008, Scheduling Policies