2018
DOI: 10.1007/s10766-018-0614-6
|View full text |Cite
|
Sign up to set email alerts
|

HARE: History-Aware Adaptive Routing Algorithm for Endpoint Congestion in Networks-on-Chip

Abstract: Endpoint congestion is one of the most challenging issues when designing low latency and high bandwidth on-chip interconnection networks. Tree saturation and head-ofline blocking caused by the endpoint congestion seriously decrease system throughput and increases network latency, leading to overall performance degradation. Adaptive routing algorithms utilize dynamic network states to route packets around congestion areas and potentially mitigate network congestions, but still cannot deal with endpoint congesti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(6 citation statements)
references
References 26 publications
0
6
0
Order By: Relevance
“…Adaptive routing. To assess the efficacy of adaptive routing against NoC clogging, we implement and evaluate the DyXY [45], Footprint [22], and HARE [37] adaptive routing schemes. Figure 7 compares GPU performance with the adaptive policies to our baseline which uses CDR routing [3].…”
Section: B Noc-centric Approachesmentioning
confidence: 99%
See 1 more Smart Citation
“…Adaptive routing. To assess the efficacy of adaptive routing against NoC clogging, we implement and evaluate the DyXY [45], Footprint [22], and HARE [37] adaptive routing schemes. Figure 7 compares GPU performance with the adaptive policies to our baseline which uses CDR routing [3].…”
Section: B Noc-centric Approachesmentioning
confidence: 99%
“…Cache-centric approaches (e.g., [5], [13], [28], [29], [30], [31]) rely solely on inter-core locality, but are fundamentally limited as they either (i) incur the complexity and overhead of precisely tracking sharers for correctness (either at the level of a cache block [5], [28] or across memory regions as in coarse-grain coherence [13]); (ii) deliver suboptimal effective bandwidth to applications with (large) shared data sets (as in shared L1 caches [29], [30]); or (iii) must search for potential sharers (as in Realistic Probing (RP) [31]). In contrast, NoC-centric approaches (e.g., [22], [33], [37], [45]) attempt to address clogging through (selective) overprovisioning or advanced network policies. Within the NoC, performance is fundamentally constrained by the clogged links and can only be improved by providing more bandwidth.…”
Section: Introductionmentioning
confidence: 99%
“…This phenomenon reduces the effective rate of the NoC, or in the worst case, can cause blocking of traffic and failure of certain network resources. For this purpose, a huge number of approaches were proposed to surmount the negative effect of congestion and improve the network performance: reconfigurable routers and novel NoC architectures were designed to avoid router and network congestion; congestion metrics were included to complete the design of adaptive routing algorithms intended for congestion reduction [14,6,28]; End-to-end flow control technique also was suggested to adjust injecting packets into any emerging network congestion [30,26,27]; thus selection strategies were developed to reduce congestion and improve network performance with regards to latency [1,8,15].…”
Section: Our Graphical Simulator For Data-flow Monitoring On Networmentioning
confidence: 99%
“…End congestion due to HoL blocking is one of the main reasons for performance degradation in IQR [12]. The traditional IQRs have input queues organized as VCs [13].…”
Section: Introductionmentioning
confidence: 99%