Java bytecode compression for low-end embedded systems

66Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Clausen, L. R., Schultz, U. P., Consel, C., & Muller, G. (2000). Java bytecode compression for low-end embedded systems. ACM Transactions on Programming Languages and Systems, 22(3), 471–489. https://doi.org/10.1145/353926.353933

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free