A General, Fault tolerant, Adaptive, Deadlock-free Routing Protocol for Network-on-chip
classification
💻 cs.NI
keywords
algorithmroutingdeadlock-freenetwork-on-chipprotocoladaptiveadaptivenessanalyzed
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.