A Multi-thresholds Scheduling Algorithm for Buffered Crossbar Switches
Peng Yi, Hongchao Hu, Binqiang Wang, Yunfei Guo · 2006
Recently, buffered-crossbar (CICQ) switch is becoming more and more attractive, and many scheduling algorithms have been proposed based on this architecture. In this paper, we propose a multi-thresholds scheduling algorithm, shorted by MTS. The MTS algorithm combines the virtue of existing scheduling schemes, LQF-RR and SCBF, and uses a multi-thresholds manner to decrease the requirement of hardware resources. It is proved that the MTS can achieve 100% throughput for any admissible traffic that satisfies the strong law of large numbers (SLLN) with a speedup of 2. In order to facilitate hardware implementation, a simplified MTS scheme is also proposed. The simplified MTS scheme has a time complexity of O(log N), and require fewer hardware resources than existing schemes. Simulation results show that the simplified MTS scheme can obtain good performances