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

一种新的提供服务时间保证的流调度算法
引用本文:洪中,唐依珠.一种新的提供服务时间保证的流调度算法[J].计算机工程,2008,34(22):124-126.
作者姓名:洪中  唐依珠
作者单位:1. 福州大学数学与计算机科学学院,福州,350002;福建师范大学数学与计算机科学学院,福州,350007
2. 福州大学数学与计算机科学学院,福州,350002
摘    要:通过对现有流调度算法的研究,在NSTF算法基础上引入量化思想,提出一种新的多节目调度算法QNSTF。该算法以量化后的下次调度时间作为调度依据,使系统在效率和公平性之间取得较好的折中。仿真实验表明,QNSTF能减少用户平均等待时间,保持较低的用户请求撤销率与不公平性,同时向用户提供可靠的服务时间保证,提高了VoD系统的服务性能。

关 键 词:流调度算法  多节目调度  服务时间保证
修稿时间: 

Stream Scheduling Algorithm of Providing Service Time Guarantees
HONG Zhong,TANG Yi-zhu.Stream Scheduling Algorithm of Providing Service Time Guarantees[J].Computer Engineering,2008,34(22):124-126.
Authors:HONG Zhong  TANG Yi-zhu
Affiliation:(1. School of Mathematics and Computer Science, Fuzhou University, Fuzhou 350002;2. School of Mathematics and Computer Science, Fujian Normal University, Fuzhou 350007)
Abstract:Through the research on stream scheduling algorithms, the idea of quntization is introduced based on NSTF algorithm. A new algorithm called QNSTF is also proposed. This algorithm makes the quantized next schedule time as precondition, which makes a good balance between the efficiency and fairness. Simulation experimental result shows that QNSTF reduces the average waiting time while maintaining relatively low level in refusal radio and unfairness, and provides the customers with reliable service time guarantees. The algorithm improves the capability and performance of a VoD system.
Keywords:stream scheduling algorithm  multi-program schedule  service time guarantees
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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