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

一种高速crossbar调度算法及其性能分析
引用本文:姜小波,杜小伟.一种高速crossbar调度算法及其性能分析[J].计算机应用,2010,30(1):101-103.
作者姓名:姜小波  杜小伟
作者单位:1. 华南理工大学2.
摘    要:分析了高速crossbar调度算法iSLIP在处理突发业务时性能严重恶化的原因。结合LQF/iLQF算法的思想,提出了又一种输入排队crossbar调度算法iPGQM。仿真结果表明:该调度算法在均匀业务流量下和iSLIP算法的性能基本相同;在突发业务的条件下,iPGQM算法具有更好的抗突发特性;特别在重负载的条件下,与iSLIP算法相比,不仅具有更高的吞吐量,而且平均延迟降低了10%左右。

关 键 词:crossbar  调度算法  输入排队  非均匀业务流  
收稿时间:2009-07-13
修稿时间:2009-08-18

Novel scheduling algorithm in high-speed crossbar and its performance analysis
JIANG Xiao-bo,DU Xiao-wei.Novel scheduling algorithm in high-speed crossbar and its performance analysis[J].journal of Computer Applications,2010,30(1):101-103.
Authors:JIANG Xiao-bo  DU Xiao-wei
Abstract: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 input-queued 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 ...
Keywords:crossbar  scheduling algorithm  input queueing  nonuniform traffic  iSLIP  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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