ACM Home Page
Please provide us with feedback. Feedback
A dynamic code placement technique for scratchpad memory using postpass optimization
Full text PdfPdf (322 KB)
Source International Conference on Compilers, Architecture and Synthesis for Embedded Systems archive
Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems table of contents
Seoul, Korea
SESSION: Memory systems table of contents
Pages: 223 - 233  
Year of Publication: 2006
ISBN:1-59593-543-6
Authors
Bernhard Egger  Seoul National University, Seoul, Korea
Chihun Kim  Seoul National University, Seoul, Korea
Choonki Jang  Seoul National University, Seoul, Korea
Yoonsung Nam  Seoul National University, Seoul, Korea
Jaejin Lee  Seoul National University, Seoul, Korea
Sang Lyul Min  Seoul National University, Seoul, Korea
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
SIGBED: ACM Special Interest Group on Embedded Systems
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 117,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1176760.1176788
What is a DOI?

ABSTRACT

In this paper, we propose a fully automatic dynamic scratch-pad memory (SPM) management technique for instructions. Our technique loads required code segments into the SPM on demand at runtime. Our approach is based on postpass analysis and optimization techniques, and it handles the whole program, including libraries. The code mapping is determined by solving mixed integer linear programming formulation that approximates our demand paging technique. We increase the effectiveness of demand paging by extracting from functions natural loops that are smaller in size and have a higher instruction fetch count. The postpass optimizer analyzes the object files of an application and transforms them into an application binary image that enables demand paging to the SPM. We evaluate our technique on eleven embedded applications and compare it to a processor core with an instruction cache in terms of its performance and energy consumption. The cache size is about 20% of the executed code size, and the SPM size is chosen such that its die area is equal to that of the cache. The experimental results show that, on average, the processor core and memory subsystem's energy consumption can be reduced by 21.6% and the performance improved by 20.2%. Moreover, in comparison with the optimal static placement strategy, our technique reduces energy consumption by 23.7% and improves performance by 22.9%,on average.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers: Principles, Techniques, and Tools. Addison Wesley, 1986.
 
2
Federico Angiolini, Luca Benini, and Alberto Caprara. Polynomial-Time Algorithm for On-chip Scratchpad Memory Partitioning. In International Conference on Compilers, Architectures and Synthesis of Embedded Systems (CASES 2003), October 2003.
 
3
Federico Angiolini, Francesco Menichelli, Alberto Ferrero, Luca Benini, and Mauro Oliveri. A Post-Compiler Approach to Scratchpad Mapping of Code. In International Conference on Compilers, Architectures and Synthesis of Embedded Systems (CASES 2004), September 2004.
 
4
ARM. http://www.arm.com.
5
6
 
7
 
8
9
10
 
11
 
12
 
13
 
14
15
16
 
17
18
 
19
Inc Micron Technology. Mt48h8m16lf mobile sdram. 2003.
 
20
Micron Technology, Inc. Mobile SDRAM Power Calc 10. 2004.
 
21
 
22
 
23
24
25
 
26
27
 
28
29
 
30
31
 
32
S. Wilton and Norman Jouppi. CACTI: An Enhanced Access and Cycle Time Model. IEEE Journal of Solid State Circuits, 31(5): 677--688, 1996.

CITED BY  9

Collaborative Colleagues:
Bernhard Egger: colleagues
Chihun Kim: colleagues
Choonki Jang: colleagues
Yoonsung Nam: colleagues
Jaejin Lee: colleagues
Sang Lyul Min: colleagues