| 面向区分服务的可重构任务在线调度算法 |
| |
| 引用本文： | 黄万伟,汪斌强,王保进,于婧. 面向区分服务的可重构任务在线调度算法[J]. 计算机辅助设计与图形学学报, 2010, 22(4) |
| |
| 作者姓名： | 黄万伟 汪斌强 王保进 于婧 |
| |
| 作者单位： | 国家数字交换系统工程技术研究中心,郑州,450002 |
| |
| 基金项目： | 国家“八六三”高技术研究发展计划(2009AA012201,2008AA01A323) |
| |
| 摘 要： | 现有的先来先服务和预约调度算法中可重构任务调度顺序取决于该任务到达次序,无法体现不同任务的优先级差异以及前后任务的时间关联性,为此提出一种基于预约抢占的可重构任务在线调度算法.通过区分不同任务的优先级属性,并引入任务紧迫度的概念,实现差异化任务调度;对已预约任务采用预约失效机制,使高优先级或同优先级中紧迫度较大的新任务优先调度,从而实现对已预约任务队列进行抢占式调度.实验结果表明,该算法能有效地提高任务的整体调度成功率,并可优先保证高优先级任务的调度成功率.
|
| 关 键 词： | 先来先服务 预约调度 可重构任务 优先级 紧迫度 |
A New Online Scheduling Algorithm of Reconfigurable Tasks for Differentiated Service |
| |
| Huang Wanwei,Wang Binqiang,Wang Baojin,, Yu Jing. A New Online Scheduling Algorithm of Reconfigurable Tasks for Differentiated Service[J]. Journal of Computer-Aided Design & Computer Graphics, 2010, 22(4) |
| |
| Authors: | Huang Wanwei Wang Binqiang Wang Baojin Yu Jing |
| |
| Affiliation: | China National Digital Switching System Engineering and Technological Research Center/a>;Zhengzhou 450002 |
| |
| Abstract: | In existing online scheduling algorithms of reconfigurable tasks,such as first coming first serviced and planning scheduling,the scheduling sequence is determined by the arrival time of the tasks,ignoring the priorities of different tasks and the temporal relations among the sequential tasks.This paper presents a new online scheduling algorithm with planning preempted method,which realizes the differentiation of the scheduling process by distinguishing different priority and urgency of the tasks.By invalida... |
| |
| Keywords: | first coming first serviced planning schedule reconfigurable tasks priority urgency |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
