ACM Home Page
Please provide us with feedback. Feedback
On the side-effects of code abstraction
Full text PdfPdf (442 KB)
Source Language, Compiler and Tool Support for Embedded Systems archive
Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems table of contents
San Diego, California, USA
SESSION: Efficiency of compressed code table of contents
Pages: 244 - 253  
Year of Publication: 2003
ISBN:1-58113-647-1
Also published in ...
Authors
Bjorn De Sutter  Ghent University, Gent, Belgium
Hans Vandierendonck  Ghent University, Gent, Belgium
Bruno De Bus  Ghent University, Gent, Belgium
Koen De Bosschere  Ghent University, Gent, Belgium
Sponsors
ACM: Association for Computing Machinery
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 20,   Citation Count: 7
Additional Information:

abstract   references   cited by   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/780732.780766
What is a DOI?

ABSTRACT

More and more devices contain computers with limited amounts of memory. As a result, code compaction techniques are gaining popularity, especially when they also improve performance and power consumption, or at least not degrade it. This paper quantifies the side-effects of code abstraction on performance using extensive measurements and simulations on the SPECint2000 benchmark suite and some additional C++ programs. We show how to use profile information in order to obtain almost all the code size reduction benefits of code abstraction, yet experience almost none of its disadvantages.


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
B. S. Baker and U. Manber. Deducing similarities in Java sources from bytecodes. In USENIX Annual Technical Conference, pages 179--190, June 1998.
3
 
4
D. Burger, T. M. Austin, and S. Bennett. Evaluating future microprocessors: The SimpleScalar tool set. Technical report, Computer Sciences Department, University of Wisconsin-Madison, July 1996.
 
5
W.-K. Chen, R. Gupta, and B. Li. Code compaction of matching single-entry multiple-exit regions. In Proceedings of the the 10th Annual International Static Analysis Symposium, June 2003. To appear.
6
7
8
9
10
11
12
13
 
14
C. Fraser and T. Proebsting. Custom instruction sets for code compression. http://research.microsoft.com/~toddpro, 1995.
 
15
O. Kaser and C. Ramakrishnan. Evaluating inlining techniques. Computer Languages, 24:55--72, 1998.
 
16
 
17
 
18
19
 
20

CITED BY  7

Collaborative Colleagues:
Bjorn De Sutter: colleagues
Hans Vandierendonck: colleagues
Bruno De Bus: colleagues
Koen De Bosschere: colleagues