Abstract | ||
---|---|---|
This paper presents an efficient technique for code compression. In our work, a sequence of instructions that occurs repeatedly in an application will be compressed to reduce its code size. During compression, each instruction is first divided into the operation part and the register part, and then only the operation part is compressed. For reducing the run-time overhead, we propose an instruction prefetching mechanism to speed the decompression. Moreover, we devise some optimization techniques to improve the code size reduction and the performance, and show their impacts. The experimental results show that our work can achieve a code size reduction of 33% on average and a low overhead in the process of decompression at run time for these benchmarks |
Year | DOI | Venue |
---|---|---|
2006 | 10.1007/11802167_31 | EUC |
Keywords | Field | DocType |
embedded real-time application,register part,optimization technique,operation part,efficient technique,optimizing code size,code size reduction,run-time overhead,code size,code compression,low overhead | Program optimization,Compression (physics),Code size,Computer science,Parallel computing,Real-time computing,Size reduction,Ubiquitous computing,Data compression,Self-modifying code,Code (cryptography) | Conference |
Volume | ISSN | ISBN |
4096 | 0302-9743 | 3-540-36679-2 |
Citations | PageRank | References |
1 | 0.41 | 5 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Shao-Yang Wang | 1 | 3 | 0.78 |
Chih-Yuan Chen | 2 | 1 | 0.41 |
Rong-Guey Chang | 3 | 99 | 14.70 |