【摘要】 弱硬实时应用要求调度算法必须确保提供满足其弱硬实时QoS(Quality of Service)参数要求的服务,一种新的能够提供(m,k)-firm保证的固定优先级调度算法被提出,该算法能够根据任务的周期以及所要求的QoS参数进行调度优先级的设定,并通过将任务设置为抢占和可选来反映其紧迫程度。文中给出该算法的可调度判定不等式,并且通过对经典任务集的调度结果,验证了算法的有效性和灵活性。更多还原

【Abstract】 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.更多还原