Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling
Journal of Systems Architecture: the EUROMICRO Journal
Rhythmic Tasks: A New Task Model with Continually Varying Periods for Cyber-Physical Systems
ICCPS '12 Proceedings of the 2012 IEEE/ACM Third International Conference on Cyber-Physical Systems
A semi-partitioned approach for parallel real-time scheduling
Proceedings of the 20th International Conference on Real-Time and Network Systems
A review of fixed priority and EDF scheduling for hard real-time uniprocessor systems
ACM SIGBED Review - Special Issue on the 3rd Embedded Operating System Workshop (EWiLi 2013)
Hi-index | 0.00 |
In this paper, we propose a new approach for the partitioned Earliest Deadline First (EDF) scheduling of sporadic task systems. We consider the case of constrained task deadlines where the deadlines of the tasks are less than or equal to their periods. We introduce the concept of the EDF norm, for defining the space of WCET values that result in schedulable systems given fixed periods and relative deadlines. Based on this concept, it is possible to derive a necessary and sufficient feasibility condition to check whether EDF scheduling is valid for a given partitioning. The EDF norm has interesting convexity properties that permit using a Linear Programming approach to reduce the number of points at which the EDF norm needs to be checked. From the EDF norm, we derive a new Worst Fit Decreasing partitioning heuristic and compare its performance with two existing partitioning heuristics based on density partitioning and demand bound function approximation. We then compare the performance of the heuristic in terms of the resource augmentation paradigm.