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

分时EDF算法及其在多媒体操作系统中的应用
引用本文:张怡,张拥军,彭宇行,陈福接.分时EDF算法及其在多媒体操作系统中的应用[J].计算机学报,2001,24(3):315-320.
作者姓名:张怡  张拥军  彭宇行  陈福接
作者单位:国防科学技术大学计算机学院
摘    要:提出了一种新的CPU调度算法--分时EDF(Earliest Deadine First)算法,该算法能保证硬实时任务不丢失死线,并易于在分时系统中实现。以分时EDF算法为基础,提出一种新的CPU层次调度算法--HRFSFQ,该算法用于多媒体操作系统时能保证各类任务的QoS。最后通过大量实验证明了上述算法的有效性和正确性。

关 键 词:多媒体操作系统  分时EDF算法  CPU  EDF算法  SFQ算法
修稿时间:1999年11月26

Time-Sharing EDF Algorithm and Its Application in Multimedia OS
ZHANG Yi,ZHANG Yong,Jun,PENG Yu,Xing,CHEN Fu,Jie.Time-Sharing EDF Algorithm and Its Application in Multimedia OS[J].Chinese Journal of Computers,2001,24(3):315-320.
Authors:ZHANG Yi  ZHANG Yong  Jun  PENG Yu  Xing  CHEN Fu  Jie
Abstract:Hard real time tasks, soft real time tasks and best effort tasks often exist in the multimedia operating system at the same time and require different QoS for system resources, such as CPU, memory and network. So how to allocate system resources reasonably such that every task could achieve its QoS becomes an urgent problem, especially for CPU scheduling.There are two approaches to realize CPU scheduling in multimedia operating system. One method is to make the time sharing operating system support real time tasks. This method is compatible with all applications in nowadays general OS, but it usually uses heuristic scheduling algorithms and it is difficult to realize task's admission control exactly. Another method is to use real time operating systems that adopt classical real time scheduling algorithms such as RM and EDF. The classical real time CPU scheduling algorithms are often used to guarantee hard real time tasks' QoS and not suitable for soft real time tasks and best effort tasks. Due to its generality, the former method is the direction in the near future.For scheduling different\|type tasks in multimedia OS, hierarchical scheduling is proposed. First, hierarchical scheduling allocates CPU bandwidth to every task class proportionally. Then, every task class is scheduled using algorithm suitable for it. The examples of hierarchical scheduling is WFQ, SFQ, EEVDF and so on. But a common flaw in these hierarchical scheduling algorithms is that they can not guarantee hard real time tasks' deadline.So, in this paper we propose a new CPU scheduling algorithm named time sharing EDF, which can be used to schedule hard real time tasks in general time sharing systems, and can be implemented easily. We also provide its schedulability test conditions. Based on time sharing EDF, we further propose HRFSFQ algorithm, a CPU hierarchical scheduling algorithm, which can be used in multimedia operating systems and guarantee tasks' QoS. Finally the efficiency and correctness of these algorithms are given by extensive simulation.
Keywords:time-sharing EDF  multimedia OS  CPU scheduling  HRFSFQ  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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