2008
DOI: 10.1016/j.entcs.2008.02.003
|View full text |Cite
|
Sign up to set email alerts
|

Elastic Flow in an Application Specific Network-on-Chip

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
5
2
1

Relationship

4
4

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 16 publications
0
6
0
Order By: Relevance
“…We used a method extended from [33] that uses force-directed movement to provide router locations and link lengths to the SA process. Force vectors are applied to routers that are proportional to: (a) bandwidth requirements and (b) physical distances between the router and its attached core or router.…”
Section: A Topology and Placementmentioning
confidence: 99%
“…We used a method extended from [33] that uses force-directed movement to provide router locations and link lengths to the SA process. Force vectors are applied to routers that are proportional to: (a) bandwidth requirements and (b) physical distances between the router and its attached core or router.…”
Section: A Topology and Placementmentioning
confidence: 99%
“…I-E performed better for some applications while I/E generated better results for other. Moreover, the custom topologies generated from algorithms 1-4 performed better over the energy efficient mapping of cores onto standard structures like mesh and binary tree presented in [5], [7]. Similar procedure could be followed for a latency and bandwidth constrained graph with effective weights calculated using heuristic presented in section 3.E.…”
Section: Resultsmentioning
confidence: 94%
“…We calculated the power consumption for VOPD, H.264 Decoder, MPEG4 Decoder, MWD, H.263 enc MP3 enc and H.263 dec MP3 dec, which are commonly used benchmarks, onto the following topologies: 1)Modified Greedy Binary Tree 2)EquiMinCut-MappingTree 3)I-E Heuristic Tree 4)I/E Heuristic Tree obtained from the aforementioned algorithms and compared with Modified Complete Binary Tree [7], Star and MOCA optimal Mesh [5].…”
Section: Power Analysismentioning
confidence: 99%
“…The initial topology is a balanced tree, where a heuristic maps cores to leaves [1]. Force-directed placement is done to complete the initial solution.…”
Section: Evaluation and Resultsmentioning
confidence: 99%