ACM Home Page
Please provide us with feedback. Feedback
Profile-driven compression scheme for embedded systems
Full text PdfPdf (183 KB)
Source Conference On Computing Frontiers archive
Proceedings of the 3rd conference on Computing frontiers table of contents
Ischia, Italy
SESSION: Resource-aware computing table of contents
Pages: 95 - 104  
Year of Publication: 2006
ISBN:1-59593-302-6
Authors
Israel Waldman  Haifa University, Haifa, Israel
Shlomit S. Pinter  IBM, Haifa Research Laboratory, Haifa, Israel
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 13,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

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

ABSTRACT

The extensive usage of embedded systems involves running complex applications that require tightly limited resources such as memory and storage. One efficient way to satisfy the resource requirements is to reduce the code size through code compression. Our work describes a software-based code compression scheme that reduces the storage space of a program, which in turn induces a reduction of access time to off-chip memory in SoC embedded architectures. To select those sections of code that are most advantageous for compression, our scheme utilizes profiling information to evaluate and trade off storage space reduction for future run-time overhead. During run-time, the compressed parts are decompressed as necessary into a run-time buffer for execution. Experimental results on the SPEC CPU2000 and MediaBench suites show reduction in code size averaging 18.5%, along with reasonable memory consumption overhead averaging 3.8%, and a reasonable run-time overhead averaging 7.8%.


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
 
2
3
4
 
5
M. Game and A. Booker. "CodePack: Code Compression for PowerPC Processors". MicroNews 5(1), IBM, 1999.
 
6
 
7
 
8
C. Lefurgy, E. Piccininni and T. Mudge. Reducing Code Size with Run-time Decompression. In Proceedings of the 6th International Symposium on High Performance Computer Architecture (HPCA 2000), January 2000, pp. 218.
 
9
10
 
11
 
12
 
13
 
14
MediaBench. http://cares.icsl.ucla.edu/mediabench.
 
15
I. Nahshon and D. Bernstein. FDPR - A Post-Pass Object Code Optimization Tool. In Proceedings of the Poster Session of the 6th International Conference on Compiler Construction (CC'96), April 1996, pp. 97--104.
 
16
M. Nelson. DataCompression.info. http://datacompression.info/.
 
17
 
18
SPEC CPU2000. http://www.spec.org/cpu2000/.
 
19
M. Timmermans. BICOM BIjective COMpressor. http://www3.sympatico.ca/mt0000/bicom/.
 
20
R. N. Williams. An Extremely Fast Ziv-Lempel Data Compression Algorithm. In Proceedings of the IEEE Data Compression Conference (DCC 1991), April 1991, pp. 362--371.
21
 
22
23

Collaborative Colleagues:
Israel Waldman: colleagues
Shlomit S. Pinter: colleagues