The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (2005 vol.16)
pp: 760-768
ABSTRACT
<p><b>Abstract</b>—A new schedulability test is derived for preemptive deadline scheduling of periodic or sporadic real-time tasks on a single-queue <it>m</it>-server system. The new test allows the task deadline to be more or less than the task period, and is based on a new analysis concept, called a <tmath>\mu{\hbox{-}}{\rm{busy}}</tmath> interval. This generalizes a result of Goossens et al. [11] that a system of periodic tasks with maximum individual task utilization <tmath>u_{max}</tmath> is EDF-schedulable on <tmath>m</tmath> processors if the total utilization does not exceed <tmath>m(1-u_{max})+u_{max}</tmath>. The new test allows the analysis of hybrid EDF-US [<tmath>x</tmath>] scheduling, and the conclusion that EDF-US[1/2] is optimal, with a guaranteed worst-case schedulable utilization of <tmath>(m+1)/2</tmath>.</p>
INDEX TERMS
Multiprocessor systems, real-time scheduling, deadline scheduling, earliest deadline first, utilization, feasibility, multiprocessor scheduling.
CITATION
Theodore P. Baker, "An Analysis of EDF Schedulability on a Multiprocessor", IEEE Transactions on Parallel & Distributed Systems, vol.16, no. 8, pp. 760-768, August 2005, doi:10.1109/TPDS.2005.88
47 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool