DocumentCode :
1239875
Title :
Randomized Partially-Minimal Routing on Three-Dimensional Mesh Networks
Author :
Ramanujam, Rohit Sunkam ; Lin, Bill
Author_Institution :
University of California San Diego, La Jolla
Volume :
7
Issue :
2
fYear :
2008
Firstpage :
37
Lastpage :
40
Abstract :
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.
Keywords :
Emerging technologies; Interconnection architectures; Network communications; On-chip interconnection networks; Packet-switching networks;
fLanguage :
English
Journal_Title :
Computer Architecture Letters
Publisher :
ieee
ISSN :
1556-6056
Type :
jour
DOI :
10.1109/L-CA.2008.6
Filename :
4537167
Link To Document :
بازگشت