Exact speedup factors and sub-optimality for non-preemptive scheduling
Exact speedup factors and sub-optimality for non-preemptive scheduling
复制标题
非抢占式调度的精确加速因子和次优性
作者:
Robert I. Davis;Abhilash Thekkilakattil;Oliver Gettings;R. Dobrin;S. Punnekkat;Jian
Fixed priority scheduling is used in many real-time systems; however, both preemptive and non-preemptive variants (FP-P and FP-NP) are known to be sub-optimal when compared to an optimal uniprocessor scheduling algorithm such as preemptive earliest deadline first (EDF-P). In this paper, we investigate the sub-optimality of fixed priority non-preemptive scheduling. Specifically, we derive the exact processor speed-up factor required to guarantee the feasibility under FP-NP (i.e. schedulability assuming an optimal priority assignment) of any task set that is feasible under EDF-P. As a consequence of this work, we also derive a lower bound on the sub-optimality of non-preemptive EDF (EDF-NP). As this lower bound matches a recently published upper bound for the same quantity, it closes the exact sub-optimality for EDF-NP. It is known that neither preemptive, nor non-preemptive fixed priority scheduling dominates the other, in other words, there are task sets that are feasible on a processor of unit speed under FP-P that are not feasible under FP-NP and vice-versa. Hence comparing these two algorithms, there are non-trivial speedup factors in both directions. We derive the exact speed-up factor required to guarantee the FP-NP feasibility of any FP-P feasible task set. Further, we derive the exact speed-up factor required to guarantee FP-P feasibility of any constrained-deadline FP-NP feasible task set.
影响因子:
1.3
作者:
S. Altmeyer;Robert I. Davis;Claire Maiza
通讯作者:
S. Altmeyer;Robert I. Davis;Claire Maiza
影响因子:
1.3
作者:
Davis R
通讯作者:
Davis R