arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0912.3852cs.PFcs.DMcs.OS
收藏

某些实时的调度问题的尖锐利用率阈值

Sharp utilization thresholds for some real-time scheduling problems

Sathish Gopalakrishnan

摘要:

实时的【形】系统的调度策略表现出阈值行为,这与它们调度的任务集的利用率有关,并且在某些情况下,这个阈值是尖锐的。对于速率单调调度策略,我们表明,利用率小于阈值$U_{RM}^{*}$的周期性工作负载几乎肯定可以调度,并且利用率大于$U_{RM}^{*}$的所有工作负载几乎肯定不能调度。我们研究这种尖锐的阈值行为的处理器调度的背景下,使用静态任务优先级,不仅为周期性的实时的【形】任务,但为非周期性的实时的【形】任务以及。利用率阈值的概念为大多数实时的【形】应用程序提供了一个简单的可扩展性测试。这些结果提高了我们对调度策略的理解,并提供了一个有趣的表征的典型行为的政策。对于大多数策略,阈值是尖锐的(阈值附近的小偏差会导致可验证性作为一种属性出现或消失);这是一个令人高兴的结果,可以用来解决现有基于利用率的可验证性测试的局限性。我们演示了使用这样的方法来平衡功耗,需要满足Web服务器的最后期限。

英文摘要:

Scheduling policies for real-time systems exhibit threshold behavior that is related to the utilization of the task set they schedule, and in some cases this threshold is sharp. For the rate monotonic scheduling policy, we show that periodic workload with utilization less than a threshold $U_{RM}^{*}$ can be scheduled almost surely and that all workload with utilization greater than $U_{RM}^{*}$ is almost surely not schedulable. We study such sharp threshold behavior in the context of processor scheduling using static task priorities, not only for periodic real-time tasks but for aperiodic real-time tasks as well. The notion of a utilization threshold provides a simple schedulability test for most real-time applications. These results improve our understanding of scheduling policies and provide an interesting characterization of the typical behavior of policies. The threshold is sharp (small deviations around the threshold cause schedulability, as a property, to appear or disappear) for most policies; this is a happy consequence that can be used to address the limitations of existing utilization-based tests for schedulability. We demonstrate the use of such an approach for balancing power consumption with the need to meet deadlines in web servers.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑