You are here: TUCS > PUBLICATIONS > Publication Search > Analysis of Fault Tolerant Dea...
Analysis of Fault Tolerant Deadlock-free Routing Algorithms for Mesh NoCs
Teijo Lehtonen, Pasi Liljeberg, Juha Plosila, Analysis of Fault Tolerant Deadlock-free Routing Algorithms for Mesh NoCs. In: 3rd Workshop on Diagnostic Services in Network-on-Chips, DSNOC '09, 54–57, 2009.
Abstract:
Fault tolerant routing algorithms are a way to increase the reliability of networks-on-chip. Algorithms providing deadlock-freedom are preferable due to the overheads that handling deadlocks require. The paper presents a fully adaptive routing algorithm targeted for providing maximal fault tolerance. The algorithm is combined with turn models to create total of four fault tolerant deadlock-free routing algorithms. The presented algorithms are compared in their fault tolerance properties. The results indicate that all the presented algorithms increase the fault tolerance remarkably as compared to traditional xy routing algorithm. From the turn models, the north-last turn model provides the best results.
Files:
Full publication in PDF-format
BibTeX entry:
@INPROCEEDINGS{inpLeLiPl09a,
title = {Analysis of Fault Tolerant Deadlock-free Routing Algorithms for Mesh NoCs},
booktitle = {3rd Workshop on Diagnostic Services in Network-on-Chips, DSNOC '09},
author = {Lehtonen, Teijo and Liljeberg, Pasi and Plosila, Juha},
pages = {54–57},
year = {2009},
}
Belongs to TUCS Research Unit(s): Distributed Systems Laboratory (DS Lab)