Proceedings of the International Conference on Compilers, Architecture, and Synthesis for Embedded Systems - CASES '01 2001
DOI: 10.1145/502217.502223
|View full text |Cite
|
Sign up to set email alerts
|

Heterogeneous memory management for embedded systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
39
0

Year Published

2003
2003
2020
2020

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 50 publications
(39 citation statements)
references
References 8 publications
0
39
0
Order By: Relevance
“…We do not directly exploit cache memories, but focus on scratch pad memories. These software controlled memories do not require complex tag-decoding logic [5]. Therefore, they have a lower energy cost per access compared to caches, and also reduce the indeterminacy of the system.…”
Section: Target Architecturementioning
confidence: 99%
“…We do not directly exploit cache memories, but focus on scratch pad memories. These software controlled memories do not require complex tag-decoding logic [5]. Therefore, they have a lower energy cost per access compared to caches, and also reduce the indeterminacy of the system.…”
Section: Target Architecturementioning
confidence: 99%
“…We do not directly exploit caches, but focus on scratchpad memories. These software-controlled memories do not require complex tag-decoding logic [10,14]. Therefore, they have a lower energy cost per access compared to caches and also reduce the indeterminacy of the system.…”
Section: Target Architecturementioning
confidence: 99%
“…In the context of embedded systems, only a few techniques decide where to store the data at runtime taking the memory architecture into account For instance, [14,59] decide at the design time for each call-site to malloc=new to which memory the data should be assigned. They base their decision on simple criteria; object colocation to avoid conflict misses, object size and access frequency.…”
Section: Runtime Policiesmentioning
confidence: 99%
“…Other proposals exist in the literature that use small buffers to increase performance or decrease power consumption ( [21][3] [2] [25] among others). However, none of them are targeted to deal with the wire delay problem in a clustered environment and do not provide the flexibility offered by the buffers proposed in this paper.…”
Section: Related Workmentioning
confidence: 99%
“…Assume the next piece of code, where a and b are 2-byte element arrays: [2] ... will continuously be mapped to cluster 3's L0 buffer. However, it has been observed that unrolling a loop N times (being N the number of clusters) helps to balance the workload of instructions among clusters and performance is often improved [22].…”
Section: Mapping Flexibilitymentioning
confidence: 99%