一种抗突发分布式循环调度算法的设计与分析  

Design and Analysis of a Distributed Scheduling Algorithm with the Ability of Solving Bursty Traffic Load

作　　者：夏鸣[1] 罗志祥[1] 胡嘉[1] 王卓[1] 黄启睿[1] 

机构地区：[1]华中科技大学激光国家重点实验室,湖北武汉430074

出　　处：《小型微型计算机系统》2006年第12期2294-2296,共3页Journal of Chinese Computer Systems

基　　金：国家"八六三"课题"高性能宽带信息网专项"(2003AA103910)资助.

摘　　要：输入队列因具有良好的可扩展性而广泛应用于高速交换结构和路由器中,但输入队列需要精心设计调度算法以获取较好的性能.iSLIP算法因其简单性和并行性而得到广泛的研究,但现有的iSLIP(iterativeSLIP)算法在突发流量和非均匀流量下的负荷延迟性能较差.本文针对突发业务流,在基于优先级调度算法的思想上,提出了调度决策双重门限的概念,并且根据其设计出双门限循环调度算法—iADT(iterativeAlgorithmwithDualThresholds).仿真结果表明,iADT不仅在均匀流量下是稳定的,在非均匀流量和突发流量下的延迟性能均远好于现有的iSLIP算法.Input Queued scheduling has been widely used in high performance routers, but the algorithm they employ should be elaborately designed in order to achieve a better performance. Because of the high throughput and being easily implemented ,the iSLIP（iterative SLIP）algorithm has received lots of concern. However,it suffers from poor performance when nonuniform and bursty traffic arrives. In this paper,a prioritized algorithm named iADT （iterative Algorithm with Dual Thresholds） is introduced, which is able to outperform the existing iSLIP under bursty traffic. Based on the simulation result, it is clear that iADT can not only greatly reduce the average cell latency when the bursty load arrives, but also maintain the same performance under uniform i. i. d traffic as iSLIP does.

关 键 词：循环仲裁算法 高速路由器 突发业务 交叉开关 

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