A New Worst-Case Throughput Bound for Oblivious Routing in Odd Radix Mesh Network
IEEE Computer Architecture Letters（2013）
摘要
1/2 network capacity is often believed to be the limit of worst-case throughput for mesh networks. However, this letter provides a new worst-case throughput bound, which is higher than 1/2 network capacity, for odd radix two-dimensional mesh networks. In addition, we propose a routing algorithm called U2TURN that can achieve this worst-case throughput bound. U2TURN considers all routing paths with at most 2 turns and distributes the traffic loads uniformly in both X and Y dimensions. Theoretical analysis and simulation results show that U2TURN outperforms existing routing algorithms in worst-case throughput. Moreover, U2TURN achieves good average-throughput at the expense of approximately 1.5x minimal average hop count.
更多查看译文
关键词
traffic load,network capacity,worst-case throughput,new worst-case throughput bound,odd radix two-dimensional mesh,on-chip interconnection networks,good latency performance,routing algorithm,mesh network,u2turn,y dimension,routing protocols,good average-throughput,odd radix mesh network,new optimal worst-case throughput,routing path,oblivious routing,odd radix two-dimensional mesh network,worst-case analysis,interconnection architectures,network-on-chip,worst-case throughput bound,network on chip
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要