arrow
返回

A new direct acyclic graph task scheduling method for heterogeneous Multi-Core processors

delete2022-12-01
delete1
PRE
AI
F
Feng Xiao *
C
Chen Shushan
H
Han Xingxing
S
Shujuan Huang
W
Wenjuan Zhang
DOI:10.1016/j.compeleceng.2022.108464delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
At present, the traditional methods of calculating the worst response time upper bounds for direct acyclic graph (DAG) task scheduling on heterogeneous multi-core platforms suffer from problems such as nonself-sustainability, too many blocking nodes, and excessive estimation of the overhead time required for task scheduling, all of which cause response time upper bound estimates to be far too pessimistic. We propose to reconstruct the DAG graph by adding execution edges in order to eliminate blocking nodes. The specific method is to first use triples to represent each node of the DAG task graph, then to select blocking nodes according to the priority rules with which we add execution edges graph to reconstruct it, and finally to remove the blocking nodes again and repeat the process until all blocking nodes have been eliminated. Our experiments show that the worst response time upper bound from this method can achieve a 20% improvement in accuracy compared to the traditional methods for calculating the worst response time upper bound.
Keyword:
Heterogeneous multi-core processors
Task scheduling
DAG
Worst response time

期刊

C
Computers and Electrical Engineering
IF:
4.9
论文数:
6.7K
被引数:
1.3W

机构

暂无机构信息
引用论文

引用论文

Determination of the Self-Association Residues within a Homomeric and a Heteromeric AAA+ Enhancer Binding Protein
err2014-04-01
err0
PREAI
errEdward Lawton; Milija Jovanovic; Nicolas Joly; Christopher Waite; Nan Zhang; Baojun Wang; Patricia Burrows; Martin Buck
err分享
err收藏
err分享
err收藏
Overlay Cognitive ABCom-NOMA-Based ITS: An In-Depth Secrecy Analysis
err2022-01-01
err20
errOAAI
errZheng, Yike; Li, Xingwang; Zhang, Hui; Alshehri, Mohammad Dahman; Dang, Shuping; Huang, Gaojian; Zhang, Changsen
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容