Combining global code and data compaction

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

Research output: Contribution to journalArticle

18 Citations (Scopus)

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
StatePublished - Aug 2001

Fingerprint

Compaction
Data storage equipment

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Combining global code and data compaction. / De Sutter, Bjorn; De Bus, Bruno; De Bosschere, Koen; Debray, Saumya K.

In: SIGPLAN Notices (ACM Special Interest Group on Programming Languages), Vol. 36, No. 8, 08.2001, p. 29-38.

Research output: Contribution to journalArticle

De Sutter, Bjorn ; De Bus, Bruno ; De Bosschere, Koen ; Debray, Saumya K. / Combining global code and data compaction. In: SIGPLAN Notices (ACM Special Interest Group on Programming Languages). 2001 ; Vol. 36, No. 8. pp. 29-38.
@article{3f5eebab065c439fab364fe5e61b109b,
title = "Combining global code and data compaction",
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.",
author = "{De Sutter}, Bjorn and {De Bus}, Bruno and {De Bosschere}, Koen and Debray, {Saumya K}",
year = "2001",
month = "8",
language = "English (US)",
volume = "36",
pages = "29--38",
journal = "ACM SIGPLAN Notices",
issn = "1523-2867",
publisher = "Association for Computing Machinery (ACM)",
number = "8",

}

TY - JOUR

T1 - Combining global code and data compaction

AU - De Sutter, Bjorn

AU - De Bus, Bruno

AU - De Bosschere, Koen

AU - Debray, Saumya K

PY - 2001/8

Y1 - 2001/8

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

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

UR - http://www.scopus.com/inward/record.url?scp=17244378620&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=17244378620&partnerID=8YFLogxK

M3 - Article

VL - 36

SP - 29

EP - 38

JO - ACM SIGPLAN Notices

JF - ACM SIGPLAN Notices

SN - 1523-2867

IS - 8

ER -