Iterative procedural abstraction for code size reduction

Authors:
Dae-Hwan Kim;Hyuk Jae Lee
Affiliations:
Seoul National University, Seoul, Korea;Seoul National University, Seoul, Korea
Venue:
CASES '02 Proceedings of the 2002 international conference on Compilers, architecture, and synthesis for embedded systems
Year:
2002

Citing 3
Cited 1

Enhanced code compression for embedded RISC processors

Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Analyzing and compressing assembly code

SIGPLAN '84 Proceedings of the 1984 SIGPLAN symposium on Compiler construction
Graph Theory With Applications

Graph Theory With Applications

Procedural Abstraction with Reverse Prefix Trees

Proceedings of the 7th annual IEEE/ACM International Symposium on Code Generation and Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

For code size reduction, an iterative approach for procedural abstraction is proposed. Contrary to the previous approaches, the proposed technique iterates saving estimation and procedural abstraction repeatedly based on estimated global saving. The global saving is dynamically re-calculated in each iteration. Experimental results show that the proposed approach achieves additional code size reduction on an average of 14.9% in 8 benchmarks when compared to the previous conventional approach.