Issue No. 02 - July-December (2008 vol. 7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/L-CA.2008.6
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  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 , ROMM ) or poor latency (VAL ). RPM on the other hand achieves near optimal worst-case and good average-case throughput as well as good latency performance.
On-chip interconnection networks, Interconnection architectures, Emerging technologies, Network communications, Packet-switching networks
B. Lin and R. Sunkam Ramanujam, "Randomized Partially-Minimal Routing on Three-Dimensional Mesh Networks," in IEEE Computer Architecture Letters, vol. 7, no. , pp. 37-40, 2008.