A4 Vertaisarvioitu artikkeli konferenssijulkaisussa
Fault Tolerant Distributed Routing Algorithms for Mesh Networks-on-Chip
Tekijät: Lehtonen T, Liljeberg P, Plosila J
Konferenssin vakiintunut nimi: International Symposium on Signals, Circuits and Systems
Julkaisuvuosi: 2009
Kokoomateoksen nimi: 9th International Symposium on Signals, Circuits and Systems, ISSCS 2009
Tietokannassa oleva lehden nimi: ISSCS 2009: INTERNATIONAL SYMPOSIUM ON SIGNALS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS,
Vuosikerta: 1
Aloitussivu: 149
Lopetussivu: 152
Sivujen määrä: 2
ISBN: 978-1-4244-3784-9
DOI: https://doi.org/10.1109/ISSCS.2009.5206180
Tiivistelmä
The reliability of networks-on-chip can be increased by developing routing algorithms that provide fault tolerance. Distributed routing algorithms are a class of algorithms where the routing decisions are made without knowledge of the global state of the network. The paper presents a distributed routing algorithm, which targets to maximal fault tolerance. Total of 11 different algorithms are analyzed in their fault tolerance and average hop count using a dedicated in-house C++ simulator. Five of the algorithms are variations of the proposed algorithm and the rest are references or algorithms presented in literature. The developed fully adaptive algorithm is shown to provide superior fault tolerance. The best deadlock-free algorithm is the variation based on the north-last turn model. In the class of minimal algorithms the dynamic xy algorithm provides the highest fault tolerance.
The reliability of networks-on-chip can be increased by developing routing algorithms that provide fault tolerance. Distributed routing algorithms are a class of algorithms where the routing decisions are made without knowledge of the global state of the network. The paper presents a distributed routing algorithm, which targets to maximal fault tolerance. Total of 11 different algorithms are analyzed in their fault tolerance and average hop count using a dedicated in-house C++ simulator. Five of the algorithms are variations of the proposed algorithm and the rest are references or algorithms presented in literature. The developed fully adaptive algorithm is shown to provide superior fault tolerance. The best deadlock-free algorithm is the variation based on the north-last turn model. In the class of minimal algorithms the dynamic xy algorithm provides the highest fault tolerance.
Turun yliopiston Tutkimustietojärjestelmän portaali