A Norm Approach for the Partitioned EDF Scheduling of Sporadic Task Systems

Abstract

International audienceIn 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