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.
Type de document :
[Research Report] RR-3578, INRIA. 1998
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 11:52:05
Dernière modification le : mercredi 29 novembre 2017 - 16:24:55
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:34:19



  • HAL Id : inria-00073103, version 1



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



Consultations de la notice


Téléchargements de fichiers