A Capacity Augmentation Bound for Real-Time Constrained-Deadline Parallel Tasks Under GEDF

作者：Sun, Jinghao; Guan, Nan^*; Jiang, Xu; Chang, Shuangshuang; Guo, Zhishan; Deng, Qingxu; Yi, Wang

来源：IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2018, 37(11): 2200-2211.

DOI：10.1109/TCAD.2018.2857362

• Capacity augmentation bound
• directed acyclic graph (DAG)
• global earliest deadline first (GEDF)
• parallel tasks
• real-time scheduling
• schedulability analysis

Capacity augmentation bound is a widely used quantitative metric in theoretical studies of schedulability analysis for directed acyclic graph (DAG) parallel real-time tasks, which not only quantifies the suboptimality of the scheduling algorithms, but also serves as a simple linear-time schedulability test. Earlier studies on capacity augmentation bounds of the sporadic DAG task model were either restricted to a single DAG task or a set of tasks with implicit deadlines. In this paper, we consider parallel tasks with constrained deadlines under global earliest deadline first policy. We first show that it is impossible to obtain a constant bound for our problem setting, and derive both lower and upper bounds of the capacity augmentation bound as a function with respect to the maximum ratio of task period to deadline. Our upper bound is at most 1.47 times larger than the optimal one. We conduct experiments to compare the acceptance ratio of our capacity augmentation bound with the existing schedulability test also having linear-time complexity. The results show that our capacity augmentation bound significantly outperforms the existing linear-time schedulability test under different parameter settings.

• 出版日期2018-11
• 单位香港理工大学; 东北大学