TY - GEN
T1 - Combining global code and data compaction
AU - De Sutter, Bjorn
AU - De Bus, Bruno
AU - De Bosschere, Koen
AU - Debray, Saumya
N1 - Funding Information:
The work of B. De Sutter was supported by the Fund for Scientific Research - Flanders under grant 3G001998. B. De Bus's is supported by a grant from the Flemisch Institute mfor the Promotion of the Scientific Technological Research in the Industry (IWT). The work of S. Debray was supported nin part by the National Science Foundation under grants CCR-0073394, EIA-0080123, and ASC-9720738.
Publisher Copyright:
© ACM 2001.
PY - 2001/8/1
Y1 - 2001/8/1
N2 - Computers are increasingly being incorporated in devices with a limited amount of available memory. As a result research is increasingly focusing on the automated reduction of program size. Existing literature focuses on either data or code compaction or on highly language dependent techniques. This paper shows how combined code and data compaction can be achieved using a link-time code compaction system that reasons about the use of both code and data addresses. The analyses proposed rely only on fundamental properties of linked code and are therefore generally applicable. The combined code and data compaction is implemented in Squeeze, a link-time program compaction system, and evaluated on SPEC2000, MediaBench and C++ programs, resulting in total binary program size reductions of 23.6%-46.6%. This compaction involves no speed trade-off, as the compacted programs are on average about 8% faster.
AB - Computers are increasingly being incorporated in devices with a limited amount of available memory. As a result research is increasingly focusing on the automated reduction of program size. Existing literature focuses on either data or code compaction or on highly language dependent techniques. This paper shows how combined code and data compaction can be achieved using a link-time code compaction system that reasons about the use of both code and data addresses. The analyses proposed rely only on fundamental properties of linked code and are therefore generally applicable. The combined code and data compaction is implemented in Squeeze, a link-time program compaction system, and evaluated on SPEC2000, MediaBench and C++ programs, resulting in total binary program size reductions of 23.6%-46.6%. This compaction involves no speed trade-off, as the compacted programs are on average about 8% faster.
UR - http://www.scopus.com/inward/record.url?scp=85028066290&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85028066290&partnerID=8YFLogxK
U2 - 10.1145/384197.384204
DO - 10.1145/384197.384204
M3 - Conference contribution
AN - SCOPUS:85028066290
T3 - LCTES 2001 - Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers and Tools for Embedded Systems
SP - 29
EP - 38
BT - LCTES 2001 - Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers and Tools for Embedded Systems
PB - Association for Computing Machinery, Inc
T2 - 2001 ACM SIGPLAN Workshop on Languages, Compilers and Tools for Embedded Systems, LCTES 2001
Y2 - 22 June 2001 through 23 June 2001
ER -