动态优先级调度下时限受限的偶发任务加速因子的改进
An Improved Speedup Factor for Sporadic Tasks with Constrained Deadlines under Dynamic Priority Scheduling
摘要:
可调度性是实时调度中的一个基本问题,但由于其固有的计算困难,必须对其进行近似。作为多进程平台上最流行的可并行性判定算法,分区EDF的加速比因子分析具有挑战性,并且远未确定。Partitioned-EDF最早由Barush和Fisher在2005年提出[1],并被证明具有最多3-1/m的加速因子,这意味着如果零星任务的输入在速度为1的m个处理器上是可行的,则partitioned-EDF将始终在速度为3-1/m的m个处理器上返回成功。在2011年,Chen和Chakraborty [2]将这个上限改进为2.6322-1/m,此后没有出现更多的改进。在本文中,我们开发了一种新的方法来离散化和正则化零星任务,这使我们能够提高,在有约束的最后期限的情况下,分区EDF的加速因子为2.5556-1/m,非常接近[2]中的渐近下限2.5。
英文摘要:
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 been 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 return succeeded 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].
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。