基于MFQ的补丁优先算法的研究与实现  

Research and implementation of patch priority scheduling algorithm based on MFQ

作　　者：迟新利[1] 刘禹林[1] 

机构地区：[1]沈阳工程学院自动控制工程系,沈阳110136

出　　处：《沈阳工程学院学报（自然科学版）》2005年第2期84-86,共3页Journal of Shenyang Institute of Engineering:Natural Science

摘　　要：目前采用的视频流调度算法,没有充分利用补丁流满足服务率高而占用系统资源少的优势,系统效率较低．为了提高效率,提出了一种基于 MFQ 的补丁优先算法,并给出了该算法的系统流程。通过对实验结果的比较,该算法在用户请求撤销率、节目调度不公平性和用户等待时间方面有明显的优越性．At present, because doesn＇t utilize fully the patch stream＇ s advantages that satisfaction rate is high and employment resource is few, video stream scheduling algorithm brings that efficiency is lower. In order to enhance efficiency, puts forward a patch prioriy scheduling algorithm based on MFQ, gives its flow. By comparing the experiment results, finds this algorithm has obvious advantages on the aspects of defection rate, unfairness of program scheduling, average latency time and so on.

关 键 词：视频流 性能指标 补丁优先算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]