Modern real-time systems tend to be mixed-critical, in the sense that they integrate on the same computational platform applications at different levels of criticality (e.g., safety critical and mission critical). Scheduling of such systems is a popular topic in literature due to the complexity and importance of the problem. In this paper we propose two algorithms for job scheduling in mixed critical systems: mixed criticality earliest deadline first (MCEDF) and mixed critical priority improvement (MCPI). MCEDF is a single processor algorithm that theoretically dominates state-of-the-art fixed-priority algorithm own criticality based priority (OCBP), while having a better computational complexity. The dominance is achieved by profiting from a common extension of fixed-priority online policy to mixed criticality. MCPI is a multiprocessor algorithm that supports dependency constraints. Experiments show good schedulability results. Also we formally prove that both MCEDF and MCPI are optimal in a particular class of algorithms.

中文翻译：

---

混合关键作业的基于优先级的调度

现代实时系统往往是混合关键的，因为它们集成在不同关键级别（例如，安全关键和任务关键）的同一计算平台应用程序上。由于问题的复杂性和重要性，此类系统的调度是文献中的热门话题。在本文中，我们提出了两种混合关键系统作业调度算法：混合关键性最早截止日期优先（MCEDF）和混合关键优先级改进（MCPI）。MCEDF 是一种单处理器算法，理论上主导了最先进的固定优先级算法自身的基于关键性的优先级 (OCBP)，同时具有更好的计算复杂度。优势是通过从固定优先级在线策略到混合关键性的共同扩展中获利来实现的。MCPI 是一种支持依赖约束的多处理器算法。实验显示了良好的可调度性结果。我们还正式证明了 MCEDF 和 MCPI 在特定类别的算法中都是最优的。