The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—Real-time scheduling theory offers constant-time schedulability tests for periodic and sporadic tasks based on utilization bounds. Unfortunately, the periodicity or the minimal interarrival-time assumptions underlying these bounds make them inapplicable to a vast range of aperiodic workloads such as those seen by network routers, Web servers, and event-driven systems. This paper makes several important contributions toward real-time scheduling theory and schedulability analysis. We derive the first known bound for schedulability of <it>aperiodic tasks</it>. The bound is based on a utilization-like metric we call synthetic utilization, which allows implementing constant-time schedulability tests at admission control time. We prove that the synthetic utilization bound for deadline-monotonic scheduling of aperiodic tasks is <tmath>{\frac 1 {1 + \sqrt {1/2}}}</tmath>. We also show that no other time-independent scheduling policy can have a higher schedulability bound. Similarly, we show that EDF has a bound of <tmath>1</tmath> and that no dynamic-priority policy has a higher bound. We assess the performance of the derived bound and conclude that it is very efficient in hit-ratio maximization.</p>
Real-time scheduling, schedulability analysis, utilization bounds, aperiodic tasks.
Tarek F. Abdelzaher, Vivek Sharma, Chenyang Lu, "A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling", IEEE Transactions on Computers, vol. 53, no. , pp. 334-350, March 2004, doi:10.1109/TC.2004.1261839
83 ms
(Ver 3.3 (11022016))