2018 IEEE 8th Annual Computing and Communication Workshop and Conference (CCWC) 2018
DOI: 10.1109/ccwc.2018.8301661
|View full text |Cite
|
Sign up to set email alerts
|

Encircle routing: An efficient deterministic network on chip routing algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…Another study found that this algorithm helps in the redistribution of traffic, which enhances the system's performance level and reduces congestion at the central. The encircle routing algorithm was presented in another article [92]. This algorithm, by the redistribution of traffic, helps enhance system performance and reduce congestion at the centre hub of the network.…”
Section: Workload Distributionmentioning
confidence: 99%
“…Another study found that this algorithm helps in the redistribution of traffic, which enhances the system's performance level and reduces congestion at the central. The encircle routing algorithm was presented in another article [92]. This algorithm, by the redistribution of traffic, helps enhance system performance and reduce congestion at the centre hub of the network.…”
Section: Workload Distributionmentioning
confidence: 99%
“…In ZigZag, packets forwarded along the axis have a greater distance, and when the difference along both axes remains only one hop, it starts forwarding in the ZigZag way. Some modifications to XY algorithms are also present by Atik et al [12] and Umapathy et al [112]. In [12] they implement buffer allocation on-demand basis, and [112] proposed to Encircle routing where the network is partitioned into regions, and then packets are forwarded in such a way that they do not enter another region.…”
Section: A Workload Distributionmentioning
confidence: 99%
“…Some modifications to XY algorithms are also present by Atik et al [12] and Umapathy et al [112]. In [12] they implement buffer allocation on-demand basis, and [112] proposed to Encircle routing where the network is partitioned into regions, and then packets are forwarded in such a way that they do not enter another region. Some research work also considers core lifetime.…”
Section: A Workload Distributionmentioning
confidence: 99%