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

10/25/2018
by   Pieter Stroobant, et al.
0

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.

READ FULL TEXT
research
12/16/2021

DeFT: A Deadlock-Free and Fault-Tolerant Routing Algorithm for 2.5D Chiplet Networks

By interconnecting smaller chiplets through an interposer, 2.5D integrat...
research
02/08/2019

Routing in Networks on Chip with Multiplicative Circulant Topology

The development of multi-core processor systems is a demanded branch of ...
research
02/08/2017

FASHION: Fault-Aware Self-Healing Intelligent On-chip Network

To avoid packet loss and deadlock scenarios that arise due to faults or ...
research
10/02/2021

Optimized Graph Based Routing Algorithm for the Angara Interconnect

JSC NICEVT has developed the Angara high-speed interconnect with 4D toru...
research
05/15/2021

Storage Aware Routing for Generalized Delay Tolerant Networks

This paper presents a novel storage aware routing (STAR) protocol design...
research
08/04/2020

Optimum Reconfiguration of Routing Interconnection Network in APSoC Fabrics

This paper presents an automated algorithm for optimum configuration of ...
research
11/09/2020

Toward Fault-Tolerant Deadlock-Free Routing in HyperSurface-Embedded Controller Networks

HyperSurfaces (HSFs) consist of structurally reconfigurable metasurfaces...

Please sign up or login with your details

Forgot password? Click here to reset