2000
DOI: 10.1145/353926.353933
|View full text |Cite
|
Sign up to set email alerts
|

Java bytecode compression for low-end embedded systems

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
52
0

Year Published

2002
2002
2013
2013

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 70 publications
(54 citation statements)
references
References 14 publications
2
52
0
Order By: Relevance
“…Another difference is related to the physical size of each of these memory types. The physical size constraints on a smart card dictate RAM memory/Flash memory ration often resulting in considerably smaller RAM memory in comparison to Flash memory [5,6].…”
Section: Methodsmentioning
confidence: 99%
“…Another difference is related to the physical size of each of these memory types. The physical size constraints on a smart card dictate RAM memory/Flash memory ration often resulting in considerably smaller RAM memory in comparison to Flash memory [5,6].…”
Section: Methodsmentioning
confidence: 99%
“…At present we use a simple format for the Descriptor file, in the future we will look at compression techniques [1,2,3,4,10,12] to reduce its size. Since the Descriptor file would only be needed during the installation of new applications and not during normal execution, it would seem a fair trade off to use encoding schemes that are slow to access, but provide good space savings.…”
Section: Class File Compressionmentioning
confidence: 99%
“…There has been previous work on compressing class files, while remaining directly executable. Clausen et al [4] shows how bytecodes can be compressed, while Bizzotto & Grimaud [2] extends the idea further. The details of this approach is beyond the scope of this paper, but shows that class file sizes could be reduced further, while remaining executable "as is".…”
Section: Overall Code Compressionmentioning
confidence: 99%
“…Static program analysis for identifying repetitive sequences of bytecodes for compression has been studied in [38,39]. Casey et al [40] proposed a Java instruction, called superinstruction, to reduce the number of instruction dispatches.…”
Section: Related Workmentioning
confidence: 99%