An efficient compiler technique for code size reduction using reduced bit-width ISAs

Ashok Halambi, Aviral Shrivastava, Partha Biswas, Nikil Dutt, Alex Nicolau

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

35 Scopus citations

Abstract

For many embedded applications, program code size is a critical design factor. One promising approach for reducing code size is to employ a "dual instruction set", where processor architectures support a normal (usually 32 bit) Instruction Set, and a narrow, space-efficient (usually 16 bit) Instruction Set with a limited set of opcodes and access to a limited set of registers. This future, however, requires compilers that can reduce code size by compiling for both Instruction Sets. Existing compiler techniques operate at the function-level granularity and are unable to make the trade-off between increased register pressure (resulting in more spills) and decreased code size. We present a profitability based compiler heuristic that operates at the instruction-level granularity and is able to effectively take advantage: of both Instruction Sets. We also demonstrate improved code size reduction, for the MIPS 32/16 bit ISA, using our technique. Our approach more than doubles the code size reduction achieved by existing compilers.

Original languageEnglish (US)
Title of host publicationProceedings -Design, Automation and Test in Europe, DATE
Pages402-408
Number of pages7
DOIs
StatePublished - 2002
Externally publishedYes
Event2002 Design, Automation and Test in Europe Conference and Exhibition, DATE 2002 - Paris, France
Duration: Mar 4 2002Mar 8 2002

Other

Other2002 Design, Automation and Test in Europe Conference and Exhibition, DATE 2002
Country/TerritoryFrance
CityParis
Period3/4/023/8/02

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'An efficient compiler technique for code size reduction using reduced bit-width ISAs'. Together they form a unique fingerprint.

Cite this