MAFA: Adaptive Fault-Tolerant Routing Algorithm for Networks-on-Chip

2012 ◽  
Author(s):  
Masoumeh Ebrahimi ◽  
Masoud Daneshtalab ◽  
Juha Plosila ◽  
Hannu Tenhunen
Keyword(s):  
Fault Tolerant ◽  
Routing Algorithm ◽  
Networks On Chip ◽  
On Chip

A New Fault Tolerant Routing Algorithm for Networks on Chip

2019 ◽  
Vol 10 (3) ◽  
pp. 68-85
Author(s):  
Chakib Nehnouh ◽  
Mohamed Senouci
Keyword(s):  
Network Architecture ◽  
Fault Tolerant ◽  
Routing Algorithm ◽  
Transient Faults ◽  
Networks On Chip ◽  
Congestion Detection ◽  
Novel Approach ◽  
On Chip ◽  
Detection Mechanisms ◽  
Correct Data

To provide correct data transmission and to handle the communication requirements, the routing algorithm should find a new path to steer packets from the source to the destination in a faulty network. Many solutions have been proposed to overcome faults in network-on-chips (NoCs). This article introduces a new fault-tolerant routing algorithm, to tolerate permanent and transient faults in NoCs. This solution called DINRA can satisfy simultaneously congestion avoidance and fault tolerance. In this work, a novel approach inspired by Catnap is proposed for NoCs using local and global congestion detection mechanisms with a hierarchical sub-network architecture. The evaluation (on reliability, latency and throughput) shows the effectiveness of this approach to improve the NoC performances compared to state of art. In addition, with the test module and fault register integrated in the basic architecture, the routers are able to detect faults dynamically and re-route packets to fault-free and congestion-free zones.

Double Stairs: A Fault-Tolerant Routing Algorithm for Networks-on-Chip

2016 ◽  
Vol 25 (06) ◽  
pp. 1650065 ◽  
Author(s):  
Saleh Fakhrali ◽  
Hamid R. Zarandi
Keyword(s):  
Fault Tolerance ◽  
Fault Tolerant ◽  
Routing Algorithm ◽  
Deep Submicron ◽  
Routing Algorithms ◽  
Experimental Results ◽  
Trade Off ◽  
Networks On Chip ◽  
On Chip ◽  
Probabilistic Flooding

Reliability is one of the main concerns in the design of networks-on-chip (NoCs) due to the use of deep submicron technologies in fabrication of such products. This paper presents a new fault-tolerant routing algorithm called double stairs for NoCs. Double stairs routing algorithm is a low overhead routing that has the ability to deal with fault. The proposed routing algorithm makes a redundant copy of each packet at the source node and routes the original and redundant packets in a new partially adaptive routing algorithm. The method is evaluated for various packet injection rates and fault rates. Experimental results show that the proposed routing algorithm offers the best trade-off between performance and fault tolerance compared to other routing algorithms, namely flooding, XYX and probabilistic flooding.

scholarly journals Low cost fault-tolerant routing algorithm for Networks-on-Chip

2015 ◽  
Vol 39 (6) ◽  
pp. 358-372 ◽  
Author(s):  
Junxiu Liu ◽  
Jim Harkin ◽  
Yuhua Li ◽  
Liam Maguire
Keyword(s):  
Fault Tolerant ◽  
Low Cost ◽  
Routing Algorithm ◽  
Networks On Chip ◽  
On Chip

FXY: A HIERARCHICAL ROUTING ALGORITHM TO BALANCE PERFORMANCE AND FAULT TOLERANCE IN NETWORKS-ON-CHIP

2014 ◽  
Vol 23 (10) ◽  
pp. 1450146 ◽  
Author(s):  
SALEH FAKHRALI ◽  
HAMID R. ZARANDI
Keyword(s):  
Fault Tolerance ◽  
Fault Tolerant ◽  
Routing Algorithm ◽  
Experimental Results ◽  
Balance Performance ◽  
Networks On Chip ◽  
Large Size ◽  
Trade Offs ◽  
And Performance ◽  
On Chip

This paper presents a hierarchical fault-tolerant routing algorithm called FXY, which is a hybrid method based on flooding and XY, and can balance performance and fault tolerance based on a predefined parameter m. First, FXY partitions the whole network into different equal size square submeshes with the size of m × m. At the first level of the hierarchy, packet routing within these submeshes is performed based on flooding routing algorithm. When the packets are received at effective boundary of each submesh, XY routing is performed to route the packet inter submeshes i.e., from one submesh to the neighbor submesh which is certainly one of its neighbor nodes. Here, the size of the submesh is defined as fault-tolerant granularity. As fault-tolerant granularity is increased, the size of the submeshes will be increased, therefore the method mainly floods packets in large-size submeshes and finally packets are received at their destinations correctly. On the other hand, when fault-tolerant granularity is decreased, the method mainly routes packets as XY method, which is not fault-tolerant, but has the best performance. The method is evaluated for various packet injection rates and fault rates. The experimental results reveal that the method presents a fault-tolerant routing algorithm, and can be adjusted so that it shows better fault-tolerance and performance trade-offs compared to XY and flooding which are two end-to-end cases of having the best performance and no fault-tolerance, having the least performance and the best fault tolerance, respectively. The experimental results for an 8 × 8 NoC size, have shown that 2-FXY, which is the proposed method with fault-tolerant granularity of two, offers the best trade-off between performance and fault tolerance compared to other methods, XY, flooding and probabilistic flooding.

Sign in / Sign up

Export Citation Format

Share Document