|
|||||
|
|
| 能够提供QoS保证的固定优先级调度 | |
| 引用本文： | 赵明,赵海,高怡臣,罗桂兰,董洁.能够提供QoS保证的固定优先级调度[J].计算机工程与应用,2009,45(14):46-48. |
| 作者姓名： | 赵明 赵海 高怡臣 罗桂兰 董洁 |
| 作者单位： | 1. 东北大学,信息科学与工程学院,沈阳,110004;沈阳建筑大学,信息与控制工程学院,沈阳,110168 2. 东北大学,信息科学与工程学院,沈阳,110004 3. 东北大学,机械工程与自动化学院,沈阳,110004 4. 沈阳建筑大学,信息与控制工程学院,沈阳,110168 |
| 摘 要： | 弱硬实时应用要求调度算法必须确保提供满足其弱硬实时QoS(Quality of Service)参数要求的服务,一种新的能够提供(m,k)-firm保证的固定优先级调度算法被提出,该算法能够根据任务的周期以及所要求的QoS参数进行调度优先级的设定,并通过将任务设置为抢占和可选来反映其紧迫程度。文中给出该算法的可调度判定不等式,并且通过对经典任务集的调度结果,验证了算法的有效性和灵活性。 |
| 关 键 词： | 弱硬实时QoS 调度 抢占 可选 |
| 收稿时间： | 2008-10-6 |
| 修稿时间： | 2008-11-17 |
Fixed-priority schedule with QoS guarantee |
|
| ZHAO Ming,ZHAO Hai,GAO Yi-chen,LUO Gui-lan,DONG Jie.Fixed-priority schedule with QoS guarantee[J].Computer Engineering and Applications,2009,45(14):46-48. | |
| Authors: | ZHAO Ming ZHAO Hai GAO Yi-chen LUO Gui-lan DONG Jie |
| Affiliation: | ZHAO Ming1,3,ZHAO Hai1,GAO Yi-chen2,LUO Gui-lan1,DONG Jie31.School of Information Science & Engineering,Northeastern University,Shenyang 110004,China 2.School of Mechanical Engineering & Automation,China 3.School of Information & Control Engineering,Shenyang Jianzhu University,Shenyang 110168,China |
| 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... |
| Keywords: | weakly hard real-time QoS scheduling preemptive optional |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 | |
| 点击此处可从《计算机工程与应用》下载全文 | |
