论文标题
基于需求的混合批判性零星任务的调度
Demand-based Scheduling of Mixed-Criticality Sporadic Tasks on One Processor
论文作者
论文摘要
人为地收紧低批判性行为的高批判性任务截止日期的策略已成功地用于调度混合批判性系统。尽管已经为隐式截止日期任务系统开发了有效的调度算法，但是对于更一般的零星任务而言，情况并非如此。在本文中，我们针对这种一般的混合批判性任务系统开发了新的基于需求的计划测试，在该系统中，我们共同构成了任务的低临界需求。我们表明，新的测试严格占据了对此类系统的唯一其他基于需求的测试。我们还基于此测试提出了一种新的截止日期拧紧策略，并通过模拟表明该策略在各种零星的任务系统上大大优于所有已知的调度算法。
Strategies that artificially tighten high-criticality task deadlines in low-criticality behaviors have been successfully employed for scheduling mixed-criticality systems. Although efficient scheduling algorithms have been developed for implicit deadline task systems, the same is not true for more general sporadic tasks. In this paper we develop a new demand-based schedulability test for such general mixed-criticality task systems, in which we collectively bound the low- and high-criticality demand of tasks. We show that the new test strictly dominates the only other known demand-based test for such systems. We also propose a new deadline tightening strategy based on this test, and show through simulations that the strategy significantly outperforms all known scheduling algorithms for a variety of sporadic task systems.
