An Improved Speedup Factor for Sporadic Tasks with Constrained Deadlines Under Dynamic Priority Scheduling
An Improved Speedup Factor for Sporadic Tasks with Constrained Deadlines Under Dynamic Priority Scheduling
复制标题
动态优先级调度下时限有限的零星任务的改进加速因子
DOI:
10.1109/rtss.2018.00058
复制
发表时间:
2018
期刊:
影响因子:
--
通讯作者:
Liu, Xingwu
中科院分区:
文献类型:
--
作者:
Han, Xin;Zhao, Liang;Guo, Zhishan;Liu, Xingwu
Schedulability is a fundamental problem in real-time scheduling, but it has to be approximated due to the intrinsic computational hardness. As the most popular algorithm for deciding schedulability on multiprocess platforms, the speedup factor of partitioned-EDF is challenging to analyze and is far from being determined. Partitioned-EDF was first proposed in 2005 by Barush and Fisher [1], and was shown to have a speedup factor at most 3-1/m, meaning that if the input of sporadic tasks is feasible on m processors with speed one, partitioned-EDF will always succeed on m processors with speed 3-1/m. In 2011, this upper bound was improved to 2.6322-1/m by Chen and Chakraborty [2], and no more improvements have appeared ever since then. In this paper, we develop a novel method to discretize and regularize sporadic tasks, which enables us to improve, in the case of constrained deadlines, the speedup factor of partitioned-EDF to 2.5556-1/m, very close to the asymptotic lower bound 2.5 in [2].
登录
查看更多内容
影响因子:
1.3
作者:
Robert I. Davis;Abhilash Thekkilakattil;Oliver Gettings;R. Dobrin;S. Punnekkat;Jian
通讯作者:
Jian
DOI:
--
发表时间:
2017
期刊:
影响因子:
--
作者:
Zhishan Guo
通讯作者:
Zhishan Guo
DOI:
--
发表时间:
2011
期刊:
影响因子:
--
作者:
J. Theis;G. Fohler
通讯作者:
G. Fohler
影响因子:
3.7
作者:
Kunal Agrawal;Sanjoy Baruah
通讯作者:
Sanjoy Baruah
DOI:
--
发表时间:
2010
期刊:
ACM-SIAM Symposium on Discrete Algorithms
影响因子:
--
作者:
F. Eisenbrand;T. Rothvoss
通讯作者:
T. Rothvoss