TENCON 2012 IEEE Region 10 Conference 2012
DOI: 10.1109/tencon.2012.6412341
|View full text |Cite
|
Sign up to set email alerts
|

Parameterized path-based, randomized, oblivious, minimal routing in 3D mesh NoC

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…At each level, there is the computation of intermediate nodes whose buffer capacity is measured and based on the availability of buffer and congestion status, the packets (flits) move forward so they can handle the optimal path in congested routes. PROM3D is efficient for latency and throughput [34] as it always finds minimal paths at each hop by choosing the higher probability of less congestion paths and larger buffer on the cost of increased power consumption due to computational overhead and use of VCs. As it needs a minimum of two VCs so the number of buffer reads/writes operations shall be higher.…”
Section: Performance Analysismentioning
confidence: 99%
“…At each level, there is the computation of intermediate nodes whose buffer capacity is measured and based on the availability of buffer and congestion status, the packets (flits) move forward so they can handle the optimal path in congested routes. PROM3D is efficient for latency and throughput [34] as it always finds minimal paths at each hop by choosing the higher probability of less congestion paths and larger buffer on the cost of increased power consumption due to computational overhead and use of VCs. As it needs a minimum of two VCs so the number of buffer reads/writes operations shall be higher.…”
Section: Performance Analysismentioning
confidence: 99%