Path-based, randomized, oblivious, minimal routing

Authors:
Myong Hyon Cho;Mieszko Lis;Keun Sup Shim;Michel Kinsy;Srinivas Devadas
Affiliations:
Massachusetts Institute of Technology, Cambridge, MA;Massachusetts Institute of Technology, Cambridge, MA;Massachusetts Institute of Technology, Cambridge, MA;Massachusetts Institute of Technology, Cambridge, MA;Massachusetts Institute of Technology, Cambridge, MA
Venue:
Proceedings of the 2nd International Workshop on Network on Chip Architectures
Year:
2009

Citing 15
Cited 3

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
The turn model for adaptive routing

Journal of the ACM (JACM)
ROMM routing on mesh and torus networks

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
The Odd-Even Turn Model for Adaptive Routing

IEEE Transactions on Parallel and Distributed Systems
Worst-case traffic for oblivious routing functions

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels

IEEE Transactions on Parallel and Distributed Systems
ROMM Routing: A Class of Efficient Minimal Routing Algorithms

PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
Throughput-centric routing algorithm design

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Universal schemes for parallel communication

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
GOAL: a load-balanced adaptive routing algorithm for torus networks

Proceedings of the 30th annual international symposium on Computer architecture
Principles and Practices of Interconnection Networks

Principles and Practices of Interconnection Networks
A low latency router supporting adaptivity for on-chip interconnects

Proceedings of the 42nd annual Design Automation Conference
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks

Proceedings of the 32nd annual international symposium on Computer Architecture
Globally Adaptive Load-Balanced Routing on Tori

IEEE Computer Architecture Letters
Static virtual channel allocation in oblivious routing

NOCS '09 Proceedings of the 2009 3rd ACM/IEEE International Symposium on Networks-on-Chip

ERA: an efficient routing algorithm for power, throughput and latency in network-on-chips

NPC'10 Proceedings of the 2010 IFIP international conference on Network and parallel computing
BOFAR: buffer occupancy factor based adaptive router for mesh NoCs

Proceedings of the 4th International Workshop on Network on Chip Architectures
TRACKER: a low overhead adaptive NoC router with load balancing selection strategy

Proceedings of the International Conference on Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

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.