Efficiently Adapting Java Binaries in Limited Memory Contexts

This paper presents a compilation framework that allows executable code to be shared across different Java Virtual Machine (JVM) instances. All fully compliant JVMs that target servers rely on run-time compilation, since dynamic Java features prevent a static compiler from being fully Java compatible. These JVMs are burdened with large memory footprints (because of the size of the increasingly complicated compilers) and high startup costs. Fully compliant JVMs on handheld devices often rely on interpretation--since the overhead of an on-device compiler cannot be supported--and therefore suffer from slower execution speeds and increased energy costs. Quasi-static compilation was proposed as a solution to these difficulties by reusing precompiled binary images after performing validation checks and adapting them to a new execution context, falling back to interpretation or dynamic compilation only when necessary to maintain Java semantics. Our previous quasi-static system required that ...

• Type: Journal
• Year: 2002
• Where: IJPP
• Authors: Pramod G. Joisha, Samuel P. Midkiff, Mauricio J. Serrano, Manish Gupta
• Keywords: Compliant Jvms, Executable Code, IJPP 2002, Java