A R-R crossbar scheduling algorithm based on spirality
基于螺旋线的Round-Robin Crossbar调度算法

In this paper, the Round-Robin crossbar scheduling algorithm based on spirality is proposed. It addresses the R-R pointers in scheduling and iteration, respectively, to avoid the synchronic of pointers. And it pipelines the polling of input ports and the steps of iteration in 2 dimensional. When the number of ports is less than 32, it has simple logic and performs better. In addition, by weighting the R-R, it can provide high throughput for non-uniform traffic.