A novel reliable routing algorithm for network on chips

Aliabadi, Maryam Raiyat; Khademzadeh, Ahmad; Raiyat, A.M.

doi:10.1109/ieem.2008.4738095

Cited by 3 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There have been some fault tolerant dynamic algorithms besides the random walk or flooding based fault tolerant algorithms [12][13][14][15][16][17]. These algorithms can effectively address permanent faults, however, a common problem is when permanent fault occurs, the algorithm has to recalculate the routing path which needs obtain global information, then the spent time will increase with the scale of network, which may cause network congestion or even paralysis.…”

Section: Network Monitormentioning

confidence: 99%

Fault-tolerant schemes for NoC with a network monitor

Zhang

et al. 2010

2010 10th International Symposium on Communications and Information Technologies

View full text Add to dashboard Cite

Global buses in deep-submicron (DSM) system-onchip designs consume significant amounts of power, have large propagation delays, and are easy to catch transmission errors due to DSM noise. A comprehensive fault-tolerant mechanism for transient and permanent failures is proposed in this paper. Based on the special NoC with a network monitor, a flit level point-to-point error detection scheme is added to routers to handle transient failures on the data links, while a dynamic routing mechanism is produced to deal with permanent link failures as well. In addition, there is some Build-in testing of the monitor to increase the reliability of the architecture. The result of the experiment demonstrates the advantage of the mechanism in terms of throughput and latency, while the consumptions of area and power overheads are acceptable.I.

show abstract

Section: Network Monitormentioning

confidence: 99%

Fault-tolerant schemes for NoC with a network monitor

Zhang

et al. 2010

2010 10th International Symposium on Communications and Information Technologies

View full text Add to dashboard Cite

show abstract

“…West-First Routing Algorithm [2], Neighbors-on-Path [3], DyAD [4] and DyXY [5] are the approaches of the dynamic routing algorithm. Other approaches were proposed for specific applications [6] or for reliable issues [7]. In this paper, we will propose an adaptive congestionaware routing algorithm on the mesh topology.…”

Section: Introductionmentioning

confidence: 99%

An adaptive congestion-aware routing algorithm for mesh network-on-chip platform

Huang

Hwang

2009

2009 IEEE International SOC Conference (SOCC)

View full text Add to dashboard Cite

In this paper, an adaptive congestion-aware routing algorithm is proposed for mesh network-onchip (NoC) platforms. Depending on the traffic around the routed node, the proposed routing algorithm provides not only minimum paths but also non-minimum paths for routing packets. Both minimum and non-minimum paths are based on the odd-even turn model to avoid deadlock and livelock problems. The decision of the minimum paths or non-minimum paths depends on the utilities of buffers in neighbor nodes and the specific switching value. In this adaptive algorithm, the congestion conditions and distributed hotspots will be avoided. It has the advantages of getting higher performance and also reducing the latency. From the simulation results, it shows that the adaptive congestion-aware routing algorithm is superior to other algorithms for the mesh NoC platforms.

show abstract

“…In flooding-based routing, such as directed flooding [6] and redundant random walk [7] , several copies of the same packet are sent on the network links. This technique increases network load and may create congestion, which leads to instability of the network and increase of power dissipation.…”

Section: Introductionmentioning

confidence: 99%

Fault-tolerant routing algorithm for network-on-chip based on dynamic XY routing

Cao

Wang

et al. 2009

Wuhan Univ. J. Nat. Sci.

View full text Add to dashboard Cite

In order to ensure the reliability of network-on-chip (NoC) under faulty circumstance, a dynamic fault tolerant routing algorithm is proposed. This algorithm can implement detour routing when there are both static and dynamic permanent faults in the network. That means the packet is able to move around the faults to the destination with a non-minimum path. In addition, the multilevel congestion control mechanism gives the algorithm the ability to distribute the load over the whole network and to avoid hotspots around the faults. Simulation results demonstrate the advantage of the proposed routing algorithm in terms of average packet latency and packet loss rate compared with negative-first routing algorithm and DyAD routing algorithm in the presence of permanent faults. For the proposed algorithm, it can get much less average packet latency and lead to less than 20% packet loss rate.

show abstract

A novel reliable routing algorithm for network on chips

Cited by 3 publications

References 16 publications

Fault-tolerant schemes for NoC with a network monitor

Fault-tolerant schemes for NoC with a network monitor

An adaptive congestion-aware routing algorithm for mesh network-on-chip platform

Fault-tolerant routing algorithm for network-on-chip based on dynamic XY routing

Contact Info

Product

Resources

About