Java bytecode compression for low-end embedded systems
Lars Clausen, Ulrik Pagh Schultz, Charles Consel, Gilles Muller · ACM Transactions on Programming Languages and Systems · 2000
A program executing on a low-end embedded system, such as a smart-card, faces scarce memory resources and fixed execution time constraints. We demonstrate that factorization of common instruction sequences in Java bytecode allows the memory footprint to be reduced, on average, to 85% of its original size, with a minimal execution time penalty. While preserving Java compatibility, our solution requires only a few modifications which are straightforward to implement in any JVM used in a low-end embedded system.