Proceedings of the 2nd IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis - CODES+ISSS 2004
DOI: 10.1145/1016720.1016748
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic overlay of scratchpad memory for energy minimization

Abstract: The memory subsystem accounts for a significant portion of the aggregate energy budget of contemporary embedded systems. Moreover, there exists a large potential for optimizing the energy consumption of the memory subsystem. Consequently, novel memories as well as novel algorithms for their efficient utilization are being designed. Scratchpads are known to perform better than caches in terms of power, performance, area and predictability. However, unlike caches they depend upon software allocation techniques f… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
100
1
4

Year Published

2006
2006
2012
2012

Publication Types

Select...
3
3
3

Relationship

0
9

Authors

Journals

citations
Cited by 120 publications
(107 citation statements)
references
References 21 publications
0
100
1
4
Order By: Relevance
“…In addition, several works are based on dynamic profiling of the behavior of data [17], instructions [13] or both [35] to choose the scratchpad memory contents. These techniques are complementary to our strategy, which relies on the fact that garbage collection is a highly predictable virtual machine phase because its usage of methods is largely application independent.…”
Section: Related Workmentioning
confidence: 99%
“…In addition, several works are based on dynamic profiling of the behavior of data [17], instructions [13] or both [35] to choose the scratchpad memory contents. These techniques are complementary to our strategy, which relies on the fact that garbage collection is a highly predictable virtual machine phase because its usage of methods is largely application independent.…”
Section: Related Workmentioning
confidence: 99%
“…Among those considering data allocation for SPM, some have focussed on allocation strategies for affine programs only [2,5,6,8] while the rest have proposed more general solutions [7,10]. So far as we are aware, none of the existing strategies provide an integrated solution.…”
Section: Related Workmentioning
confidence: 99%
“…Towards bridging this gap, recent research has focussed on developing compiler-guided dynamic allocation strategies [6,7,10]. Such research holds out the potential of making SPM's more competitive with the performance of caches.…”
Section: Introductionmentioning
confidence: 99%
“…In this way, it ensures that as many accesses as possible can be executed in parallel. Some very recent approaches ( [36]) dynamically reallocate data in the local layer. At compile time they perform a life analysis of the task and insert instructionc to dynamically copy code segements and variables onto the scratchpad at runtime.…”
Section: Data Layout Based Techniquesmentioning
confidence: 99%