一种高速crossbar调度算法及其性能分析  

Novel scheduling algorithm in high-speed crossbar and its performance analysis

作　　者：姜小波[1] 杜小伟[1] 

机构地区：[1]华南理工大学电子与信息学院,广州510641

出　　处：《计算机应用》2010年第1期101-103,共3页journal of Computer Applications

摘　　要：分析了高速crossbar调度算法iSLIP在处理突发业务时性能严重恶化的原因。结合LQF/iLQF算法的思想,提出了又一种输入排队crossbar调度算法iPGQM。仿真结果表明:该调度算法在均匀业务流量下和iSLIP算法的性能基本相同;在突发业务的条件下,iPGQM算法具有更好的抗突发特性;特别在重负载的条件下,与iSLIP算法相比,不仅具有更高的吞吐量,而且平均延迟降低了10%左右。This paper analyzed the reasons for which the high-speed crossbar scheduling algorithm iSLIP has a serious deterioration of performance under burst traffics. With reference to the ideas of LQF/iLQF, this paper proposed a novel inputqueued crossbar scheduling algorithm called iPGQM （iterative Parallel Graded-Length Queue Matching）. Simulation results show that iPGQM has the same performance as iSLIP under uniform traffics. Furthermore it has better performance than iSLIP under burst traffics. Especially in heavy load conditions, iPGQM not only achieves higher throughput, but also reduces the average delay about 10% compared with iSLIP algorithm.

关 键 词：CROSSBAR 调度算法 输入排队 非均匀业务流 iSLIP 

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