Java']Java bytecode compression for low-end embedded systems

被引：37

作者：

Clausen, LR ^{[1
]}

Schultz, UP ^{[1
]}

Consel, C ^{[1
]}

Muller, G ^{[1
]}

机构：

[1] INRIA, IRISA, Compose Grp, F-35042 Rennes, France

来源：

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS | 2000年 / 22卷 / 03期

关键词：

design; experimentation; code compression; embedded systems; !text type='Java']Java[!/text] bytecode;

D O I：

10.1145/353926.353933

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：471 / 489

页数：19

共 35 条

[1]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness

[2]

Antonov IP, 1998, ZH NEVROPATOL PSIKH, V98, P4

[3]

Bell T. C., 1990, TEXT COMPRESSION

[4]

BRADLEY Q, 1998, P CASCON 98 TOR ONT, P294

[5]

Clausen LR, 1997, CONCURRENCY-PRACT EX, V9, P1031, DOI 10.1002/(SICI)1096-9128(199711)9:11<1031::AID-CPE354>3.0.CO

[6]

2-O

[7]

CLAUSEN LR, 1998, 3578 INRIA

[8]

*DALL SEM CORP, 1998, JAV POW DEC RING

[9] Code compression [J].

Ernst, J ;

Evans, W ;

Fraser, CW ;

Lucco, S ;

Proebsting, TA .

ACM SIGPLAN NOTICES, 1997, 32 (05) :358-365

[10] Slim barriers [J].

Franz, M ;

Kistler, T .

COMMUNICATIONS OF THE ACM, 1997, 40 (12) :87-94

← 1 2 3 4 →