2012
DOI: 10.1109/tcad.2011.2181509
|View full text |Cite
|
Sign up to set email alerts
|

A Reliable Routing Architecture and Algorithm for NoCs

Abstract: Abstract-Aggressive transistor scaling continues to drive increasingly complex digital designs. The large number of transistors available today enables the development of chip multiprocessors that include many cores on one die communicating through an on-chip interconnect. As the number of cores increases, scalable communication platforms, such as networks-on-chip (NoCs), have become more popular. However, as the sole communication medium, these interconnects are a single point of failure so that any permanent… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
16
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
4
2
1

Relationship

2
5

Authors

Journals

citations
Cited by 74 publications
(17 citation statements)
references
References 60 publications
0
16
0
Order By: Relevance
“…The hardware of the routers in the system is checked as frequently as the cores using tests that require 150 000 cycles [51]. Router's lists of local connections is kept updated much more frequently, every 10 000 cycles, to ensure correct communication between directly connected nodes.…”
Section: G Full System Performance Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…The hardware of the routers in the system is checked as frequently as the cores using tests that require 150 000 cycles [51]. Router's lists of local connections is kept updated much more frequently, every 10 000 cycles, to ensure correct communication between directly connected nodes.…”
Section: G Full System Performance Analysismentioning
confidence: 99%
“…Storage requirements grow linearly with system size, and thus Cardio benefits are even more marked for larger CMPs. When we consider both reconfigurable routing tables and router self-test logic, interconnect area increases by approximately 11.4% [51].…”
Section: H Area Overheadmentioning
confidence: 99%
“…Upon a fault affecting a link (or a portion of a router impacting link operability) the disabled turns must be recomputed to allow packets to go through alternative surviving routes. This effort entails a global routing reconfiguration [4], and it does not guarantee deadlock-freedom. Up*/down* routing: Spanning tree-based routing algorithms, such as up*/down* routing [17], can be applied to route packets in any topology.…”
Section: A Alternative Route Generation Cost Analysismentioning
confidence: 99%
“…Most of them can be grouped into two families based on their approach to reconfiguration. The first family deploys routing tables and logic that are updated upon each fault occurrence [1,4,15,22]. This approach is topology-agnostic and, in the best case, it can tolerate an arbitrary number of faults, but suffers from high reconfiguration overhead.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation