Combining global code and data compaction

Bjorn De Sutter, Bruno De Bus, Koen De Bosschere, Saumya K Debray

Research output: Contribution to journalArticle

17 Scopus citations

Abstract

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 tradeoff, as the compacted programs are on average about 8% faster. Copyright ACM 2001.

Original languageEnglish (US)
Pages (from-to)29-38
Number of pages10
JournalSIGPLAN Notices (ACM Special Interest Group on Programming Languages)
Volume36
Issue number8
Publication statusPublished - Aug 2001

    Fingerprint

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this