Best-case Response Time Analysis of Preemptive Threshold Scheduled Tasks
Yang Yu-hai · Jisuanji yingyong yanjiu · 2004
Focused on preemptive threshold scheduling and presents a sufficient condition for the best-case response time of the tasks on the assumption that the offsets of the tasks are arbitrary. Then a formula for computing the best-case response 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 increase the maximum schedulability utilization.