The Best-Case Response Time Analysis of EDF Preemptive Scheduled Tasks
Bin Xue · 2004
The paper presents a sufficient condition for the best-case response time of EDF preemptive scheduling tasks on the assumption that the offsets of the tasks are arbitrary. Then a formula for computing the best-case re sponse time is shown in the paper. The most important application of the solution is in the analysis of response jitter of the distributed real-time tasks. This reduction jitter implies reduced worst-case bounds for the response time, and thus allows us to determine whether a task is schedulable correctly.