Simple Oblivious Routing Method to Balance Load in Network-on-Chip

The Network-on-Chip (NoC) systems have emerged in on-chip communication architecture in various fields. To achieve excellent results in Network on Chip (NoC) systems application, the routing must eliminate the deadlock issues from the network. To overcome this issue in the network, in this paper, we propose Deadlock Free Load Balanced Adaptive Routing. In this approach, Oblivious Routing (OR) algorithm is implemented on the channel by using the probability function. The network considers the capacity of the node and tries to maximize the throughput based on the connectivity between the data packets flow and minimize the channel load. A Reconfiguration Protocol is used for the data packets to choose other channel in the network if the deadlock occurs. Simulation results show that this approach reduces the delay and packet loss in the network.

Download Full-text

Low-Cost Adaptive and Fault-Tolerant Routing Method for 2D Network-on-Chip

IEICE Transactions on Information and Systems ◽

10.1587/transinf.2016edl8208 ◽

2017 ◽

Vol E100.D (4) ◽

pp. 910-913

Author(s):

Ruilian XIE ◽

Jueping CAI ◽

Xin XIN ◽

Bo YANG

Keyword(s):

Fault Tolerant ◽

Low Cost ◽

Network On Chip ◽

Routing Method ◽

On Chip ◽

2D Network

Download Full-text

Erratum to Planar adaptive network-on-chip supporting deadlock-free and efficient tree-based multicast routing method Microprocessors and Microsystems (2012) 449–461

Microprocessors and Microsystems ◽

10.1016/j.micpro.2012.07.001 ◽

2012 ◽

Vol 36 (6) ◽

pp. 527

Author(s):

Faizal Arya Samman ◽

Thomas Hollstein ◽

Manfred Glesner

Keyword(s):

Multicast Routing ◽

Network On Chip ◽

Adaptive Network ◽

Routing Method ◽

On Chip

Download Full-text

DyXY - a proximity congestion-aware deadlock-free dynamic routing method for network on chip

2006 43rd ACM/IEEE Design Automation Conference ◽

10.1109/dac.2006.229242 ◽

2006 ◽

Cited By ~ 10

Author(s):

Ming Li ◽

Qing-An Zeng ◽

Wen-Ben Jone

Keyword(s):

Dynamic Routing ◽

Network On Chip ◽

Routing Method ◽

On Chip ◽

Free Dynamic ◽

Congestion Aware

Download Full-text

Planar adaptive network-on-chip supporting deadlock-free and efficient tree-based multicast routing method

Microprocessors and Microsystems ◽

10.1016/j.micpro.2012.04.003 ◽

2012 ◽

Vol 36 (6) ◽

pp. 449-461 ◽

Cited By ~ 9

Author(s):

Faizal Arya Samman ◽

Thomas Hollstein ◽

Manfred Glesner

Keyword(s):

Multicast Routing ◽

Network On Chip ◽

Adaptive Network ◽

Routing Method ◽

On Chip

Download Full-text

AFRM: Adaptive and Fault-Tolerant Routing Method for 2D Network-on-Chip

Journal of Circuits System and Computers ◽

10.1142/s0218126617502000 ◽

2017 ◽

Vol 26 (12) ◽

pp. 1750200 ◽

Cited By ~ 1

Author(s):

Ruilian Xie ◽

Jueping Cai ◽

Peng Wang ◽

Xin Zhang ◽

Juan Wang

Keyword(s):

Fault Tolerant ◽

State Of The Art ◽

High Reliability ◽

Network Simulation ◽

Network On Chip ◽

Virtual Channels ◽

Routing Method ◽

Simulation Results ◽

On Chip ◽

2D Network

High reliability against undesirable effects is one of the key objectives in the design for Network-on-Chip (NoC). As a result, designing reliable and efficient routing method is highly desirable. This paper presents a novel turn model called NMad-y using one and two virtual channels along the [Formula: see text]- and [Formula: see text]-dimensions, respectively, and Adaptive and Fault-tolerant Routing Method (AFRM) which is designed based on the NMad-y turn model. AFRM can effectively tolerate multiple faulty routers and links in more complicated faulty situations by the link status of neighbor routers within two hops. AFRM is able to impose the reliability of network without losing the performance of network. Simulation results show that AFRM achieves better saturation throughput (0.83% on average) than a state-of-the-art fault-tolerant routing method and maintains high reliability of more than 97.43% on average.

Download Full-text