Comparison Research between XY and Odd-Even Routing Algorithm of a 2-Dimension 3X3 Mesh Topology Network-on-Chip

Authors:
Wang Zhang;Ligang Hou;Jinhui Wang;Shuqin Geng;Wuchen Wu
Affiliations:
-;-;-;-;-
Venue:
GCIS '09 Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03
Year:
2009

Citing 0
Cited 1

A shortest path adaptive routing technique for minimizing path collisions in hybrid optical network-on-chip

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Network-on-Chip (NoC) has been recognized as a paradigm to solve System-on-Chip (SoC) design challenges. The routing algorithm is one of key researches of a NoC design. XY routing algorithm, which is a kind of distributed deterministic routing algorithms, is simple to be implemented. Odd-Even (OE) routing algorithm, whose implementation is complex, is a sort of distributed adaptive routing algorithms with deadlock-free ability. We demonstrate the two routing algorithms in details at first. XY routing algorithm and OE routing algorithm are then simulated and compared based on a 3X3 mesh topology NoC with NIRGAM simulator. The simulation results show that OE routing algorithm, whose P parameter equals to 1.09, increases P parameter greatly as compared to XY routing algorithm, whose P parameter equals to 0.86, in a 2-dimension 3X3 mesh topology NoC, with Constant Bit Rate (CBR) traffic condition of each tail.