4.6 Article

TSSA: Task structure-aware scheduling of energy-constrained parallel applications on heterogeneous distributed embedded platforms

期刊

JOURNAL OF SYSTEMS ARCHITECTURE
卷 132, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.sysarc.2022.102741

关键词

Task structure awareness; Task scheduling; Heterogeneous distributed embedded systems; Energy consumption limitation; Energy-efficient computing

资金

  1. National Natural Science Foundation of China
  2. China Post-doctoral Science Foundation
  3. [62002147]
  4. [2020TQ0134]

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

This study proposes a structure-aware task scheduling strategy for parallel application scheduling in heterogeneous distributed embedded systems, along with an improved energy pre-allocation algorithm. Experimental results demonstrate that the algorithm can reduce task scheduling length and energy consumption.
Heterogeneous distributed embedded systems are widely used because they can significantly improve the computing performance of parallel applications in embedded systems. Since such systems are limited by both system energy consumption and schedule length, further scheduling optimization design is required. To achieve a balance between computing performance and energy consumption, the task scheduling problem under energy constraints has attracted great attention from researchers in recent years. However, state-of-the-art algorithms ignore the impact of the task structure of the application on scheduling performance. In this study, a structure-aware task scheduling strategy is proposed for the parallel application scheduling problem in heterogeneous distributed embedded systems. Specifically, the structure of the application is considered a factor affecting the algorithm. Meanwhile, to reduce the schedule length of the application and avoid pessimistic energy allocation, this study proposes an improved weighted energy pre-allocation algorithm. Experimental results demonstrate that the task structure-aware algorithm can decrease the scheduling length for energy consumption-constrained parallel applications. Compared with the MSLECC algorithm, the task scheduling length of the task structure-aware algorithm in the Gaussian Elimination transform can be shortened by 42.39%.

作者

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

评论

主要评分

4.6
评分不足

次要评分

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

推荐

暂无数据
暂无数据