This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Randomized Partially-Minimal Routing on Three-Dimensional Mesh Networks
July-December 2008 (vol. 7 no. 2)
pp. 37-40
Rohit Sunkam Ramanujam, University of California San Diego, La Jolla
Bill Lin, University of California San Diego, La Jolla
This letter presents a new oblivious routing algorithm for 3D mesh networks called Randomized Partially- Minimal (RPM) routing that provably achieves optimal worstcase throughput for 3D meshes when the network radix k is even and within a factor of 1/k2 of optimal when k is odd. Although this optimality result has been achieved with the minimal routing algorithm O1TURN [9] for the 2D case, the worst-case throughput of O1TURN degrades tremendously in higher dimensions. Other existing routing algorithms suffer from either poor worst-case throughput (DOR [10], ROMM [8]) or poor latency (VAL [14]). RPM on the other hand achieves near optimal worst-case and good average-case throughput as well as good latency performance.
Index Terms:
On-chip interconnection networks, Interconnection architectures, Emerging technologies, Network communications, Packet-switching networks
Citation:
Rohit Sunkam Ramanujam, Bill Lin, "Randomized Partially-Minimal Routing on Three-Dimensional Mesh Networks," IEEE Computer Architecture Letters, vol. 7, no. 2, pp. 37-40, July-Dec. 2008, doi:10.1109/L-CA.2008.6
Usage of this product signifies your acceptance of the Terms of Use.