Combining EDF and FP Scheduling: Analysis and Implementation in Ada 2005
Ada-Europe '09 Proceedings of the 14th Ada-Europe International Conference on Reliable Software Technologies
Hi-index | 0.00 |
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 resource sharing sporadic task systems using this hybrid scheduling algorithm, with access to shared resources arbitrated using the Stack Resource Policy (SRP).