FADyAD- Fault and congestion aware routing algorithm based on DyAD algorithm
Amin Mehranzadeh, Ahmad Khademzadeh, Armin Mehran · 2010
The performance of Network-on-Chip (NoC) largely depends on the underlying routing techniques. In this paper we present and evaluate a fault and congestion aware routing scheme called FADyAD which combines the advantages of both deterministic and adaptive routing schemes. On the other hand, the routers switching between deterministic and adaptive routing based on the network's congestion conditions. The simulation results show the effectiveness of FADyAD by comparing it with deterministic and adaptive routing schemes under different traffic patterns. Simulation results depict that the proposed routing algorithm is able to route packet even in the case of faulty links or switches in the NoC. Moreover, Simulation results demonstrate the advantage of FADyAD routing algorithm in terms of average packet latency, packet loss rate compared with XY, OE 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 average 15% packet loss rate. Simulation results show that our algorithm in terms of average energy consumption provides less energy consumption compared to the Fault-Aware Dynamic Routing (FADR) and recently reported fault tolerant flooding routing algorithms. Moreover, a prototype router based on the FADyAD idea has been designed and evaluated. The overhead of implementing FADyAD is negligible, while the performance is consistently better.