Issue No.01 - January-June (2009 vol.8)
Rohit Sunkam Ramanujam , University of California San Diego, La Jolla
Bill Lin , University of California San Diego, La Jolla
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/L-CA.2008.14
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.
On-chip interconnection networks, Data communications, Torus Network, Oblivious Routing
Rohit Sunkam Ramanujam, Bill Lin, "Weighted Random Routing on Torus Networks", IEEE Computer Architecture Letters, vol.8, no. 1, pp. 1-4, January-June 2009, doi:10.1109/L-CA.2008.14