能够提供QoS保证的固定优先级调度  

Fixed-priority schedule with QoS guarantee

作　　者：赵明[1,2] 赵海[1] 高怡臣[3] 罗桂兰[1] 董洁[2] 

机构地区：[1]东北大学信息科学与工程学院,沈阳110004 [2]沈阳建筑大学信息与控制工程学院,沈阳110168 [3]东北大学机械工程与自动化学院,沈阳110004

出　　处：《计算机工程与应用》2009年第14期46-48,共3页Computer Engineering and Applications

摘　　要：弱硬实时应用要求调度算法必须确保提供满足其弱硬实时QoS(Quality of Service)参数要求的服务,一种新的能够提供(m,k)-firm保证的固定优先级调度算法被提出,该算法能够根据任务的周期以及所要求的QoS参数进行调度优先级的设定,并通过将任务设置为抢占和可选来反映其紧迫程度。文中给出该算法的可调度判定不等式,并且通过对经典任务集的调度结果,验证了算法的有效性和灵活性。Weakly hard real-time application requires that scheduling algorithm should provide service satisfied its QoS parameter,so a new fixed-priority scheduling algorithm with （m,k）-firm guarantee is presented.It assigns scheduling priority of task based on its period and its QoS parameter,and the task is switched between preemptive state and optional state to reflect its pressure.Schedulability test inequation of the algorithm is presented in the paper.The validity and the flexibility of the algorithm are proved through the analysis of classical task sets.

关 键 词：弱硬实时QoS 调度 抢占 可选 

分 类 号：TP316.2[自动化与计算机技术—计算机软件与理论]