一种支持多优先级的高速Crossbar调度算法  

A New Scheduling Algorithm Supporting Multi-Priorities for High-Speed Crossbars

作　　者：彭来献[1] 田畅[1] 路欣[1] 郑少仁[1] 

机构地区：[1]解放军理工大学通信工程学院,江苏南京210007

出　　处：《电子学报》2004年第8期1305-1309,共5页Acta Electronica Sinica

基　　金：国家"8 63"计划资助课题 (No.2 0 0 1AA1 2 1 0 63)

摘　　要：现有支持多优先级的高速Crossbar调度算法需要交互的控制信息较多 ,控制信息的传输时间已成为调度算法性能提高的主要瓶颈 .为提高Crossbar调度的性能 ,本文提出一种新的支持多优先级的高速Crossbar调度算法p iDRR ,该算法具有硬件实现简单、控制信息量少、高速和可扩展性强等优点 .仿真结果表明 ,p iDRR具有良好的吞吐量、时延性能 ,适用于高速、多端口、大容量的路由器 .Current scheduling algorithms with multi-priorities need to exchange a large amount of control messages whose transmission time has become the bottleneck for performance improvement of scheduling algorithms.To improve scheduling performance,we propose a new high-speed crossbar scheduling algorithm p-iDRR which supports multi-priorities.p-iDRR has many good features,such as being easy to implement,fewer control messages,high-speed and scalability.The results of simulation show that p-iDRR can achieve fine performance of throughput and delay and that p-iDRR is suitable to high-speed routers that have high-density ports and large capacity.

关 键 词：高速路由器 输入排队 多优先级调度算法 p-iDRR CROSSBAR 

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