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

October 25, 2018 Β· Declared Dead Β· πŸ› Network on Chip Architectures

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Pieter Stroobant, Sergi Abadal, Wouter Tavernier, Eduard AlarcΓ³n, Didier Colle, Mario Pickavet arXiv ID 1811.11262 Category cs.NI: Networking & Internet Citations 7 Venue Network on Chip Architectures Last Checked 4 months ago
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Networking & Internet

Died the same way β€” πŸ‘» Ghosted