Scheduling Real-Time Mixed-Criticality Jobs
Scheduling Real-Time Mixed-Criticality Jobs
复制标题
DOI：
10.1109/tc.2011.142
复制
发表时间：
2012-08-01
影响因子：
3.7
通讯作者：
Stougie, Leen
中科院分区：
文献类型：
--
作者：
Baruah, Sanjoy;Bonifaci, Vincenzo;Stougie, Leen
许多安全关键型嵌入式系统需要满足认证要求；某些系统可能需要满足来自不同认证机构的多组认证要求。这种“混合临界”系统中的认证要求产生了有趣的调度问题，这些问题不能用传统调度理论中的技术来令人满意地解决。在这篇文章中，我们研究了一种表示这种混合临界工作负载的形式化模型。我们首先论证了确定该模型中指定的系统是否可以被安排满足其所有认证要求的困难，即使对于仅受两套认证要求的系统也是如此。然后，通过处理器加速比的度量，量化了基于预约的调度和基于优先级的调度这两种技术在调度这类混合临界系统中的有效性，表明基于预约的调度和基于优先级的调度优于前者。我们还表明，对于这两种技术，我们所获得的加速比因子是紧凑的。
Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different certification authorities. Certification requirements in such "mixed-criticality" systems give rise to interesting scheduling problems, that cannot be satisfactorily addressed using techniques from conventional scheduling theory. In this paper, we study a formal model for representing such mixed-criticality workloads. We demonstrate first the intractability of determining whether a system specified in this model can be scheduled to meet all its certification requirements, even for systems subject to merely two sets of certification requirements. Then we quantify, via the metric of processor speedup factor, the effectiveness of two techniques, reservation-based scheduling and priority-based scheduling, that are widely used in scheduling such mixed-criticality systems, showing that the latter of the two is superior to the former. We also show that the speedup factors we obtain are tight for these two techniques.