高速crossbar调度中的队列均衡及其仿真研究

Mechanism for Queues’ Length Balancing and Its Simulation Study in High-speed Crossbars Scheduling

提出一种简单、有效、硬件易实现的队列长度均衡策略,能够明显改善高速crossbar调度算法在非均匀业务流下的吞吐量和时延等性能。以典型的高速crossbar调度算法iSLIP[1]为例,在各种非均匀业务流下对该均衡策略进行了仿真研究,结果表明:使用该均衡策略后,iSLIP吞吐量能够最多可以提高20%以上,并且时延性能得到大大改善。对于其它高速crossbar调度算法,该均衡策略具有类似的性能改善效果。

A novel mechanism was proposed, that is simple, efficient and easy to implement by the hardware for queues＇ length balancing in high-speed crossbars scheduling. Scheduling algorithms can obviously improve throughput and decrease delay under the nonuniform traffics by using this mechanism. A number of simulation practices about this mechanism under some kinds of nonuniform traffics were given based on the typical scheduling algorithm iSLIP. The results show that the throughput of/SLIP can be increased more than 20% at most, and the performance of delay is improved finely. There are the same results for other high-speed crossbar scheduling algorithms with this mechanism.