This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Worst-Case Throughput Bound for Oblivious Routing in Odd Radix Mesh Network
January-June 2013 (vol. 12 no. 1)
pp. 9-12
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.
Index Terms:
network-on-chip,network-on-chip,worst-case throughput bound,oblivious routing,odd radix mesh network,network capacity,odd radix two-dimensional mesh network,U2TURN,traffic load,Routing,Throughput,Algorithm design and analysis,Mesh networks,Computer architecture,Parallel algorithms,Worst-case analysis,On-chip interconnection networks,Routing protocols,Interconnection architectures
Citation:
Guang Sun, Chia-Wei Chang, B. Lin, "A New Worst-Case Throughput Bound for Oblivious Routing in Odd Radix Mesh Network," IEEE Computer Architecture Letters, vol. 12, no. 1, pp. 9-12, Jan.-June 2013, doi:10.1109/L-CA.2012.5
Usage of this product signifies your acceptance of the Terms of Use.