Path-Based, Randomized, Oblivious, Minimal Routing
Name
6D4F2A34d01.pdf
Size
649.14 KB
Format
Adobe PDF
Checksum (MD5)
a8038388920b6b8ddf784154220a143d
Author(s)
Cho, Myong Hyon
Lis, Mieszko
Shim, Keun Sup
Kinsy, Michel A.
Devadas, Srinivas
Date Issued
2009
Journal
Proceedings of the 2nd International Workshop on Network on Chip Architectures
Publisher
Association for Computing Machinery
Citation
Cho, Myong Hyon et al. “Path-based, randomized, oblivious, minimal routing.” Proceedings of the 2nd International Workshop on Network on Chip Architectures. New York, New York: ACM, 2009. 23-28.
Version
Author's final manuscript
Abstract
Path-based, Randomized, Oblivious, Minimal routing (PROM) is a family of oblivious, minimal, path-diverse routing algorithms especially suitable for Network-on-Chip applications with n x n mesh geometry. Rather than choosing among all possible paths at the source node, PROM algorithms achieve the same effect progressively through efficient, local randomized decisions at each hop. Routing is deadlock-free in all PROM algorithms when the routers have at least two virtual channels.
While the approach we present can be viewed as a generalization of both ROMM and O1TURN routing, it combines the low-hardware cost of O1TURN with the routing diversity offered by the most complex n-phase ROMM schemes. As all PROM algorithms employ the same hardware, a wide range of routing behaviors, from O1TURN-equivalent to uniformly path-diverse, can be effected by adjusting just one parameter, even while the network is live and continues to forward packets. Detailed simulation on a set of benchmarks indicates that, on equivalent hardware, the performance of PROM algorithms compares favorably to existing oblivious routing algorithms, including dimension-ordered routing, two-phase ROMM, and O1TURN.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Attribution-Noncommercial-Share Alike 3.0 Unported
Persistent DSpace Link
DOI of Published Version
http://doi.acm.org/10.1145/1645213.1645220
