1999
DOI: 10.1109/92.805750
|View full text |Cite
|
Sign up to set email alerts
|

Minimizing the required memory bandwidth in VLSI system realizations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
40
0
1

Year Published

2002
2002
2019
2019

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 63 publications
(41 citation statements)
references
References 14 publications
0
40
0
1
Order By: Relevance
“…An example is [57]. It optimizes the memory bandwidth in a separate step before compilation, thereby outputting a (partial) data assignment which constrains the final instruction scheduling.…”
Section: Access Ordermentioning
confidence: 99%
See 1 more Smart Citation
“…An example is [57]. It optimizes the memory bandwidth in a separate step before compilation, thereby outputting a (partial) data assignment which constrains the final instruction scheduling.…”
Section: Access Ordermentioning
confidence: 99%
“…Because how the linker assigns the data to the memories has such a large impact on the performance of the system, it is better to optimize the data assignment and the memory schedule together ( [57]). Our technique imposes restrictions on the assignment such that the energy is optimized, but still guarantee that the time-budget is met.…”
Section: Access Conflicts Reduce the System's Performancementioning
confidence: 99%
“…Extra stalls occur depending on whether the linker has assigned the C, B and=or D to the same memory. Because the way the linker assigns the data to the memories has such a large impact on the performance of the system, [37] optimises the data assignment and the memory schedule together. They impose restrictions on the assignment such that the energy is optimised, but still guarantee that the time-budget is met.…”
Section: Task Ordering To Trade-off Energy= Performancementioning
confidence: 99%
“…An example is [37]. It optimises the memory bandwidth in a separate step before compilation, thereby outputting a (partial) data assignment, which constrains the final instruction scheduling.…”
Section: Access Ordermentioning
confidence: 99%
“…The resulting MPSoC design has possibly several hardware and software IPs onto which application functionality has been mapped. Memory in this model is initially represented by abstract DBs, which are collections of scalars or arrays accessed by the application, similar to basic groups in [10]. Generally, this MPSoC design will have performance constraints, which is dependent on the application.…”
Section: A Assumptions and Problem Definitionmentioning
confidence: 99%