Mixed-Criticality Scheduling upon Varying-Speed Multiprocessors
Mixed-Criticality Scheduling upon Varying-Speed Multiprocessors
复制标题
变速多处理器上的混合关键调度
DOI：
10.1109/dasc.2014.50
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
Sanjoy Baruah
中科院分区：
文献类型：
--
作者：
Zhishan Guo;Sanjoy Baruah
嵌入式计算的一个日益增长的趋势是向混合临界性（MC）系统发展，在这种系统中，不同重要程度（临界性）的功能在一个共同的平台上实现。以前关于MC调度的大部分工作都集中在不同的时序分析工具可能导致对每个“作业”（代码段）进行多个WCET估计的方面。最近，针对具有不同执行速度的系统提出了一种不同的MC模型。假设在运行期间实现系统的处理器的精确速度以一种先验的未知方式变化，并且必须估计实际速度可能下降到多低。先前的工作已经处理了这种单处理器平台，本文报道的研究试图将先前的工作推广到适用于多核平台。在该方法中，基于必要和充分调度条件构造线性规划，并根据其解，以基于处理器共享的方式执行作业。证明了该算法的最优性，并通过实例说明了处理器共享的必要性。
An increasing trend in embedded computing is the moving towards mixed-criticality (MC) systems, in which functionalities of different importance degrees (criticalities) are implemented upon a common platform. Most previous work on MC scheduling focuses on the aspect that different timing analysis tools may result in multiple WCET estimations for each "job" (piece of code). Recently, a different MC model has been proposed, targeting systems with varying execution speeds. It is assumed that the precise speed of the processor upon which the system is implemented varies in an a priori unknown manner during runtime, and estimates must be made as to how low the actual speed may fall. Prior work has dealt with uniprocessor platforms of this kind, the research reported in this paper seeks to generalize this prior work to be applicable to multicore platforms. In our method, a linear program (LP) is constructed based on necessary and sufficient scheduling conditions, and according to its solution, jobs are executed in a processor-sharing based method. Optimality of the algorithm is proved, and an example is constructed to show the necessity of processor sharing.