引用本文:金宏,王宏安,王强,戴国忠.一种任务优先级的综合设计方法.软件学报,2003,14(3):376-382
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 5469次   下载 7137 本文二维码信息
码上扫一扫!
分享到: 微信 更多
一种任务优先级的综合设计方法
金宏1, 王宏安1, 王强1, 戴国忠1
中国科学院软件研究所人机交互技术与智能信息处理实验室,北京,100080
摘要:
提出了一种基于优先级表设计的调度算法.将任务的相对截止期和空闲时间这两个特征参数结合起来,综合设计任务的优先级表,使得截止期越早或空闲时间越短,任务的优先级越高,而且任务的优先级由相对截止期和空闲时间惟一确定.对于任意一个任务,可通过对设计的优先级表进行二元多点插值获得相应任务的惟一优先级.与传统的EDF和LSF算法进行仿真比较,仿真结果表明,通过优先级表设计方法来确定任务的优先级,提高了任务调度的成功率,降低了任务截止期的错失率.该方法可应用于实时系统中实时任务的动态调度中.
关键词:  实时系统  动态调度  调度策略  任务优先级  调度成功率
DOI:
分类号:
基金项目:Supported by the National Natural Science Foundation of China under Grant No.69896250 (国家自然科学基金); the National High-Tech Research and Development Plan of China under Grant No.2001AA413020 (国家高技术研究发展计划)
An Integrated Design Method of Task Priority
JIN Hong,WANG Hong-An,WANG Qiang,DAI Guo-Zhong
Abstract:
A scheduling algorithm based on priority table design is presented in this paper. Any two characteristic parameters (e.g., relative deadline and slack) of a task are combined to design its priority table so that the deadline is nearer or the slack is shorter, the priority is higher. The priority of a task is uniquely determined by its relative deadline and slack. For any task, its unique priority can be obtained by using Lagrange interposing algorithm on the designed priority table. Compared with the classical EDF and LSF policies, simulated results show that the proposed algorithm improves the efficiency of task scheduling, i.e., to designate the priority of a task, increases the succeed ratio of task scheduling, and decreases the missed deadline percentage. The proposed algorithm can be applied to dynamically schedule real-time tasks in real-time systems.
Key words:  real-time system  dynamic scheduling  scheduling policy  task priority  scheduling success ratio