2021 IEEE/ACM International Conference on Computer Aided Design (ICCAD) 2021
DOI: 10.1109/iccad51958.2021.9643448
|View full text |Cite
|
Sign up to set email alerts
|

Theoretical Analysis and Evaluation of NoCs with Weighted Round-Robin Arbitration

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 30 publications
0
2
0
Order By: Relevance
“…More recently, in order to represent packet flow in a NoC as an open feed-forward queuing network, Bhaskar and Venkatesh [12] proposed a mathematical model, with 10 and 15% of errors for NoCs with 36 routers and 64 routers respectively. Weighted Round-Robin arbitration has been proposed for priority based NoCs [13].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…More recently, in order to represent packet flow in a NoC as an open feed-forward queuing network, Bhaskar and Venkatesh [12] proposed a mathematical model, with 10 and 15% of errors for NoCs with 36 routers and 64 routers respectively. Weighted Round-Robin arbitration has been proposed for priority based NoCs [13].…”
Section: Related Workmentioning
confidence: 99%
“…We can see that the error remains below 2% until reaching the saturation, where a maximum error of 12% is found. It is important to note that the increase in error when the network gets highly congested is common to all analytical models [7], [10]- [13]. This is the trade-off for extremely short computation times compared with very long simulation times (see Section IV-D).…”
Section: B Parameters Exploration With Synthetic Trafficsmentioning
confidence: 99%