Loading...
Please wait, while we are loading the content...
Similar Documents
Java bytecode compression for low-end embedded systems (2000)
| Content Provider | CiteSeerX |
|---|---|
| Author | Schultz, Ulrik Pagh Clausen, Lars Ræder Consel, Charles |
| 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. |
| File Format | |
| Journal | ACM Transactions on Programming Languages and Systems |
| Publisher Date | 2000-01-01 |
| Access Restriction | Open |
| Subject Keyword | Scarce Memory Resource Low-end Embedded System Java Bytecode Compression Common Instruction Sequence Minimal Execution Time Penalty Java Bytecode Original Size Java Compatibility Fixed Execution Time Constraint Memory Footprint |
| Content Type | Text |
