|
ABSTRACT
Deflection routing is being proposed for networks on chips since it is simple and adaptive. A deflection switch can be much smaller and faster than a wormhole or virtual cut-through switch. A deflection-routed network has three orthogonal characteristics: topology, routing algorithm and deflection policy. In this paper we evaluate deflection networks with different topologies such as mesh, torus and Manhattan Street Network, different routing algorithms such as random, dimension XY, delta XY and minimum deflection, as well as different deflection policies such as non-priority, weighted priority and straight-through policies. Our results suggest that the performance of a deflection network is more sensitive to its topology than the other two parameters. It is less sensitive to its routing algorithm, but a routing algorithm should be minimal. A priority-based deflection policy that uses global and history-related criterion can achieve both better average-case and worst-case performance than a non-priority or priority policy that uses local and stateless criterion. These findings are important since they can guide designers to make right decisions on the deflection network architecture, for instance, selecting a routing algorithm or deflection policy which has potentially low cost and high speed for hardware implementation.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
P. Baran. On distributed computing networks. IEEE Transactions on Communication Systems, March 1964.
|
| |
2
|
|
| |
3
|
|
 |
4
|
|
| |
5
|
|
| |
6
|
A. G. Greenberg and J. Goodman. Sharp approximate models of deflection routing in mesh networks. IEEE Transactions on Communications, 41(1), January 1993.
|
| |
7
|
W. D. Hills. The Connection machine. Scientific American, 256(6), June 1987.
|
| |
8
|
K. Keutzer, S. Malik, A. R. Newton, J. M. Rabaey, and A. Sangiovanni-Vincentelli. System-level design: Orthogonalization of concerns and platform-based design. IEEE Transaction on Computer-Aided Design of Integrated Circuits, 19(12):1523--1543, December 2000.
|
| |
9
|
|
| |
10
|
|
 |
11
|
|
| |
12
|
Dinesh Pamunuwa , Johnny Öberg , Li-Rong Zheng , Mikael Millberg , Axel Jantsch , Hannu Tenhunen, A study on the implementation of 2-D mesh-based networks-on-chip in the nanometre regime, Integration, the VLSI Journal, v.38 n.1, p.3-17, October 2004
[doi> 10.1016/j.vlsi.2004.03.005]
|
| |
13
|
|
|