A General, Fault tolerant, Adaptive, Deadlock-free Routing Protocol for Network-on-chip
Lists
Only you see this
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.
BibTeX
@inproceedings{stroobant2018general,
author = {Pieter Stroobant and Sergi Abadal and Wouter Tavernier and Eduard Alarcón and Didier Colle and Mario Pickavet},
title = {{A General, Fault tolerant, Adaptive, Deadlock-free Routing Protocol for Network-on-chip}},
booktitle = {NoCArc@MICRO},
year = {2018},
url = {https://openreview.net/forum?id=6rN040bSIz},
}Loading related content...