Java bytecode compression for low-end embedded systems

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...

Full description

Saved in:
Bibliographic Details
Published in:ACM transactions on programming languages and systems 2000-05, Vol.22 (3), p.471-489
Main Authors: Clausen, Lars Ræder, Schultz, Ulrik Pagh, Consel, Charles, Muller, Gilles
Format: Article
Language:English
Subjects:
Compilers
Interpreters
Java (Computer program language)
Programming languages
Runtime environments
Software and its engineering
Software notations and tools
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0164-0925
1558-4593
DOI:10.1145/353926.353933