首页 | 本学科首页   官方微博 | 高级检索  
     

一种新的基于优先级表的实时调度算法
引用本文:王强,徐俊刚,王宏安,戴国忠.一种新的基于优先级表的实时调度算法[J].电子学报,2004,32(2):310-313.
作者姓名:王强  徐俊刚  王宏安  戴国忠
作者单位:中国科学院软件研究所人机交互技术与智能信息处理实验室,北京 100080
基金项目:国家自然科学基金,国家高技术研究发展计划(863计划)
摘    要:本文提出了一种新的基于优先级表的实时调度算法,称作截止期—价值密度优先(Deadline - Value Density First)算法,简称DVDF算法.DVDF算法综合考虑了实时任务的截止期和价值密度两个参数,能够更好地适应不同的负载情况.通过使用正常负载和过载情况下的典型数据对算法进行仿真研究表明,这种算法比单纯考虑截止期的EDF(Earliest Deadline First)算法在性能方面有明显的改进,特别是在系统过载的情况下,能够优雅地降级.

关 键 词:实时调度  优先级  实现价值率  加权截止期保证率  差分截止期保证率  
文章编号:0372-2112(2004)02-0310-04
收稿时间:2003-01-23

A New Priority Table Based Real-Time Scheduling Algorithm
WANG Qiang,XU Jun gang,WANG Hong an,DAI Guo zhong.A New Priority Table Based Real-Time Scheduling Algorithm[J].Acta Electronica Sinica,2004,32(2):310-313.
Authors:WANG Qiang  XU Jun gang  WANG Hong an  DAI Guo zhong
Affiliation:Intelligence Engineering Lab,Institute of Software,Chinese Academy of Sciences,Beijing 100080,China
Abstract:A new priority table based real time scheduling algorithm named DVDF (Deadline Value Density First) is proposed.This algorithm takes the deadlines and value density of real time tasks into account synthetically,and can adapt different load conditions better.In contrast to classical EDF (Earliest Deadline First) algorithm that only considers the deadlines of real time tasks,DVDF algorithm is shown to improve the performance of scheduling obviously by simulation with some typical data of various parameters under normal workload and overload situation,especially under overload situation,it can degrade gracefully.
Keywords:real  time scheduling  priority  hit value ratio  weighted guarantee ratio  differentiated guarantee ratio
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号