.png){kind=icon}
返回
Decomposition-based scheduling for parallel real-time tasks on multiprocessors
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2021.107644.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses the problem of multiprocessor real-time scheduling for parallel tasks modeled as directed acyclic graph (DAG). We propose a new decomposition-based scheduling algorithm to schedule parallel DAG tasks with implicit-deadlines. We prove that our algorithm has a resource augmentation bound of 2.618 for DAG tasks with implicit-deadlines when the decomposed tasks are scheduled using Global EDF scheduling, i.e., if the input set of DAG tasks is schedulable on.. unit-speed processors, the proposed scheduling algorithm will always succeed on.. processors with speed 2.618. This result improves the resource augmentation bound of 2.618 for tasks with special DAGs provided by Qamhieh et al. in 2019. Moreover, when using Global DM (Partitioned-DM, respectively) scheduling for the decomposed tasks, we prove a resource augmentation bound of 3.42 for DAG tasks with implicit-deadlines, which improves the resource augmentation bound of 3.73 for tasks with special DAGs (3.42 for fork-join tasks, respectively).
Keyword:
Real-time scheduling
Parallel task
Directed Acyclic Graph
Decomposition
Resource augmentation bound
期刊
C
IF:
4.9
论文数:
6.7K
被引数:
1.3W
机构
引用论文
Predicting STI Positivity in US Cisgender Women Using Electronic Resources利用电子资源预测美国顺性别女性中STI的阳性率
PREAI
分享收藏
分享收藏Functional Magnetic Resonance Imaging Demonstrates That Hypnosis Is Conscious and Voluntary.png)
Psychology
OAAI
PsychologyIF0
OAAI分享收藏分享收藏 没有更多内容
没有更多内容