基于螺旋線的Round-Robin Crossbar調(diào)度算法
A R-R crossbar scheduling algorithm based on spirality
-
摘要: 該文提出了一種基于螺旋線的 Round-Robin(R-R)crossbar調(diào)度算法,在調(diào)度級(jí)和迭代級(jí)分別輪詢R-R指針,避免了指針同步;在輸入端口輪詢和迭代匹配的二維過程,執(zhí)行流水線操作。當(dāng)端口數(shù)32時(shí),執(zhí)行效率高,帶寬利用率高,邏輯簡單,容易實(shí)現(xiàn)。通過對(duì)R-R加權(quán),可以保證Non-uniformtraffic高吞吐量。Abstract: 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.
-
計(jì)量
- 文章訪問數(shù): 2210
- HTML全文瀏覽量: 92
- PDF下載量: 948
- 被引次數(shù): 0
下載:
