Schedulability Analysis for Real-Time Systems with EDF Scheduling

• Published in: IEEE transactions on computers Vol. 58; no. 9; pp. 1250 - 1258
• Main Authors: Fengxiang Zhang, Burns, A.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.09.2009; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithm design and analysis; Algorithms; Data mining; Deadlines; Job shop scheduling; Marketing; Mathematical analysis; Microprocessors; Multiprocessing/multiprogramming/multitasking; Optimal scheduling; Optimization; Processor scheduling; Real time; Real time systems; real-time and embedded systems; Scheduling; Studies; Tasks; Upper bound
• ISSN: 0018-9340; 1557-9956
• DOI: 10.1109/TC.2009.58

Real-time scheduling is the theoretical basis of real-time systems engineering. Earliest deadline first (EDF) is an optimal scheduling algorithm for uniprocessor real-time systems. Existing results on an exact schedulability test for EDF task systems with arbitrary relative deadlines need to calculate the processor demand of the task set at every absolute deadline to check if there is an overflow in a specified time interval. The resulting large number of calculations severely restricts the use of EDF in practice. In this paper, we propose new results on necessary and sufficient schedulability analysis for EDF scheduling; the new results reduce, exponentially, the calculation times, in all situations, for schedulable task sets, and in most situations, for unschedulable task sets. For example, a 16-task system that in the previous analysis had to check 858,331 points (deadlines) can, with the new analysis, be checked at just 12 points. There are no restrictions on the new results: each task can be periodic or sporadic, with relative deadline, which can be less than, equal to, or greater than its period, and task parameters can range over many orders of magnitude.