System-wide compaction and specialization of the linux kernel

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 link-time compaction and specialization techniques that exploit the a priori known, fixed run-time environment of many embedded systems. In experimental setups based on the ARM XScale and i386 platforms, the proposed techniques are able to reduce the kernel memory footprint with over 16%. We also show how relatively simple additions to existing binary rewriters can implement the proposed techniques for a complex, very unconventional program such as the Linux kernel. Finally, we pinpoint an important code size growth problem when compaction and compression techniques are combined on the ARM platform. Categories and Subject Descriptors E.4 [Coding and Information Theory]: Data Compaction and Compression—program representation; D.3.4 [Programming Languages]: Processors—code generation;compilers;optimiz...

• Type: Conference
• Year: 2005
• Where: LCTRTS
• Authors: Dominique Chanet, Bjorn De Sutter, Bruno De Bus, Ludo Van Put, Koen De Bosschere
• Keywords: Code Size, LCTRTS 2005, Link-time Compaction, Linux Kernel, Software Engineering