Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling
Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling
复制标题
采用 EDF 调度的任意截止时间实时系统的敏感性分析
DOI：
10.1007/s11241-011-9124-y
复制
发表时间：
2011
影响因子：
1.3
通讯作者：
Sanjoy Baruah
中科院分区：
文献类型：
--
作者：
Fengxiang Zhang;A. Burns;Sanjoy Baruah
实时系统的正确性不仅取决于系统的输出，还取决于产生结果的时间。硬实时系统需要在所有的时间截止日期之前完成其操作。对于给定的任务集，了解可以对任务进行哪些更改以导致系统处于边界可验证状态是有用的。在工程环境中，知道将提供可并行系统的处理器的最小速度也是有益的。我们解决以下敏感性分析（参数计算）EDF调度系统上的单处理器：任务执行时间，处理器的速度，任务周期和任务的相对期限。我们证明了一个最佳的（最小或最大）系统参数可以确定由一个单一的运行的快速收敛处理器需求分析（QPA）算法。该算法为任意截止时间的实时系统提供了高效、准确的灵敏度分析。我们还通过使用不同的起始值的算法来改进这种灵敏度分析的实现。因此，为任务参数计算开发的方法与QPA一样有效，并且很容易并入系统设计支持工具。
The correctness of a real-time system depends on not only the system’s output but also on the time at which results are produced. A hard real-time system is required to complete its operations before all its timing deadlines. For a given task set it is useful to know what changes can be made to a task that will result in a system that is borderline schedulable. It is also beneficial in an engineering context to know the minimum speed of a processor that will deliver a schedulable system. We address the following sensitivity analysis (parameter computations) for EDF-scheduled systems on a uniprocessor: task execution times, speed of the processor, task periods and task relative deadlines. We prove that an optimal (minimum or maximum) system parameter can be determined by a single run of the Quick convergence Processor demand Analysis (QPA) algorithm. This algorithm provides efficient and exact sensitivity analysis for arbitrary deadline real-time systems. We also improve the implementation of this sensitivity analysis by using various starting values for the algorithms. The approaches developed for task parameter computations are therefore as efficient as QPA, and are easily incorporated into a system design support tool.