A novel high efficient scheduling algorithm for buffered crossbar switches

With the development of ASIC technology, buffered-crossbar (CICQ) switch is becoming more and more attractive, and many scheduling algorithms have been proposed based on this architecture. However, the existing schemes are either still a little complicated in hardware implementation or low efficient in scheduling performance. In this paper, we propose a simple and high efficient scheduling algorithm called maximum urgency first (MUF). Since the MUF algorithm systematically evaluates the scheduling demands of both the input queues and the crosspoint queues in arbitrations of input scheduling, it not only can sufficiently make use of the output bandwidth, but also can efficiently control the increment of the input queue length. By compressing the queue length of the input queue and the crosspoint queue into the input urgency (IU) and the output urgency (OU), the implementation complexity of the MUF algorithm is largely decreased. Simulation results show that MUF can obtain better stability and delay performance than traditional scheduling schemes presented for CICQ switches.