当前位置: X-MOL 学术Inf. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Narrowing the speedup factor gap of partitioned EDF
Information and Computation ( IF 1 ) Pub Date : 2021-03-26 , DOI: 10.1016/j.ic.2021.104743
Xingwu Liu , Xin Han , Liang Zhao , Zhishan Guo

Schedulability is a fundamental problem in analyzing real-time systems, but it often has to be approximated because of the intrinsic computational hardness. Partitioned earliest deadline first (EDF) is one of the most popular polynomial-time and practical scheduler on multiprocessor platforms, and it was shown to have a speedup factor of at most 2.63221/m. This paper further improves the factor to 2.55561/m for both the constrained-deadline case and the arbitrary-deadline case, and it is very close to the known (non-tight) lower bound of 2.51/m. The key ideas are that we develop a novel method to discretize and regularize sporadic task sets that are schedulable on uniprocessors, and we find that the ratio (ρ) of the approximate demand bound value to the machine capacity is upper-bounded by 1.5556 for the arbitrary-deadline case, which plays an important role in estimating the speed factor of partitioned EDF.



中文翻译:

缩小分区EDF的加速因子差距

可调度性是分析实时系统的一个基本问题,但由于固有的计算难度,它通常必须近似。分区最早截止日期优先 (EDF) 是多处理器平台上最流行的多项式时间和实用调度程序之一,它的加速因子最多为2.6322-1/. 本文进一步改进因子为2.5556-1/ 对于有约束的截止日期和任意截止日期的情况,它非常接近已知的(非紧的)下界 2.5-1/. 关键思想是我们开发了一种新方法来离散化和正则化可在单处理器上调度的零星任务集,我们发现近似需求边界值与机器容量的比率 ( ρ ) 的上限为 1.5556任意期限情况,它在估计分区 EDF 的速度因子方面起着重要作用。

更新日期:2021-03-26
down
wechat
bug