Asia and South Pacific Conference on Design Automation, 2006.
DOI: 10.1109/aspdac.2006.1594785
|View full text |Cite
|
Sign up to set email alerts
|

Maximizing data reuse for minimizing memory space requirements and execution cycles

Abstract: Abstract-Embedded systems in the form of vehicles and mobile devices such as wireless phones, automatic banking machines and new multi-modal devices operate under tight memory and power constraints. Therefore, their performance demands must be balanced very well against their memory space requirements and power consumption. Automatic tools that can optimize for memory space utilization and performance are expected to be increasingly important in the future as increasingly larger portions of embedded designs ar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 12 publications
0
2
0
Order By: Relevance
“…Complementing the cache system, scratch-pad memory (SPM) has been recently given attention. Approaches for dynamic management and allocation of cache and SPM have been seen in [28,29,30]. There exists some research works on buffering reused data in FPGA on-chip embedded RAMs and registers [31,32,33].…”
Section: Related Workmentioning
confidence: 99%
“…Complementing the cache system, scratch-pad memory (SPM) has been recently given attention. Approaches for dynamic management and allocation of cache and SPM have been seen in [28,29,30]. There exists some research works on buffering reused data in FPGA on-chip embedded RAMs and registers [31,32,33].…”
Section: Related Workmentioning
confidence: 99%
“…The research on the assignment of signals (multidimensional arrays) to the memory layers [7] focused in part on how to restructure the application code to make better use of the available memory hierarchy [8]. Brockmeyer et al used the steering heuristic of assigning the arrays having the highest access number over size ratio to the cheapest memory layer, followed by incremental reassignments [9].…”
Section: Introductionmentioning
confidence: 99%