A general, fault tolerant, adaptive, deadlock-free routing protocol for network-on-chip

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.

CitationStroobant, P. [et al.]. A general, fault tolerant, adaptive, deadlock-free routing protocol for network-on-chip. A: International Workshop on Network-on-Chip Architectures. "11th International Workshop on Network on Chip Architectures (NoCArc 2018): Fukuoka, Japan: 20 October 2018". Institute of Electrical and Electronics Engineers (IEEE), 2018, p. 1-6. ISBN 9781538685532. DOI 10.1109/NOCARC.2018.8541212.

URIhttp://hdl.handle.net/2117/340115

DOI10.1109/NOCARC.2018.8541212

ISBN9781538685532

Publisher versionhttps://ieeexplore.ieee.org/document/8541212

Collections

View Usage Statistics

Show full item record

Files	Description	Size	Format	View
8578591.pdf		289,1Kb	PDF	View/Open

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder

UPCommons. Global access to UPC knowledge

A general, fault tolerant, adaptive, deadlock-free routing protocol for network-on-chip

View/Open

Browse