The mixed-criticality system provides multiple real-time applications with different criticalities in a single system. Poor energy-saving performance of the previous studies on mixed-criticality sporadic tasks are mainly due to the fact that the slack time generated from the random arrival of sporadic tasks is not taken into account. In this article, we focus on scheduling energy aware mixed-criticality sporadic tasks and take the random arrival of sporadic tasks into account. We proposed a dynamically frequency updating mixed-criticality algorithm (DFU). DFU based on the earliest deadline first scheme can exploit the slack time generated from high criticality tasks in a low criticality mode to reduce processor frequency. In addition, it also can dynamically update the utilization of sporadic tasks set to further reduce processor frequency. The simulation experiments are conducted to evaluate the performance of DFU and experimental results show that DFU consumes 34.29% less energy than that of the existing algorithms.

中文翻译：

---

能量感知混合临界零星任务调度算法

混合临界系统在单个系统中提供具有不同临界状态的多个实时应用程序。以往关于混合临界偶发性任务的研究节能效果不佳，主要是由于没有考虑到偶发性任务随机到达产生的松弛时间。在本文中，我们专注于调度能量感知混合临界性偶发任务，并考虑到偶发任务的随机到达。我们提出了一种动态频率更新混合临界算法（DFU）。基于最早期限优先方案的 DFU 可以在低危急模式下利用高危任务产生的松弛时间来降低处理器频率。此外，它还可以动态更新偶发任务集的利用率，进一步降低处理器频率。