2016 2nd IEEE International Conference on Computer and Communications (ICCC) 2016
DOI: 10.1109/compcomm.2016.7925054
|View full text |Cite
|
Sign up to set email alerts
|

Traffic Allocation: An efficient adaptive network-on-chip routing algorithm design

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
4
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 6 publications
0
4
0
Order By: Relevance
“…Its versatility has been successfully demonstrated across various wireless system developments, including 802.11 and LTE domains-proving its effectiveness transcends different applications. In a different study [83], researchers proposed the Traffic Allocation routing algorithm as a viable solution to address the challenges faced in developing efficient routing algorithms for the NoC architectures. This innovative algorithm integrates traffic allocation registers and leverages local computations to evaluate traffic loads, resulting in improved performance when compared with existing algorithms.…”
Section: Workload Distributionmentioning
confidence: 99%
“…Its versatility has been successfully demonstrated across various wireless system developments, including 802.11 and LTE domains-proving its effectiveness transcends different applications. In a different study [83], researchers proposed the Traffic Allocation routing algorithm as a viable solution to address the challenges faced in developing efficient routing algorithms for the NoC architectures. This innovative algorithm integrates traffic allocation registers and leverages local computations to evaluate traffic loads, resulting in improved performance when compared with existing algorithms.…”
Section: Workload Distributionmentioning
confidence: 99%
“…Later in phases, it traverses positive and negative sets of the node. Wang and Valencia [117] proposed Traffic Allocation (TA) routing that monitors different direction traffic flow information of a router and maintains registers to store each direction information. This strategy helps distribute traffic more evenly and does not involve additional communication overhead to get neighbor buffer status.…”
Section: A Workload Distributionmentioning
confidence: 99%
“…The routing algorithms GOAL, GAL, DyXY, BARP, ADBR, MaS, Fault-tolerant, FAFT, FT-DyXY, Free-rider, Novel Adaptive, Traffic allocator, MCAR, Efficient deadlock-free, ESPDA and Adaptive multipath are adaptive routing algorithm [9,[14][15][16][17][18][19][20][21][22][23][24][25][26][27][28]. OE and 3DEP are partial adaptive routing algorithm [29,30].…”
Section: Routing Typementioning
confidence: 99%
“…The power consumption of FT-XY under uniform traffic of 4×4 NoC is .01 to .09 J and for 6×6 NoC its .02 to .09 J for injection rate of .005 to .019 packet/cycle/node [33]. The power consumption for ADBR is .00035J, for MaS algorithm it's a 6.5w at injection rate of 0.21 packet/cycle/node, for Traffic allocation routing algorithm it's 61.973mw when load is 50%, for ZigZig algorithm it's 62.698mw when load is 50% and for Link sharing algorithm it's 2.86mw [17,19,24,34,50].…”
Section: Power Dissipationmentioning
confidence: 99%