一种基于输入缓冲交叉开关的调度算法

A Scheduling Algorithm for Input-queued Crossbar

研究了交叉(Crossbar)开关的架构和缓冲策略。在已有的循环优先级多次匹配(RRM)算法和指针滑动多次迭代循环优先级匹配(iSLIP)算法的基础上提出了一种基于优先级列表的轮询调度(PB-RRM2)算法,该算法每次迭代只需要2步,减少了算法的调度时间,提高了Crossbar开关的运行速度。同时采用优先级列表的轮询(Round Robin)指针修改方式消除了指针的同步,提高了吞吐量。理论分析和仿真试验表明,算法在吞吐量和平均信元时延方面与iSLIP算法相当。

In this paper the structure and buffer strategy about Crossbar switching is first studied.Then based on RRM and iSLIP algorithm,we put forward a new scheduling algorithm with priority list for Input-queued Crossbar.The algorithm only needs two steps during every cell timeslot,reduces the scheduling time and improves the speed of switch.On the other hand,the algorithm takes advantage of the priority list to eliminate the synchronization of Round Robin pointer and improve the throughput of switch.Simulation and theoretical analysis show that the throughput and mean cell delay of PB-RRM2 is same as to the current algorithm such as iSLIP etc.