ACM Home Page
Please provide us with feedback. Feedback
Compiler-Guided data compression for reducing memory consumption of embedded applications
Full text PdfPdf (327 KB)
Source Asia and South Pacific Design Automation Conference archive
Proceedings of the 2006 Asia and South Pacific Design Automation Conference table of contents
Yokohama, Japan
SESSION: Memory optimization for embedded systems table of contents
Pages: 814 - 819  
Year of Publication: 2006
ISBN:0-7803-9451-8
Authors
O. Ozturk  Pennsylvania State University
G. Chen  Pennsylvania State University
M. Kandemir  Pennsylvania State University
I. Kolcu  University of Manchester
Sponsors
: IEEE Circuits and Systems Society
SIGDA: ACM Special Interest Group on Design Automation
IEICE ESS : Institute of Electronics, Information and Communication Engineers, Engineering Sciences Society
IPSJ SIG-SLDM : Information Processing Society of Japan, SIG System LSI Design Methodology
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 12,   Citation Count: 1
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/1118299.1118485
What is a DOI?

ABSTRACT

Memory system presents one of the critical challenges on embedded system design and optimization. This is mainly due to ever-increasing code complexity of embedded applications and exponential increase witnessed in the amount of data they manipulate. As a result, reducing memory space occupancy of embedded applications is very important and will be even more important in the next decade. Motivated by this observation, this paper presents and evaluates a compiler-driven approach to data compression for reducing memory space occupancy. Our goal in this paper is to study how automated compiler support can help in deciding the set of data elements to compress/decompress and the points during execution at which these compressions/decompressions should be performed. The proposed compiler support achieves this by analyzing the source code of the application to be optimized and identifying the order in which the different data blocks are accessed. Based on this analysis, the compiler then automatically inserts compression/decompression calls in the application code. The compression calls target the data blocks that are not expected to be used in the near future, whereas the decompression calls target those data blocks with expected reuse but currently in compressed form.


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
S. P. Amarasinghe, J. M. Anderson, M. S. Lam, and C. W. Tseng. The SUIF compiler for scalable parallel machines. In Proc. SIAM Conference on Parallel Processing for Scientific Computing, February, 1995.
 
4
T. M. Austin and D. Burger. The SimpleScalar architectural research tool set. http://www.cs.wisc.edu/~mscalar/simplescalar.html
 
5
 
6
C. D. Benveniste, P. A. Franaszek, and J. T. Robinson. Cache-Memory Interfaces in Compressed Memory Systems. In Proc. Workshop on Solving the Memory Wall Problem, June 2000.
 
7
M. Chen and M. L. Fowler. The importance of data compression for energy efficiency in sensor networks. In Proc. 2003 Conference on Information Sciences and Systems, The Johns Hopkins Univ., March 2003.
8
9
10
 
11
 
12
 
13
LZO Algorithm. http://gnuwin32.sourceforge.net/packages/lzo.htm
 
14
The Omega Project. http://www.cs.umd.edu/projects/omega/
 
15
 
16
B. P. Tunstall. Synthesis of Noiseless Compression Codes. PhD Thesis, Georgia Institute of Technology, Sept. 1967.
17
 
18
19
 
20


Collaborative Colleagues:
O. Ozturk: colleagues
G. Chen: colleagues
M. Kandemir: colleagues
I. Kolcu: colleagues