In safety-critical systems many software components of different criticalities or assurance levels need to interact in a timely manner to keep the system and environment safe. Nowadays, these systems are challenged by technological progress resulting in rapid increases in both software complexity and processing demands. Efficiently designing safety-critical systems subject to stringent timing requirements is therefore a challenge and a necessity. In this article, we consider the mixed-criticality execution model and homogeneous multi-core processors. We begin by defining a task model incorporating mixed-criticality, real-time and precedence constraints in the form of directed acyclic graphs. A meta-heuristic to solve the scheduling problem of this task model is then defined and proved to respect deadlines, even when the system needs to give more processing power to the most critical tasks. The state-of-the-art techniques capable of scheduling a similar task model have only been developed for dual-criticality systems. Conversely, the meta-heuristic we propose has been generalized to support an arbitrary number of criticality levels. We instantiated our meta-heuristic adopting scheduling algorithms such as G-EDF, G-LLF, or G-EDZL for each level of criticality. The experiments show excellent results in terms of acceptance ratio and number of preemptions.

中文翻译：

---

多核处理器上周期有向无环图的广义混合临界静态调度

在对安全至关重要的系统中，许多重要程度或保证水平不同的软件组件需要及时进行交互，以保持系统和环境的安全。如今，这些系统面临技术进步的挑战，导致软件复杂性和处理需求迅速增加。因此，有效设计对严格的时序要求有严格要求的安全关键系统是一项挑战和必要。在本文中，我们考虑了混合关键度执行模型和同类多核处理器。我们首先定义一个任务模型，该模型以有向无环图的形式结合了混合关键性，实时性和优先级约束。然后定义了一种元启发式方法来解决此任务模型的调度问题，并证明该方法遵循期限，即使系统需要为最关键的任务提供更多处理能力。能够调度相似任务模型的最新技术仅针对双临界系统而开发。相反，我们提出的元启发式方法已被概括为支持任意数量的临界级别。我们针对每个关键级别实例化了元启发式采用的调度算法，例如G-EDF，G-LLF或G-EDZL。实验显示出在接受率和抢占次数方面的优异结果。我们针对每个关键级别实例化了元启发式采用的调度算法，例如G-EDF，G-LLF或G-EDZL。实验显示出在接受率和抢占次数方面的优异结果。我们针对每个关键级别实例化了元启发式采用调度算法，例如G-EDF，G-LLF或G-EDZL。实验显示出在接受率和抢占次数方面的优异结果。