Combining global code and data compaction

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (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 com-paction system that reasons about the use of both code and data addresses. The analyses proposed rely only on fun-damental 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-o, as the compacted programs are on average about 8% faster.

Original languageEnglish (US)
Title of host publicationProceedings of the 2001 ACM SIGPLAN Workshop on Optimization of Middleware and Distributed Systems, OM 2001
PublisherAssociation for Computing Machinery, Inc
Pages39-47
Number of pages9
ISBN (Print)1581134266, 9781581134261
DOIs
StatePublished - Aug 1 2001
Event2001 ACM SIGPLAN Workshop on Optimization of Middleware and Distributed Systems, OM 2001 - Snowbird, United States
Duration: Jun 18 2001 → …

Other

Other2001 ACM SIGPLAN Workshop on Optimization of Middleware and Distributed Systems, OM 2001
CountryUnited States
CitySnowbird
Period6/18/01 → …

Fingerprint

Compaction
Data storage equipment

Keywords

  • Banked register file
  • Register allocation

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software

Cite this

De Sutter, B., De Bus, B., De Bosschere, K., & Debray, S. K. (2001). Combining global code and data compaction. In Proceedings of the 2001 ACM SIGPLAN Workshop on Optimization of Middleware and Distributed Systems, OM 2001 (pp. 39-47). Association for Computing Machinery, Inc. https://doi.org/10.1145/384198.384205

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

Proceedings of the 2001 ACM SIGPLAN Workshop on Optimization of Middleware and Distributed Systems, OM 2001. Association for Computing Machinery, Inc, 2001. p. 39-47.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

De Sutter, B, De Bus, B, De Bosschere, K & Debray, SK 2001, Combining global code and data compaction. in Proceedings of the 2001 ACM SIGPLAN Workshop on Optimization of Middleware and Distributed Systems, OM 2001. Association for Computing Machinery, Inc, pp. 39-47, 2001 ACM SIGPLAN Workshop on Optimization of Middleware and Distributed Systems, OM 2001, Snowbird, United States, 6/18/01. https://doi.org/10.1145/384198.384205
De Sutter B, De Bus B, De Bosschere K, Debray SK. Combining global code and data compaction. In Proceedings of the 2001 ACM SIGPLAN Workshop on Optimization of Middleware and Distributed Systems, OM 2001. Association for Computing Machinery, Inc. 2001. p. 39-47 https://doi.org/10.1145/384198.384205
De Sutter, Bjorn ; De Bus, Bruno ; De Bosschere, Koen ; Debray, Saumya K. / Combining global code and data compaction. Proceedings of the 2001 ACM SIGPLAN Workshop on Optimization of Middleware and Distributed Systems, OM 2001. Association for Computing Machinery, Inc, 2001. pp. 39-47
@inproceedings{c0d15efe7ec54a60af2ce17b97f6322a,
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 com-paction system that reasons about the use of both code and data addresses. The analyses proposed rely only on fun-damental 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-o, as the compacted programs are on average about 8{\%} faster.",
keywords = "Banked register file, Register allocation",
author = "{De Sutter}, Bjorn and {De Bus}, Bruno and {De Bosschere}, Koen and Debray, {Saumya K}",
year = "2001",
month = "8",
day = "1",
doi = "10.1145/384198.384205",
language = "English (US)",
isbn = "1581134266",
pages = "39--47",
booktitle = "Proceedings of the 2001 ACM SIGPLAN Workshop on Optimization of Middleware and Distributed Systems, OM 2001",
publisher = "Association for Computing Machinery, Inc",

}

TY - GEN

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/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 com-paction system that reasons about the use of both code and data addresses. The analyses proposed rely only on fun-damental 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-o, 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 com-paction system that reasons about the use of both code and data addresses. The analyses proposed rely only on fun-damental 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-o, as the compacted programs are on average about 8% faster.

KW - Banked register file

KW - Register allocation

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

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

U2 - 10.1145/384198.384205

DO - 10.1145/384198.384205

M3 - Conference contribution

SN - 1581134266

SN - 9781581134261

SP - 39

EP - 47

BT - Proceedings of the 2001 ACM SIGPLAN Workshop on Optimization of Middleware and Distributed Systems, OM 2001

PB - Association for Computing Machinery, Inc

ER -