Abstract | ||
---|---|---|
A new schedulability test is derived for preemptive deadline scheduling of periodic or sporadic real-time tasks on a single-queue m-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 \mu{\hbox{-}}{\rm{busy}} interval. This generalizes a result of Goossens et al. [11] that a system of periodic tasks with maximum individual task utilization u_{max} is EDF-schedulable on m processors if the total utilization does not exceed m(1-u_{max})+u_{max}. The new test allows the analysis of hybrid EDF-US [x] scheduling, and the conclusion that EDF-US[1/2] is optimal, with a guaranteed worst-case schedulable utilization of (m+1)/2. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1109/TPDS.2005.88 | IEEE Trans. Parallel Distrib. Syst. |
Keywords | DocType | Volume |
multiprocessing systems,processor scheduling,real-time systems,multiprocessor scheduling,multiprocessor system,preemptive deadline scheduling,real-time scheduling,single-queue m-server system,Multiprocessor systems,deadline scheduling,earliest deadline first,feasibility,multiprocessor scheduling.,real-time scheduling,utilization | Journal | 16 |
Issue | ISSN | Citations |
8 | 1045-9219 | 71 |
PageRank | References | Authors |
4.12 | 15 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
T. P. Baker | 1 | 1648 | 171.36 |