摘要
该文提出了一种基于螺旋线的 Round-Robin(R-R)crossbar调度算法,在调度级和迭代级分别轮询R-R指针,避免了指针同步;在输入端口轮询和迭代匹配的二维过程,执行流水线操作。当端口数<32时,执行效率高,带宽利用率高,逻辑简单,容易实现。通过对R-R加权,可以保证Non-uniformtraffic高吞吐量。
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.
出处
《电子与信息学报》
EI
CSCD
北大核心
2003年第6期816-823,共8页
Journal of Electronics & Information Technology
基金
863项目(863-317-9601-02)
Intel IXA大学计划资助