Work

Java bytecode compression for low-end embedded systems

Year: 2000

Type: article

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

Source: ACM Transactions on Programming Languages and Systems

DOI: 10.1145/353926.353933

Authors: Lars Ræder Clausen, Ulrik Pagh Schultz, Charles Consel, Gilles Muller

Institutions: Institut national de recherche en sciences et technologies du numérique, Institut de Recherche en Informatique et Systèmes Aléatoires, Centre Inria de l'Université de Rennes

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2000832133

FWCI: 18.06

Cites: 26

Cited by: 85

Related to: 10