Java bytecode compression for low-end embedded systems

64Citations
Citations of this article
12Readers
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.

References Powered by Scopus

A Method for the Construction of Minimum-Redundancy Codes

4651Citations
N/AReaders
Get full text

Compression of Individual Sequences via Variable-Rate Coding

2526Citations
N/AReaders
Get full text

Optimizing an ANSI C interpreter with superoperators

92Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Virtual Machine Showdown: Stack Versus Registers

77Citations
N/AReaders
Get full text

Practical extraction techniques for Java

53Citations
N/AReaders
Get full text

Link-time binary rewriting techniques for program compaction

49Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

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

Readers' Seniority

Tooltip

Professor / Associate Prof. 3

38%

PhD / Post grad / Masters / Doc 3

38%

Researcher 2

25%

Readers' Discipline

Tooltip

Computer Science 8

100%

Save time finding and organizing research with Mendeley

Sign up for free