一种基于延迟的队列调度实现

Realization of Queue Scheduling Based on Delay

下载PDF

导出

摘要 PQBEDF算法是一种将优先级和时延相结合的动态优先级调度算法,具有快速高效的特点。对PQBEDF算法进行了研究,对其实现过程进行了改进,并给出了具体实现方法,同时对队列长度和优先级之间的关系作了分析。改进后的算法简化了操作,避免了PQBEDF算法中优先级可能相同的不合理现象,提高了算法的鲁棒性。另外,改进后的算法在公平性上也有所提高,不仅满足高优先级业务对带宽和时延的要求,对低优先级业务也有一定的保障,为各业务提供既有一定保证又有所区别的服务,具有一定的公平性和合理性。 PQBEDF（priority queue based on EDF） algorithm is a dynamic priority scheduling algorithm combined priority with time delay, and it is fast and efficient. PQBEDF algorithm is discussed, a new way of implementation process is improved, the relation between queue length and priority is analyzed. The improved algorithm simplifies the operation and avoids the phenomenon of priorities being identical in PQBEDF algorithm sometimes, the robustness of the algorithm is improved. Besides, the improved algorithm can guarantee the bandwidth and latency requirements not only for high-priority business but also for low-priority business to certain extent. It guarantees the quality of service for various different businesses, and is fair and reasonable.

作者蒋维成

机构地区成都理工大学工程技术学院

出处《现代电子技术》 2010年第13期73-75,共3页 Modern Electronics Technique

基金成都理工大学工程技术学院科研发展基金资助项目(C122010003)资助

关键词 PQBEDF算法时延队列调度 PQBEDF algorithm time delay queue scheduling

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

引文网络
相关文献

参考文献9

1SHENKER S, PARTRIDGE C, GUERIN R. RFC2212 Specification of guaranteed quality of service [ S/OL]. [2001-08-07]. http://China-pub, com.
2CHARIKAR M, NAOR J, SCHIEBER B. Resource optimization in QoS multicast routing of real-time multimedia[J]. IEEE/ACM Trans. on Networking, 2004, 12 ( 2 ) :340-348.
3KUROSEJF,ROSSKW.计算机网络自顶向下方法与Inernet特色[M].陈鸣,译.北京:机械工业出版社,2005.
4BAKER T P. An analysis of EDF schedulability on a multiprocessor[J]. IEEE Trans. on Parallel and Distributed Systems, 2005, 16(8)760-768.
5钱光明.基于业务的多优先级队列区别服务方案[J].计算机工程与应用,2006,42(10):118-120. 被引量：7
6MCKEOWN N. The iSLIP scheduling algorithm for inputqueued switehes[J]. IEEE/ACM Trans. on Networking, 1999, 7(2)I 188-201.
7MARSAN M A, BIANCO A, GIACCONE P, et al. Packet-mode scheduling in input-queued cell-based switches[J]. IEEE/ACM Trans. on Networking, 2002, 10(5) : 666-678.
8陈敏.OPNET网络仿真[M].北京:清华大学出版社,2002.
9OPNET Technologies Inc.. OPNET Modeler[M]. Version 8.0. Washington DC.. OPNET Technologies Inc. , 2001.

二级参考文献11

1D Ferrari,D C Verma.A Scheme for Real-time Channel Establishment in Wide-area networks[J].IEEE JSAC,1990;8(3):368～379
2T W Kuo,W R Yang,K J Lin.A Class of Rate-Based Real-Time Scheduling Algorithms[J].IEEE Trans on Computers,2002; 51 (6):708～720
3M Charikar,J Naor,B Schieber.Resource Optimization in QoS Multicast Routing of Real-Time Multimedia[J].IEEE/ACM Trans on Networking,2004; 12 (2):340～348
4G Xue.Minimum-Cost QoS Multicast and Unicast Routing in Communication Networks[J].IEEE Trans on Communications,2003; 51 (5):817～824
5N Mckeown.The iSLIP Scheduling Algorithm for Input-Queued Switches[J].IEEE/ACM Trans on Networking,1999;7(2):188～201
6M A Marsan,A Bianco,P Giaccone et al.Packet-Mode Scheduling in Input-Queued Cell-Based Switches[J].IEEE/ACM Trans on Networking,2002; 10 (5):666～678
7S Shenker,C Partridge,R Guerin.Specification of Guaranteed Quality of Service[S].RFC2212,1997-09
8C L Liu,J W Layland.Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment[J].J ACM,1973;20(1):40～61
9R Chiopalkatti,J K urose,D Towsley.Scheduling Polices for Realtime and Non-real-time Traffic in a Statistical Multiplexer[C].In:IEEE INFOCOM '89,Ottawa,Canada,1989:774～783
10王宏宇,顾冠群.集成服务网络中的分组调度算法研究综述[J].计算机学报,1999,22(10):1090-1099. 被引量：13