Schedulability Analysis of Multiprocessor Sporadic Task Systems
Schedulability Analysis of Multiprocessor Sporadic Task Systems
复制标题
多处理器零星任务系统的可调度性分析
DOI：
10.1201/9781420011746.ch3
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
T. Baker
中科院分区：
文献类型：
--
作者：
Sanjoy Baruah;T. Baker
在这一章中，我们考虑由几个相同的处理器组成的平台上的独立零星任务的系统，以满足硬截止日期的调度。虽然这个领域是非常新的，但最近已经获得了大量有趣和重要的结果。我们专注于在似乎是一个自然的分类方案（在第2.2节中描述）的背景下呈现结果。空间的考虑排除了提供这些结果的证明的可能性，相反，我们提供参考的主要来源在可能的情况下。本章的结构如下。在第2节中，我们正式定义了零星任务模型和其他重要的概念，并描述了分类计划的多处理器调度算法，我们已经通过。在第3-5节的每一节中，我们讨论有关一类调度算法的结果。第2-5节的重点主要是理论上的;在第6节中，我们简要讨论了这些结果的一些可能的扩展，这些扩展可能会增强它们的实际适用性。本材料基于部分由美国国家科学基金会资助的工作，资助号为0509131，以及陆军研究办公室的DURIP资助。
In this chapter we consider the scheduling of systems of independent sporadic tasks to meet hard deadlines upon platforms comprised of several identical processors. Although this field is very new, a large number of interesting and important results have recently been obtained. We focus on presenting the results within the context of what seems to be a natural classification scheme (described in Section 2.2). Space considerations rule out the possibility of providing proofs of these results; instead, we provide references to primary sources where possible. The organization of this chapter is as follows. In Section 2, we formally define the sporadic task model and other important concepts, and describe the classification scheme for multiprocessor scheduling algorithms that we have adopted. In each of Sections 3-5, we discuss results concerning one class of scheduling algorithms. The focus of Sections 2-5 is primarily theoretical; in Section 6, we briefly discuss some possible extensions to these results that may enhance their practical applicability. This material is based upon work supported in part by the National Science Foundation under Grant No. 0509131, and a DURIP grant from the Army Research Office.