Link-time binary rewriting techniques for program compaction

B De Sutter, B De Bus, K De Bosschere - ACM Transactions on …, 2005‏ - dl.acm.org
Small program size is an important requirement for embedded systems with limited amounts
of memory. We describe how link-time compaction through binary rewriting can achieve …

System-wide compaction and specialization of the Linux kernel

D Chanet, B De Sutter, B De Bus, L Van Put… - Proceedings of the …, 2005‏ - dl.acm.org
The limited built-in configurability of Linux can lead to expensive code size overhead when it
is used in the embedded market. To overcome this problem, we propose the application of …

A hamming distance based VLIW/EPIC code compression technique

M Ros, P Sutton - Proceedings of the 2004 international conference on …, 2004‏ - dl.acm.org
This paper presents and reports on a VLIW code compression technique based on vector
Hamming distances. It investigates the appropriate selection of dictionary vectors such that …

Code compression for embedded VLIW processors using variable-to-fixed coding

Y **e, W Wolf, H Lekatsas - IEEE Transactions on Very Large …, 2006‏ - ieeexplore.ieee.org
In embedded system design, memory is one of the most restricted resources, posing serious
constraints on program size. Code compression has been used as a solution to reduce the …

Automated reduction of the memory footprint of the linux kernel

D Chanet, B De Sutter, B De Bus, L Van Put… - ACM Transactions on …, 2007‏ - dl.acm.org
The limited built-in configurability of Linux can lead to expensive code size overhead when it
is used in the embedded market. To overcome this problem, we propose the application of …

[PDF][PDF] Code Compression Based on Operand-Factorization for VLIW Processor.

M Ros, P Sutton - Data Compression Conference, 2004‏ - Citeseer
As programs become more complex for both embedded systems and large-scale
applications, bloated code size continues to be an ever increasing problem. The size of …

A post-compilation register reassignment technique for improving hamming distance code compression

M Ros, P Sutton - Proceedings of the 2005 international conference on …, 2005‏ - dl.acm.org
Code compression is a field where compression ratios between compiler-generated code
and subsequent compressed code are highly dependent on decisions made at compile …

Compilation strategies for reducing code size on a VLIW processor with variable length instructions

TT Hahn, E Stotzer, D Sule, M Asal - International Conference on High …, 2008‏ - Springer
This paper describes the development and compiler utilization of variable length instruction
set extensions to an existing high-performance, 32-bit VLIW DSP processor. We describe …

A pattern based instruction encoding technique for high performance architectures

R Santos, R Batistella… - International Journal of …, 2009‏ - inderscienceonline.com
In this paper we propose a new technique to reduce the program footprint and the instruction
fetch latency in high performance architectures adopting long instructions in the memory …

[PDF][PDF] Space/time tradeoffs in code compression for the tms320c62x processor

SK Menon, P Shankar - 2004‏ - Citeseer
Reducing instruction memory requirements by improving code density using compression
techniques has been the aim of much recent work on embedded devices. Previous work has …