2007 IEEE International Conf. On Application-Specific Systems, Architectures and Processors (ASAP) 2007
DOI: 10.1109/asap.2007.4429960
|View full text |Cite
|
Sign up to set email alerts
|

Performance Evaluation of Probe-Send Fault-tolerant Network-on-chip Router

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2007
2007
2013
2013

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 5 publications
0
5
0
Order By: Relevance
“…For other cases (change in V and N), this characterization is not very significant because phit size is constant and the clock cycle is almost the same as that of the best-case router latency at the expense of increase in area and power. The effect of increasing V is more dynamic because of its interference with the blocking probability, and is reported in a separate paper [10]. Bandwidth increases linearly with increments in the phit size, and the bestcase router latency remains almost the same.…”
Section: Figure 6 Characterization Wrt Number Of Nodesmentioning
confidence: 86%
“…For other cases (change in V and N), this characterization is not very significant because phit size is constant and the clock cycle is almost the same as that of the best-case router latency at the expense of increase in area and power. The effect of increasing V is more dynamic because of its interference with the blocking probability, and is reported in a separate paper [10]. Bandwidth increases linearly with increments in the phit size, and the bestcase router latency remains almost the same.…”
Section: Figure 6 Characterization Wrt Number Of Nodesmentioning
confidence: 86%
“…Works on [15], [16], [17], [18] propose network exploration techniques to detect permanent faults. Some of them could be implemented only on regular topologies, while others are more flexible.…”
Section: B Fault Tolerace At Routing Levelmentioning
confidence: 99%
“…Such routing method requires a large memory on every router to store all complete paths, and the paths computation after a fault be detected, be done on a central (not faulty) node in order to avoid deadlock situations on new routing scheme. Other described mechanisms in this document uses distributed routing, instead of centralized control which needs a completely knowledge of the full network Works on [15] and [17] propose an adaptive routing mechanism based on paths exploration using up to 8 virtual channels for supporting permanent faults on k.-ary 2-cube NoCs.…”
Section: B Fault Tolerace At Routing Levelmentioning
confidence: 99%
“…Another trend for such architectures is network-on-chip (NoC) becoming a standard for on-chip global communication. In an earlier work, a generic fault tolerant routing algorithm in the context of NoCs has been presented [5], [6].In this paper, we characterize the system requirements of NoC based systems and propose a novel routing protocol for providing additional Bandwidth with QoS in NoCs.…”
Section: Introductionmentioning
confidence: 99%