Routing Algorithms in Networks-on-Chip 2013
DOI: 10.1007/978-1-4614-8274-1_6
|View full text |Cite
|
Sign up to set email alerts
|

Efficient and Deadlock-Free Tree-Based Multicast Routing Methods for Networks-on-Chip (NoC)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 22 publications
0
1
0
Order By: Relevance
“…It uses a lottery mechanism for packet prioritization and sends the packets in heavy loaded buffers sooner to the output; however they do not mention the amount of area overhead of their arbiter compared to the round robin arbiter which they have used for performance comparison. A NoC with two-level priority data delivery service has been proposed in [4]. Packets are divided into two groups of high and low priority to support QoS.…”
Section: Introductionmentioning
confidence: 99%
“…It uses a lottery mechanism for packet prioritization and sends the packets in heavy loaded buffers sooner to the output; however they do not mention the amount of area overhead of their arbiter compared to the round robin arbiter which they have used for performance comparison. A NoC with two-level priority data delivery service has been proposed in [4]. Packets are divided into two groups of high and low priority to support QoS.…”
Section: Introductionmentioning
confidence: 99%