用于多媒体的最早截止时间优先算法改进  

Improvement in the Earliest Deadline First Scheduling Algorithm for Multimedia Systems

作　　者：马永军[1] 杨帆[1] 

机构地区：[1]天津科技大学计算机科学与信息工程学院,天津300222

出　　处：《天津科技大学学报》2012年第4期65-68,共4页Journal of Tianjin University of Science & Technology

基　　金：教育部规划基金资助项目(12YJAZH091);国家自然科学基金资助项目(71141019)

摘　　要：对经典实时调度算法之一的最早截止时间优先算法进行研究,提出一种基于动态死线时间的改进方法,避免了瞬时过载导致的系统不可预测的行为.实验表明,本方法保证了连续多媒体应用的服务质量,达到较高的资源利用率,使该算法更加适合多媒体应用环境.A research on EDF （earliest deadline first） algorithm was conducted, which is in the realm of classical real-time scheduling algorithm. An improved method based on the dynamic deadline time was presented to decrease the number of starved tasks in order to avoid a transient overload which can lead to unpredictable behavior of the system. Experiments show that the quality of service for multimedia applications can be guaranteed in this way. The system can achieve higher resource utilization, and this algorithm is more suitable for streaming media applications.

关 键 词：多媒体 实时系统 任务调度 服务质量 最早截止时间优先算法 

分 类 号：TP397[自动化与计算机技术—计算机应用技术]