4.6 Article

Maximizing Utilization and Minimizing Migration in Thermal-Aware Energy-Efficient Real-Time Multiprocessor Scheduling

期刊

IEEE ACCESS
卷 9, 期 -, 页码 83309-83328

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2021.3086698

关键词

Task analysis; Processor scheduling; Job shop scheduling; Context; Schedules; Real-time systems; Partitioning algorithms; Real-time; scheduling; clustering algorithms; multiprocessors; Petri nets; control

资金

  1. MINECO/AEI/ERDF (EU) [PID2019 105660RB C21/AEI/10.13039/501100011033]
  2. Aragon Government [T58_20R]
  3. Construyendo Europa desde Aragon under Project ERDF 2014-2020
  4. CONACYT

向作者/读者索取更多资源

CAlECs is a clustered scheduling system for MPSoCs that optimizes energy consumption by calculating a cyclic executive for hard real-time tasks at minimum frequency. It includes an online controller to manage system and task variations, ensuring constraints are met. The system's modular design allows for different modeling and scheduling approaches, leading to optimized CPU utilization and reduced SWaP factor.
This work proposes CAlECs, a clustered scheduling system for MPSoCs subject to thermal and energy constraints. It calculates off-line a cyclic executive honoring temporal and thermal constraints, for a hard real-time (HRT) task set at minimum frequency to reduce consumed energy, minimizing context switches and migrations. It also provides an on-line controller able to manage system and task parametric variations and soft real-time (SRT) tasks, always meeting the HRT task set constraints and the system thermal bound. CAlECS maximizes CPU utilization to help avoid overprovisioning contributing to a low SWaP factor. Its modular design allows the utilization of different modeling and scheduling approaches, and makes the off-line and on-line components independent from each other to better suit the requirements of a specific system. We experimentally show that the cyclic executive provided by CAlECS for HRT task sets outperforms RUN, a reference off-line algorithm in terms of optimal number of context switches.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据