A General, Fault tolerant, Adaptive, Deadlock-free Routing Protocol for Network-on-chip

2018/10/25 by Stroobant, Pieter, Abadal, Sergi, Tavernier, Wouter +3
#FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI)

paper · doi:10.48550/arxiv.1811.11262

Abstract

The paper presents a topology-agnostic greedy protocol for network-on-chip routing. The proposed routing algorithm can tolerate any number of permanent faults, and is proven to be deadlock-free. We introduce a specialized variant of the algorithm, which is optimized for 2D mesh networks, both flat and wireless. The adaptiveness and minimality of several variants this algorithm are analyzed through graph-based simulations.

Related

• DeFT: A Deadlock-Free and Fault-Tolerant Routing Algorithm for 2.5D Chiplet Networks
• Implementation and Analysis of a New Selection Strategy for Adaptive Routing in Networks-on-Chip
• Design of a Near-Ideal Fault-Tolerant Routing Algorithm for Network-on-Chip-Based Multicores
• FASHION: Fault-Aware Self-Healing Intelligent On-chip Network
• Generalized Fault-Tolerance Topology Generation for Application Specific Network-on-Chips