Considering the disadvantage of first-fit strategy in fault-tolerant rate-monotonic first-fit (FTRMFF) algorithm, we analyze the slack time of processors and the schedulability of periodic tasks in rate-monotonic ...Considering the disadvantage of first-fit strategy in fault-tolerant rate-monotonic first-fit (FTRMFF) algorithm, we analyze the slack time of processors and the schedulability of periodic tasks in rate-monotonic (RM) algorithm. Then, the RM-based idleness factor and compact factor are presented to quantify the compact degree of tasks assigned to the same processor. In this paper, the novel fault-tolerant rate-monotonic compact-factor-driven (FTRMCFD) algorithm, which follows the principle of compact factor maximal when allocating the processors for tasks, is proposed. FTRMCFD algorithm makes every processor contain more tasks and get higher utilization to increase the schedulability performance of distributed systems. The simulation experiments reveal that FTRMCFD can reduce the number of required processors by up to 11.5% (with an average of 5.3%).展开更多
文摘固定优先级任务可调度性判定是实时系统调度理论研究的核心问题之一.目前已有的各种判定方法可归结为两大类:多项式时间调度判定和确切性判定.多项式时间调度判定通常采用调度充分条件来进行,为此,许多理想条件下基于RM(rate monotonic)调度算法的CPU利用率最小上界被提了出来.确切性判定利用RM调度的充要条件,保证任何任务集均可被判定,并且判定结果是确切的.但是由于时间复杂度较差,确切性判定方法难以实现在线分析.提出了一种改进的RM可调度性判定方法(improved schedulability test algorithm,简称ISTA).首先介绍了任务调度空间这一概念,并提出了二叉树表示,然后进一步提出了相关的剪枝理论.在此基础上,研究了任务之间可调度性的相关性及其对判定任务集可调度性的影响,提出并证明了相关的定理.最后基于提出的定理,给出了一种改进的伪多项式时间可调度性判定算法,并与已有的判定方法进行了比较.仿真结果表明,该算法平均性能作为任务集内任务个数的函数具有显著提高.
基金Supported by the National Natural Science Foundation of China (60603032)
文摘Considering the disadvantage of first-fit strategy in fault-tolerant rate-monotonic first-fit (FTRMFF) algorithm, we analyze the slack time of processors and the schedulability of periodic tasks in rate-monotonic (RM) algorithm. Then, the RM-based idleness factor and compact factor are presented to quantify the compact degree of tasks assigned to the same processor. In this paper, the novel fault-tolerant rate-monotonic compact-factor-driven (FTRMCFD) algorithm, which follows the principle of compact factor maximal when allocating the processors for tasks, is proposed. FTRMCFD algorithm makes every processor contain more tasks and get higher utilization to increase the schedulability performance of distributed systems. The simulation experiments reveal that FTRMCFD can reduce the number of required processors by up to 11.5% (with an average of 5.3%).