2014 IEEE 32nd International Conference on Computer Design (ICCD) 2014
DOI: 10.1109/iccd.2014.6974715
|View full text |Cite
|
Sign up to set email alerts
|

Hermes: Architecting a top-performing fault-tolerant routing algorithm for Networks-on-Chips

Abstract: Networks-on-Chips (NoCs) are experiencing escalating susceptibility to wear-out and reduced reliability, with the risk of becoming the key point of failure in an entire multicore chip. Aiming towards seamless NoC operation in the presence of faulty communication links, in this paper we propose Hermes, a highly-robust, distributed and lightweight fault-tolerant routing algorithm, whose performance degrades gracefully with increasing faulty link counts. Hermes is a deadlockfree hybrid routing algorithm, utilizin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(10 citation statements)
references
References 30 publications
0
10
0
Order By: Relevance
“…However, rerouting may introduce deadlock or livelock which can paralyze the network operations. The methods using detour can be divided into three main groups, depending on the mechanism they use to create a deadlockfree path around the fault: some approaches [1,6] opt for a more restricted set of path selection heuristics such as the turn model [2], some [3,7] use VCs, and some [1,7,8,9] require off-line reconfiguration of routing tables. Regardless of the mechanism being used, the detour-based algorithms suffer from two major drawbacks: (1) The hotspots are more likely to be created around the faults when rerouting is performed.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…However, rerouting may introduce deadlock or livelock which can paralyze the network operations. The methods using detour can be divided into three main groups, depending on the mechanism they use to create a deadlockfree path around the fault: some approaches [1,6] opt for a more restricted set of path selection heuristics such as the turn model [2], some [3,7] use VCs, and some [1,7,8,9] require off-line reconfiguration of routing tables. Regardless of the mechanism being used, the detour-based algorithms suffer from two major drawbacks: (1) The hotspots are more likely to be created around the faults when rerouting is performed.…”
Section: Related Workmentioning
confidence: 99%
“…Reconfiguration techniques have also been widely used [9,8] to design resilient NoCs. Most of the fault-tolerant algorithms studied earlier perform route reconfiguration to bypass faults.…”
Section: Related Workmentioning
confidence: 99%
“…Disabled interrouter links in the network reduce connectivity. One approach to maintaining connectivity is the use of additional links in the form of escape paths [Koibuchi et al 2008;Iordanou et al 2014;Kakoee et al 2011b]. A more radical approach is to replace simple links with Quad-Function Channel buffers [DiTomaso et al 2014].…”
Section: Recovery/protection/isolationmentioning
confidence: 99%
“…Recent route-reconfiguration solutions to bypass faulty links or routers can be broadly divided into two kinds, buffered solutions and deflection solutions. Buffered solutions include Ariadne [13], uDirec [12], Hermes [14], which all utilize traditional wormhole routing [15], and routing tables. Those algorithms typically take some time to update routing tables when a new fault is detected, and incur reconfiguration overhead.…”
Section: Introductionmentioning
confidence: 99%