Java Bytecode Compression for Embedded Systems

Abstract : A program executing on an embedded system or similar environment faces limited memory resources and fixed time constrains. We demonstrate how factorization of common instruction sequences can be automatically applied to Java bytecode programs. Based on a series of experiments, we argue that program size is reduced by 30% on the average, typically with an execution time penalty of less than 30%. The one-time, minor modifications necessary to make a standard Java interpreter compatible with this factorized code are presented on the Harissa virtual machine, together with an algorithm for performing the factorization of Java bytecode.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00073103
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 11:52:05 AM
Last modification on : Wednesday, November 29, 2017 - 4:24:55 PM
Long-term archiving on : Sunday, April 4, 2010 - 11:34:19 PM

Identifiers

  • HAL Id : inria-00073103, version 1

Collections

Citation

Lars Raeder Clausen, Ulrik Pagh Schultz, Charles Consel, Gilles Muller. Java Bytecode Compression for Embedded Systems. [Research Report] RR-3578, INRIA. 1998. ⟨inria-00073103⟩

Share

Metrics

Record views

290

Files downloads

808