Compilation framework for code size reduction using reduced bit-width ISAs (rISAs)

Authors:
Aviral Shrivastava;Partha Biswas;Ashok Halambi;Nikil Dutt;Alex Nicolau
Affiliations:
University of California, Irvine, Irvine, CA;University of California, Irvine, Irvine, CA;University of California, Irvine, Irvine, CA;University of California, Irvine, Irvine, CA;University of California, Irvine, Irvine, CA
Venue:
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Year:
2006

Citing 5
Cited 3

EXPRESSION: a language for architecture exploration through compiler/simulator retargetability

DATE '99 Proceedings of the conference on Design, automation and test in Europe
Code compression for low power embedded system design

Proceedings of the 37th Annual Design Automation Conference
Cached-code compression for energy minimization in embedded processors

ISLPED '01 Proceedings of the 2001 international symposium on Low power electronics and design
Enhancing the performance of 16-bit code using augmenting instructions

Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems
Energy efficient code generation exploiting reduced bit-width instruction set architectures (rISA)

Proceedings of the 2004 Asia and South Pacific Design Automation Conference

Architecture description language (ADL)-driven software toolkit generation for architectural exploration of programmable SOCs

Proceedings of the 41st annual Design Automation Conference
Processor Description Languages

Processor Description Languages
Efficient compilation for queue size constrained queue processors

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

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 feature however, requires compilers that can reduce code size by compiling for both Instruction Sets. Existing compiler techniques operate at the routine-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 compilation framework for such dual instruction sets, which uses a profitability based compiler heuristic that operates at the instruction-level granularity and is able to effectively take advantage of both Instruction Sets. We demonstrate consistent and improved code size reduction (on average 22%), for the MIPS 32/16 bit ISA. We also show that the code compression obtained by this “dual instruction set” technique is heavily dependent on the application characteristics and the narrow Instruction Set itself.