Java Bytecode Compression for Embedded Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1998

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3578.pdf (286.51 Ko) Télécharger le fichier

Dates and versions

inria-00073103 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073103 , version 1

Cite

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

Share

Gmail Mastodon Facebook X LinkedIn More