This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Weighted Random Routing on Torus Networks
January-June 2009 (vol. 8 no. 1)
pp. 1-4
Rohit Sunkam Ramanujam, University of California San Diego, La Jolla
Bill Lin, University of California San Diego, La Jolla
In this paper, we introduce a new closed-form oblivious routing algorithm called W2TURN that is worst-case throughput optimal for 2D-torus networks. W2TURN is based on a weighted random selection of paths that contain at most two turns. In terms of average hop count, W2TURN outperforms the best previously known closed-form worst-case throughput optimal routing algorithm called IVAL. In addition, we present a new optimal weighted random routing algorithm for rings called WRD.
Index Terms:
On-chip interconnection networks, Data communications, Torus Network, Oblivious Routing
Citation:
Rohit Sunkam Ramanujam, Bill Lin, "Weighted Random Routing on Torus Networks," IEEE Computer Architecture Letters, vol. 8, no. 1, pp. 1-4, Jan.-June 2009, doi:10.1109/L-CA.2008.14
Usage of this product signifies your acceptance of the Terms of Use.