The Global Feasibility and Schedulability of General Task Models on Multiprocessor Platforms
The Global Feasibility and Schedulability of General Task Models on Multiprocessor Platforms
复制标题
多处理器平台上通用任务模型的全局可行性和可调度性
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
Sanjoy Baruah
中科院分区：
文献类型：
--
作者：
N. Fisher;Sanjoy Baruah
可行性分析确定（在系统执行时间之前）在处理平台上执行的硬实时作业的指定集合是否可以满足所有截止日期。在本文中，我们得到近最佳的充分的测试，以确定是否一个给定的集合的工作可以切实满足所有的期限在一个指定的多处理器平台上假设作业迁移是允许的。这些测试足够通用，即使在作业集合未完全指定时也可以应用。我们讨论了这些测试的适用性，经常性的实时任务的系统所产生的作业集合的调度。我们还表明，我们的可行性条件可用于获得全球EDF可兼容性条件。
Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-real-time jobs executed on a processing platform can meet all deadlines. In this paper, we derive near-optimal sufficient tests for determining whether a given collection of jobs can feasibly meet all deadlines upon a specified multiprocessor platform assuming job migration is permitted. These tests are general enough to be applied even when the collection of jobs is incompletely specified. We discuss the applicability of these tests to the scheduling of collections of jobs that are generated by systems of recurrent real-time tasks. We also show that our feasibility conditions may be used to obtain global-EDF schedulability conditions.